⚔️
DSA Important Questions
  • 😇README
  • 🔫Question List
  • 🧪Formula List
  • 🗒️01 Array
    • ✅Rotate Matrix
    • ✅Max Sum Contiguous Subarray
    • Find Duplicate in Array
    • ✅Merge Intervals
    • ✅Spiral Order Matrix I
    • Repeat and Missing Number Array
    • ✅Merge Overlapping Intervals
    • ✅Set Matrix Zeros
    • ✅Spiral Order Matrix II
    • Largest Number
    • First Missing Integer
    • ✅Pascal Triangle
    • ⭐Max Distance
    • ✅Wavy Array
    • Next Permutation
    • ✅Min Steps in Infinite Grid
    • Flip
    • ⭐Find Permutation
    • ⭐Maximum Absolute Difference
    • ⭐Maximum Unsorted Subarray
    • Reorder Data in Log File
    • ✅Make equal elements Array
  • ➕02 Math
    • ✅Excel Column Number
    • ⭐Excel Column Title
    • ⭐Grid Unique Paths
    • ⭐Power Of Two Integers
    • ✅Next Similar Number
    • ⭐k-th Permutation
  • 🔍03 Binary Search
    • ⭐Median of Array
    • ⭐Square Root of Integer
    • ⭐Rotated Sorted Array Search
    • ⭐Matrix Median
    • Capacity To Ship Packages Within B Days
  • 🧵04 String
    • Implement StrStr
    • ⭐Integer to Roman
    • ⭐Roman to Integer
    • Length of Last Word
    • ⭐atoi
    • ⭐Valid IP Addresses
    • ⭐Compare Version Numbers
    • ⭐Longest Palindromic Substring
    • Count And Say
    • Reverse the String
    • Power of 2
    • 🚧KMP: Minimum Characters Required to Make a String Palindromic
    • ⭐Convert to Palindrome
    • Bulls and Cows
  • 1️⃣05 Bit Manipulation
    • Reverse Bits
    • Single Number
    • ⭐Divide Integers
    • ⭐Single Number II
    • ⭐Count Total Set Bits
    • ⭐Palindromic Binary Representation
  • ✌️06 Two Pointers
    • Merge Two Sorted Lists II
    • ⭐3 Sum
    • Remove Duplicates from sorted Array
    • ⭐Container With Most Water
    • Remove Element from Array
    • ⭐Max Continuous Series of 1s
    • Pair With Given Difference
    • ⭐Maximum Ones After Modification
  • 🔗07 Linked List
    • Swap List Nodes in Pairs
    • Rotate List
    • ⭐Reorder List
    • Merge Two Sorted Lists
    • Remove Duplicates from Sorted List
    • Add Two Numbers as Lists
    • Remove Nth Node from List End
    • ⭐List Cycle
    • Intersection of Linked Lists
    • ⭐Reverse Linked List II
    • Palindrome List
    • ⭐K reverse linked list
    • ⭐Reverse Alternate K Nodes
    • ⭐Kth Node From Middle
    • ⭐Sort Binary Linked List
    • ⭐Even Reverse
  • 📚08 Stacks and Queues
    • ⭐Rain Water Trapping
    • Generate all Parentheses
    • ⭐Largest Rectangle in Histogram
    • ⭐Min Stack
    • Redundant Braces
    • Nearest Smaller Element
    • ⭐First non-repeating character in a stream of characters
    • ✅Balanced Parantheses!
  • 🔙09 Backtracking
    • ⭐Kth Permutation Sequence
    • ⭐Combination Sum
    • Combination Sum II
    • ⭐NQueens
    • Combinations
    • ⭐Subsets II
    • Subset
    • Palindrome Partitioning
  • 💱10 Hashing
    • ⭐Longest Consecutive Sequence
    • ⭐4 Sum
    • ⭐Anagrams
    • ⭐Points on the Straight Line
    • 2 Sum
    • ⭐Valid Sudoku
    • Copy List
    • Longest Substring Without Repeat
  • 🗻11 Heaps & Maps
    • Merge K Sorted Lists
    • ⭐LRU Cache
    • ⭐Inversions
    • Distinct Numbers in Window
  • 🌳12 Tree Data Structure
    • ✅Inorder Traversal
    • ⭐Recover Binary Search Tree
    • ⭐Inorder Traversal of Cartesian Tree
    • ⭐Least Common Ancestor
    • ⭐Construct Binary Tree From Inorder And Preorder
    • Flatten Binary Tree to Linked List
    • Valid Binary Search Tree
    • ✅Preorder Traversal
    • ⭐Binary Tree From Inorder And Postorder
    • Balanced Binary Tree
    • ✅Sorted Array To Balanced BST
    • Symmetric Binary Tree
    • ✅Postorder Traversal
    • ⭐Populate Next Right Pointers Tree
    • Identical Binary Trees
    • BST Iterator
    • ZigZag Level Order Traversal BT
    • Path Sum
    • Next Pointer Binary Tree
    • Min Depth of Binary Tree
    • Root to Leaf Paths With Sum
    • ⭐Kth Smallest Element in Tree
    • ⭐2-Sum Binary Tree
    • Vertical Order traversal of Binary Tree
    • ⭐Diagonal Traversal
    • Cousins in Binary Tree
    • Path to Given Node
    • Remove Half Nodes
    • Merge two Binary Tree
    • ⭐Burn a Tree
    • Nodes at Distance K
    • Vertical Sum of a Binary Tree
    • Covered / Uncovered Nodes
  • 13 Dynamic Programming
    • Ugly Number II
    • Coin Change
    • 0 - 1 Knapsack Problem
    • Permutation Coefficient
  • 14 Greedy Algorithm
    • ⭐Gas Station
    • ⭐Majority Element
    • ⭐Distribute Candy
    • ⭐Highest Product
    • Assign Mice to Holes
    • ⭐Meeting rooms
  • 👨‍👩‍👧‍👦15 Graph
    • Clone Graph
    • Word Search Board
    • ⭐Stepping Numbers
    • Black Shapes
    • Knight On Chess Board
    • ❌Smallest Multiple With 0 and 1
    • ⭐Commutable Islands
    • Possibility of finishing all courses given pre-requisites
    • ❌Valid Path
    • Cycle in Directed Graph
    • ❌Cycle in Undirected Graph
