Bit Manipulation problems

146 Bit Manipulation problems on CampusCode, in order. Open any for its full statement, examples and constraints.

• 1265. Check if a Number is Even or Odd Using Bit Easy
• 1266. Check if Nth Bit is Set Easy
• 1267. Set the Nth Bit of a Number Easy
• 1268. Clear the Nth Bit of a Number Easy
• 1269. Toggle the Nth Bit of a Number Easy
• 1270. Count Number of Set Bits (Hamming Weight) Easy
• 1271. Check if a Number is a Power of Two Easy
• 1272. Check if a Number is a Power of Four Easy
• 1273. Swap Two Numbers Without a Temp Variable Easy
• 1274. Find the Rightmost Set Bit Position Easy
• 1275. Find the Rightmost Unset Bit Position Easy
• 1276. Turn Off the Rightmost Set Bit Easy
• 1277. Isolate the Rightmost Set Bit Easy
• 1278. Check if Two Numbers Have Opposite Signs Easy
• 1279. Find Absolute Value Without Branching Easy
• 1280. Compute XOR from 1 to N Easy
• 1281. Find XOR of All Numbers in a Range [L, R] Easy
• 1282. Count Bits to Flip A to B Easy
• 1283. Reverse All Bits of an Integer Easy
• 1284. Find the Only Non-Repeating Element (XOR) Easy
• 1285. Multiply a Number by 2 Using Left Shift Easy
• 1286. Divide a Number by 2 Using Right Shift Easy
• 1287. Find Upper and Lower Case of a Character Easy
• 1288. Invert Case of All Characters in a String Easy
• 1289. Add 1 to a Number Without + Operator Easy
• 1290. Subtract 1 from a Number Without - Operator Easy
• 1291. Find Maximum of Two Numbers Without If Easy
• 1292. Find Minimum of Two Numbers Without If Easy
• 1293. Check if a Number is Divisible by 4 Easy
• 1294. Check if a Number is Divisible by 8 Easy
• 1295. Round Down to Nearest Power of Two Easy
• 1296. Round Up to Nearest Power of Two Easy
• 1297. Copy Sign Bit from One Number to Another Easy
• 1298. Merge Bits from Two Values at a Mask Easy
• 1299. Clear All Bits from MSB to Nth Bit Easy
• 1300. Clear All Bits from Nth Bit to LSB Easy
• 1301. Count Trailing Zeros Using Bit Trick Easy
• 1302. Count Leading Zeros of an Integer Easy
• 1303. Compute Modulo Without % Operator Easy
• 1304. Find Position of Only Set Bit Easy
• 1305. Single Number I — One Element Appears Once Easy
• 1306. Missing Number in Array (XOR Approach) Easy
• 1307. Find the Two Non-Repeating Elements Easy
• 1308. Detect if Two Integers Have Opposite Signs Easy
• 1309. XOR of All Subsets Easy
• 1310. Check if XOR of Array is Zero Easy
• 1311. Find XOR of Digits of a Number Easy
• 1312. Pairs with XOR Equal to K Easy
• 1313. Toggle All Bits After MSB Easy
• 1314. Copy Set Bits of a Number in Another Easy
• 1315. Count Bits to Convert A to B Easy
• 1316. Number of 1-Bits in All Numbers from 0 to N Easy
• 1317. Sum of Bit Differences Among All Pairs Easy
• 1318. Counting Bits — DP + Bit Easy
• 1319. Binary Number with Alternating Bits Easy
• 1320. Complement of a Number Easy
• 1321. Find the Difference Between Two Strings (XOR) Easy
• 1322. Hamming Distance Between Two Integers Easy
• 1323. Total Hamming Distance for All Pairs Easy
• 1324. Number of Valid Words for Each Puzzle Easy
• 1325. Subsets Generation Using Bitmask Medium
• 1326. Check if a Set is a Subset of Another Medium
• 1327. Count Subsets with Given XOR Medium
• 1328. Count Subsets with Given AND Value Medium
• 1329. Power Set Using Bitmask Medium
• 1330. Beautiful Arrangement — Bitmask Backtracking Medium
• 1331. Partition Array into Two Subsets with Min Diff Medium
• 1332. Count of Pairs with AND Equal to Zero Medium
• 1333. Maximum AND Value of a Pair in Array Medium
• 1334. Maximum XOR of Two Numbers in Array (Trie) Medium
• 1335. Maximum XOR of Element with Array (Query) Medium
• 1336. Single Number II — Element Appears Three Times Medium
• 1337. Single Number III — Two Elements Appear Once Medium
• 1338. Decode XOR Encoded Array Medium
• 1339. Find XOR of All Permutations Medium
• 1340. XOR Queries of a Subarray Medium
• 1341. Minimum Number of Flips to Make OR of Array K Medium
• 1342. Minimum Flips to Make a OR b Equal to c Medium
• 1343. Count Numbers with Unique Digits (Bitmask DP) Medium
• 1344. Partition Into Two Arrays to Minimize Sum Diff Medium
• 1345. Stickers to Spell Word — Bitmask DP Medium
• 1346. Count Ways to Distribute Candies Medium
• 1347. Count Strings Without Consecutive 1s Medium
• 1348. Number of Squareful Arrays (Bitmask) Medium
• 1349. Minimum Cost to Visit Every Node (Bitmask TSP) Medium
• 1350. Find Minimum Time to Finish All Jobs Medium
• 1351. Distribute Repeating Integers (Bitmask DP) Medium
• 1352. Add Two Numbers Without Arithmetic Operators Medium
• 1353. Subtract Using Bitwise Operators Only Medium
• 1354. Multiply Two Numbers Using Bit Shifts Medium
• 1355. Divide Two Integers Without / Operator Medium
• 1356. Compute Power x^n Using Bits (Fast Exponent) Medium
• 1357. Multiply 64-bit Integers Without Overflow Medium
• 1358. Generate Gray Code Sequence Medium
• 1359. Find Nth Gray Code Number Medium
• 1360. Circular Permutation in Binary Representation Medium
• 1361. Bitwise AND of Numbers Range Medium
• 1362. Count Bit Changes to Sort Array Medium
• 1363. Minimum Number of Operations to Make XOR Zero Medium
• 1364. Largest Combination with Bitwise AND Greater Zero Medium
• 1365. Count Integers in Range with Popcount Condition Medium
• 1366. Find Two Numbers with Odd Occurrences Medium
• 1367. Bit Reversal of 32-bit Integer Medium
• 1368. UTF-8 Validation Using Bit Masking Medium
• 1369. Integer Replacement — Min Steps Using Bits Medium
• 1370. Decode XOR Encoded Permutation Medium
• 1371. Find the Original Array of Prefix XOR Medium
• 1372. Travelling Salesman — Classic Bitmask DP Hard
• 1373. Assignment Problem — Min Cost Bitmask DP Hard
• 1374. Cover All Nodes with Minimum Edges (Bitmask) Hard
• 1375. Minimum XOR Sum of Two Arrays Hard
• 1376. Minimum Number of Work Sessions (Bitmask) Hard
• 1377. Maximum Students Taking Exam Hard
• 1378. Can I Win (Bitmask Game DP) Hard
• 1379. Zuma Game — Bitmask Interval DP Hard
• 1380. Matching with Weighted Bipartite Graph Hard
• 1381. Count All Valid Pickup Delivery Orders Hard
• 1382. Find Minimum Number of Coins for Each Amount Hard
• 1383. Shortest Path Visiting All Nodes Hard
• 1384. Count Ways to Assign Tasks — K Workers Hard
• 1385. Parallel Courses III — Bitmask Scheduling Hard
• 1386. Maximum XOR of Two Numbers in Array Hard
• 1387. Maximum XOR Subarray (Prefix XOR + Trie) Hard
• 1388. Count Pairs with XOR in a Range Hard
• 1389. Maximum Genetic Difference Query Hard
• 1390. Sum of All XOR Triplets in Array Hard
• 1391. Find Subarray with Maximum XOR Hard
• 1392. Shortest Path in Binary Tree via XOR Hard
• 1393. Count Total Set Bits in All Numbers 1 to N Hard
• 1394. Find XOR Sum of All Pairs Bitwise AND Hard
• 1395. Count Pairs with AND Greater Than XOR Hard
• 1396. Longest Subarray with AND Greater Than Zero Hard
• 1397. Sum of XOR of All Subarrays Hard
• 1398. Count Subarrays with XOR Less Than K Hard
• 1399. Maximum AND of Two Numbers After One Swap Hard
• 1400. Find the Largest Number in Range with Max Set Bits Hard
• 1401. SOS DP — Sum Over Subsets Using Bitmask Hard
• 1402. Inclusion-Exclusion via Bitmask Hard
• 1403. Profile Dynamic Programming on Grid (Bitmask) Hard
• 1404. Broken Necklace — Bitmask Circular DP Hard
• 1405. 2-SAT Problem — Implication Graph + Bits Hard
• 1406. Fast Fourier Transform Butterfly — Bit Reversal Hard
• 1407. XOR Basis — Gaussian Elimination over GF(2) Hard
• 1408. Count Arrays with XOR Equal to K (Linear Basis) Hard
• 1409. Nim Game with Multiple Piles — Sprague-Grundy Hard
• 1410. Maximum Score from K Consecutive XOR Operations Hard