Topics 

• Count the number of sub-arrays having a given XOR

• Advantages of BST over Hashtables
1. Searching Algorithms
• Palindrome sub-string queries
2. Graph Algorithms
• Find smallest range containing elements from k lists
3. Tree Algorithms
• Union and intersection of two linked lists
4.Bit Algorithms
• Symmetric pairs
5.Pattern Searching
Searching and Sorting
6.Greedy Algorithms
7.Dynamic Programming • Quick Sort
8.Divide and Conquer • Merge sort
9.Backtracking • Radix Sort
10.Branch and Bound • Selection Sort
11. Np Complete Problems • Bubble Sort
12. N choose K Problems • Insertion Sort
13. Stack • Counting sort
14. Queue • Binary Search
15. Linked List • Find the element that appears once in sorted array
• Kth element of two sorted arrays
String • Last index of one
Stack and Queue
• Reverse words in a given string
• Longest Palindrome of a given string • Three in one
• Recursively Remove all adjacent duplicates • Stack Min
• Check if string is rotated by two places • Stack of Plates
• Roman number to integer • Queue via Stacks
• Anagram • Sort Stack
• Remove Duplicates • Animal Shelter
• Form a Palindrome • Next larger element
• Longest distinct characters in the string • Stack with two queues
• Implement Atoi • LRU cache
• Implement Strstr • First non-repeating character in a stream
• Longest common prefix • Rotten Oranges
• Subarray with given sum • Circular tour
• Is unique String Linked List
• URLify
• Remove Duplicates
• Palindrome Permutation
• Return kth to last
• One Away
• Delete Middle Node
• String Compression
• Partition
• Rotate Matrix
• Sum Lists
• Zero Matrix
• Palindrome
• String rotation
• Intersection
Hashing
• Loop Detection
• Largest subarray with sum 0 • Rotate LL
• Swapping pairs make sum equal • Reverse LL
• Count distinct elements in every window • Merge two sorted LL
• array pair sum divisibility problem • Finding middle element
• Longest consecutive subsequence • Flattening a LL
• array subset of another array • Pairwise Swap of a LL
• Find all pairs with a given sum • Add two numbers represented by Linked List
• Find first repeated character • Check if LL is a palindrome
• Zero Sum Subarrays • Implement Queue using LL
• Minimum indexed character • Implement Stack using LL
• Check if two arrays are equal or nor • Delete without head pointer
• Uncommon characters
• Smallest window in a string containing all the characters of
another string
• First element to occur k times
• Check if frequencies can be equal
• Implementation of Hash Tables
• Double Hashing
Trees and Heap • Longest consecutive 1's
• Sparse number
• Route between nodes
• Alone in a couple
• Minimal Tree
• Maximum subset XOR
• List of depths
Recursion and Backtracking
• Check Balanced
• Validate BST • Number of Paths
• Successor • Combination sum
• Build Order • Special Keyboard
• First Common Ancestor • Water Overflow
• BST Sequences • Josephus Problem
• Check Subtree • Sudoku
• Random Node • Rat in a maze
• Paths with sum • Word Boggle
• Print left view of Binary Tree • Generate IP Address
• Level order traversal • Word Break
• Connect nodes at same level • Warnsdrodd's Algorithm
• Lowest common ancestor in a BST • Remove invalid Parenthesis
• Print a binary tree in vertical order • Match a pattern and string using regular ecpression
• Print Bottom view of Binary Tree • Print Palindrome partitions string
• Convert Binary tree to doubly Linked List • Tug of war
• Write code to determine if two trees are identical or not • Shortest safe route in a path with landmines
• Mirror of itself • Path of more than k length from a source
• Height of binary tree • Cryptarthmetic puzzle
• Maximum path sum • N queens in O(n) space
• Diameter of a binary tree • Prime numbers after prime P with sum S
• Number of leaf nodes • n-bit Grey codes
• Balance of a binary tree • All possible paths from top left to bottom right
• Serialise and serialise a binary tree • Boggle using Trie
• Binary heap • Knight tour problem
• Heap Sort •  Job Assignment Problem
• Binomial Heap Dynamic Programming
• Fibonacci Heap
• Longest Increasing Sub sequence
• Find median in a stream
• Longest Common Subsequence
• Operations on Binary min heap
• 0/1 Knapsack Problem
• Rearrange Characters
• Minimum number of jumps
• Kth largest element in a stream
• Edit Distance
• Merge K sorted linked lists
• Coin Change Problem
• Red black Tree
• Subset Sum Problem
• B trees
• Rod cutting
• AVL Trees
• Path in Matrix
Bit Algorithms
• Box Stacking
• Insertion CTCI • Minimum sum partition
• Binary to String • Egg dropping puzzle
• Flip Bit to win • Shortest common supersequnce
• Next Number • Optimal Strategy for a game
• Debugger • Count number of ways to cover a distance
• Conversion • Tiling of Dominos
• Pairwise swap • Magic Index
• Draw Line • Power Set
• Find first set bit • Recursive Multiplication
• Rightmost different bit • Tower of Hanoi
• Check whether K-th bit is set or not • Permutation with Duplicates
• Toggle bits given range • Permutation without duplicates
• Set Kth Bit • Parenthesis Check
• Power of 2 • Paint fill
• Bit Difference • N Queens
• Rotate Bits • Stack of boxes
• Swap all odd and even bits • Boolean Evaluation
• Count total set of bits • Robot in a grid
 Greedy
• Knapsack Problem
• MST algorithms
• Priority Queue
• Activity Selection
• N meetings in one room
• Coin Piles
• Minimum number of Coins
• Maximize Toys
• Page Faults in LRU
• Largest number possible
• Minimise the heights
• Minimize the sum of product
• Huffman Decoding
• Max length chain
• Minimum Operations
• Shop in candy store
• Geek collects the balls
• First,best,worst fit algorithm
• Shortest job first scheduling
• LRU,FIFO

Graph
• Prim's Algorithm
• Krushkal's Algorithm
• Bellmon Ford Algorithm
• Dijastra Algorithm
• Floyd Warsal Algorithm
• DFS
• BFS
• Detect cycle in directed and un-directed graph
• Graph Coloring
• Disjoint Sets
• Topological Sort
• Hamiltonian Cycle
• m Coloring Problem
• Ford Fulkerson Algorithm
• Boogle
• Alien Dictionary
• Circle of strings
• Snake and Ladder Problem
• Minimum cost Path
• Find whether path exists
• Find the number of islands
• Minimum swaps
• Strongly connected components
• Shortest Source to Destination Path

Miscellaneous
• Convert String to integer and vice-versa
• Multiply/Sum/Divide/Add without using operators
• Trie Data Structure

Pattern Matching
• KMP algorithm
• Rabin Karp algorithm
• Wildcard Pattern matching
• Anagram Substring Search
• Pattern searching using Trie