Powered by GitBook
On this page
  1. 05 Bit Manipulation

Palindromic Binary Representation

PreviousCount Total Set BitsNextMerge Two Sorted Lists II

Last updated 3 years ago

Thoughts

14th June 2022

  • 0:00 I'm having lots of difficulty in the Bit Manipulation part. Should I visit the LeetCode Discuss section regarding this? I'll give it a try.

  • I visited the leet code study guide section and I can see that there's not much that I don't know. It's just that these are standard problems with standard solutions that I need to have seen to be able to solve. No gap in my knowledge as far as I can see.

  • 4:00 It's a hard problem. I'll just go straight to the solution. It's probably very convoluted and not reachable on my own.

  • 6:00 I'll just go find . Their solution rarely makes sense to me.

  • 36:00 One of the best explanations on the internet is from pepcoding.

  • 42:30 The solution is clear to me now. I'll code it.

  • 47:00 Done. Need to dry run properly during revision.

int getReverse(int n) {
    int rev = 0;
    
    while(n) {
        int lb = n & 1;
        
        rev |= lb;
        n >>= 1;
        rev <<= 1;
    }
    
    rev >>= 1;
    
    return rev;
}

int Solution::solve(int n) {
    int count = 1;
    int len = 1;
    
    while(count < n) {
        len++;
        int elementsForThisLen = (1 << (len - 1) / 2);
        count += elementsForThisLen;
    }
    
    count -= (1 << (len - 1) / 2);
    int offset = n - count - 1;
    
    int ans = (1 << (len - 1));
    ans |= (offset << (len / 2));
    
    int valForReverse = (ans >> (len / 2));
    int rev = getReverse(valForReverse);
    
    ans |= rev;
    
    return ans;
}
1️⃣
⭐
a YouTube video
Palindromic Binary Representation - InterviewBitInterviewBit
Logo