Swap consecutive odd and even positioned bits in a number, convert a BST into an in-place doubly linked list, and sort a linked list containing only 0s, 1s, and 2s in O(n) time.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.