can u solve this question? with bit manipulation in constant extra space and linear time complexity
▎Title: 137. Single Number II

Difficulty: Medium

Denoscription:

Given an integer array nums where every element appears three times except for one, which appears exactly once, find the single element and return it.

You must implement a solution with a linear runtime complexity and use only constant extra space.

Example 1:
Input: nums = [2,2,3,2]
Output: 3

Example 2:
Input: nums = [0,1,0,1,0,1,99]
Output: 99

Constraints:

• 1 <= nums.length <= 3 * 10^4

• -2^31 <= nums[i] <= 2^31 - 1

• Each element in nums appears exactly three times except for one element which appears once.

🚨 16 Billion Logins Leaked in Historic Data Breach

Cybersecurity researchers have uncovered one of the largest breaches ever. Over 16 billion login credentials—including social media, corporate, VPN, and email accounts—have been leaked online. The data is recent and weaponizable, gathered through malware from unsecured databases. It includes:

* Usernames, passwords, and URLs
* Apple accounts, Telegram-linked accounts, and more
* Datasets originating from the Russian Federation

Experts warn this leak is a blueprint for mass exploitation, enabling identity theft, phishing, and account takeovers.

Check if your email was exposed:
Using this link

Protect yourself now:

* Enable Two‑Factor Authentication (2FA)
* Use a password manager
* Rotate your passwords regularly

Stay safe.

If you're procrastinating and if being focus is hard for u ,read this great book