From 0 to 1: Data Structures & Algorithm

Udemy

Table of Contents

• Linked List
  
• Stack
  
• Match Parenthesis
  
• Queue
  
• Sorting
        - Selection Sort
        - Bubble Sort
        - Insertion Sort
        - Shell Sort
        - Merge Sort
        - Quick Sort
  
• Binary Search
  
• Heap
        - Max Heap
        - Min Heap
  
• Binary Tree
        - Breadth First Travelsal
        - Depth First Travelsal
              - In Order
              - Pre Order
              - Post Order
  
• Binary Search Tree
  

Cracking the Coding Interview (6th Edition)

Java solutions to problems in the book Cracking the Coding Interview(6th Edition).

Table of Contents

• Arrays and Strings
• LinkedList
• Stacks and Queues
• Trees and Graphs
• Bit Manipulation
• Math and Logic Puzzles
• Object Oriented Design
• Recursion and Dynamic Programming
• System Design and Scalability
• Sorting and Searching
• Testing
• Additional Review Problems

Arrays and Strings

• Is Unique
  
• Check Permutation
  
• Urlify
  
• Palindrome Permutation
  
• One Away
  
• String Compression
  
• Rotate Matrix
  
• Zero Matrix
  
• String Rotation
  

LinkedList

• Remove Duplicates
  
• Return Kth To Last
  
• Delete Middle Node
  
• Partition
  
• Sum Lists
  
• Palindrome
  
• Intersection
  
• Loop Detection
  

Stacks and Queues

• Three Stacks in One Array
        - Fixed Multi Stack
        - Dynamic Multi Stack
  
• Min Stack
        - Min Stack 1
        - Min Stack 2
  
• Stack of Plates
  
• Implement Queue Using Stacks
  
• Sort Stack
  
• Animal Shelter
  

Trees and Graphs

• Route between Nodes
  
• Minimal Tree
  
• List of Depths
  
• Check Balanced Tree
  
• Validate BST
  
• Successor
  
• Build Order
  
• First Common Ancestor
  
• BST Sequences
  
• Check Subtree
  
• Random Node
  
• Paths with Sum
  

Bit Manipulation

• Binary to String
  
• Conversion
  
• Flip Bit to Win
  
• Insertion
  
• Introduction
  
• Next Number
  
• Pairwise Swap
  

Math and Logic Puzzles

• Generate a List of Primes
  

Object Oriented Design

Recursion and Dynamic Programming

• Boolean Evaluation
  
• Coins
  
• Eight Queues
  
• Fibonacci
  
• Magic Index
  
• Paint Fill
  
• Parenthesis
  
• Permutations with Duplicates
  
• Permutations without Duplicates
  
• Power Set
  
• Recursive Multiply
  
• Robot In a Grid
  
• Stack of Boxes
  
• Towers of Hanoi
  
• Triple Steps
  

System Design and Scalability

Sorting and Searching

• Group Anagrams
  
• Merge Sort
  
• Quick Sort
  
• Search in Rotated Array
  
• Sort Big File
  
• Sorted Merge
  
• Sorted Search No Size
  
• Sparse Search