| Minimum Operations to Reduce an Integer to 0 | Medium | 61.0% |
| Sum of Values at Indices With K Set Bits | Easy | 86.1% |
| Single Number II | Medium | 66.7% |
| Find the Difference | Easy | 60.1% |
| Single Number | Easy | 77.3% |
| Find the Duplicate Number | Medium | 64.0% |
| Reverse Bits | Easy | 67.7% |
| Subsets | Medium | 82.0% |
| Bitwise AND of Numbers Range | Medium | 48.6% |
| Missing Number | Easy | 71.6% |
| Shortest Path to Get All Keys | Hard | 54.3% |
| Sum of All Subset XOR Totals | Easy | 90.1% |
| Minimize XOR | Medium | 62.4% |
| Count Pairs Of Similar Strings | Easy | 73.5% |
| Shopping Offers | Medium | 52.2% |
| Count Complete Tree Nodes | Easy | 72.0% |
| Largest Combination With Bitwise AND Greater Than Zero | Medium | 80.8% |
| Counting Bits | Easy | 80.4% |
| Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | 72.4% |
| Pyramid Transition Matrix | Medium | 60.6% |
| XOR Queries of a Subarray | Medium | 78.2% |
| Can Make Palindrome from Substring | Medium | 41.3% |
| Divide Two Integers | Medium | 19.4% |
| Add Binary | Easy | 57.6% |
| Gray Code | Medium | 64.0% |
| Subsets II | Medium | 60.9% |
| Repeated DNA Sequences | Medium | 52.9% |
| Number of 1 Bits | Easy | 76.3% |
| Power of Two | Easy | 49.8% |
| Single Number III | Medium | 70.4% |
| Maximum Product of Word Lengths | Medium | 61.0% |
| Power of Four | Easy | 51.7% |
| Sum of Two Integers | Medium | 55.0% |
| Convert a Number to Hexadecimal | Easy | 53.2% |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% |
| Hamming Distance | Easy | 76.6% |
| Can I Win | Medium | 31.0% |
| Beautiful Arrangement | Medium | 64.7% |
| Set Mismatch | Easy | 44.2% |
| Stickers to Spell Word | Hard | 50.6% |
| Partition to K Equal Sum Subsets | Medium | 38.4% |
| Prime Number of Set Bits in Binary Representation | Easy | 72.4% |
| K-th Symbol in Grammar | Medium | 48.1% |
| Letter Case Permutation | Medium | 75.7% |
| Flipping an Image | Easy | 83.6% |
| Shortest Path Visiting All Nodes | Hard | 65.7% |
| Score After Flipping Matrix | Medium | 80.3% |
| Prison Cells After N Days | Medium | 39.1% |
| Unique Paths III | Hard | 82.7% |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% |
| Kth Ancestor of a Tree Node | Hard | 37.1% |
| Maximum Score Words Formed by Letters | Hard | 81.6% |
| Fair Distribution of Cookies | Medium | 69.8% |
| Number of Steps to Reduce a Number to Zero | Easy | 85.7% |
| Sort Integers by The Number of 1 Bits | Easy | 79.0% |
| Number of Steps to Reduce a Number in Binary Representation to One | Medium | 61.3% |
| Pseudo-Palindromic Paths in a Binary Tree | Medium | 68.4% |
| Minimum Numbers of Function Calls to Make Target Array | Medium | 62.8% |
| Maximum Number of Achievable Transfer Requests | Hard | 64.6% |
| Concatenation of Consecutive Binary Numbers | Medium | 56.9% |
| Find Minimum Time to Finish All Jobs | Hard | 45.3% |
| Decode XORed Permutation | Medium | 66.8% |
| Number of Wonderful Substrings | Medium | 66.6% |
| Unique Length-3 Palindromic Subsequences | Medium | 73.8% |
| Minimum Number of Work Sessions to Finish the Tasks | Medium | 34.5% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% |
| Minimum Bit Flips to Convert Number | Easy | 87.8% |
| Minimum Score After Removals on a Tree | Hard | 76.2% |
| Longest Nice Subarray | Medium | 64.8% |
| Smallest Subarrays With Maximum Bitwise OR | Medium | 62.0% |
| Find The Original Array of Prefix Xor | Medium | 88.3% |
| Find Xor-Beauty of Array | Medium | 70.5% |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% |
| Find the K-or of an Array | Easy | 72.7% |
| Minimum Number of Operations to Make Array XOR Equal to K | Medium | 85.5% |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% |
| Minimum Array End | Medium | 55.4% |
| Find Number of Ways to Reach the K-th Stair | Hard | 37.4% |
| Generate Binary Strings Without Adjacent Zeros | Medium | 88.2% |
| Minimum Moves to Spread Stones Over Grid | Medium | 45.3% |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% |
| Longest Subarray With Maximum Bitwise AND | Medium | 65.4% |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% |
| Number of Good Ways to Split a String | Medium | 68.4% |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% |
| Find if Array Can Be Sorted | Medium | 66.5% |
| Shortest Subarray With OR at Least K II | Medium | 50.2% |
| Neighboring Bitwise XOR | Medium | 79.8% |
| Maximum XOR After Operations | Medium | 79.9% |
| Number of Even and Odd Bits | Easy | 73.3% |
| Maximum Possible Number by Binary Concatenation | Medium | 65.3% |
| Bitwise ORs of Subarrays | Medium | 56.8% |
| Divide Array Into Equal Pairs | Easy | 79.2% |
| Binary Watch | Easy | 65.1% |
| Integer Replacement | Medium | 37.1% |
| Two Out of Three | Easy | 77.4% |
| Maximum XOR for Each Query | Medium | 84.8% |
| Find the K-th Character in String Game I | Easy | 81.6% |
| Longest Nice Substring | Easy | 63.7% |
| Find the K-th Character in String Game II | Hard | 48.5% |