facebook-interview-preparing 1. Array and strings Move Zeroes Add Binary Intersection of Two Arrays II Valid Palindrome Valid Palindrome II Valid Number 2. Linked List Reverse Linked List Add Two Numbers Remove Nth Node From End of List Intersection of Two Linked Lists Linked List Cycle 3. Trees and Graphs Same Tree Validate Binary Search Tree Binary Tree Paths Diameter of Binary Tree Number of Islands Maximum Depth of Binary Tree 4. Backtracking Permutations Restore IP Addresses 5. Sorting and Searching Merge Sorted Array Merge Two Sorted Lists Merge k Sorted Lists Kth Largest Element in an Array 6. Dynamic Programming Decode Ways TODO: Data Structures Algorithms Concepts Linked Lists Breadth First Search Bit Manipulation Binary Trees Depth First Search Singleton Design Pattern Tries Binary Search Factory Design Pattern Stacks Tree Insert / Find / etc Memory (Stack vs Heap) Queues Recursion Vectors / ArrayLists Big-O Time Hash Tables TODO from Facebook Algorithms to study: Merge Sort Quick Sort Breadth-first search Depth-first search Binary Search lexicographic order Data Structures to study: Arrays/ArrayLists Hash Tables Trees Graphs Stacks/Queues Heaps Concepts to know: Big O Recursion Memoization/Dynamic Programming