Books

• Introduction to Algorithms, 4th edition
• Cracking Coding Interview Programming Questions, 6th edition
• Coding Interview Patterns: Nail Your Next Coding Interview

Videos

• https://khanacademy.org/computing/computer-science/algorithms 
• https://khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/big-o-notation
• Data Structures and Algorithms: The Complete Masterclass
• Master Data Structures and Algorithms Interviews – Ace Leetcode 75+

Handson Practice

• https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/?programming_languages=python
• LeetCode’s top 75 interview questions
• LeetCode’s top 150 interview questions

Big O

• O(1) – Constant time
• O(n) – Linear time – one pass on Every element
• O(log n) – Logarithmic time – Divide & Conquer
• O(n²) – Quadratic time – Nested loops
• O(n³) – Cubic time – Nested loops
• O(2ⁿ) – Exponential time – recursive branching
• O(n log n) – Linearithmic time
• O(n!) – Factorial time
• O(√n) – Square root time

Focus Topics

• Array
  • 624. Maximum Distance in Arrays
  • 280. Wiggle Sort
  • 1056. Confusing Number
  • 1427. Perform String Shifts
  • 161. One Edit Distance
  • 186. Reverse Words in a String II
  • 1055. Shortest Way to Form String
• Hash Table
• Matrix
• Interval
• Stack
• Queue
• Linked Lists
• Binary Tree
• Binary Search Tree
• N-ary Tree
• Graph
  • Breadth First Search (BFS)
  • Depth First Search (DFS)
• Heap
• Binary Search
• Design
• Back Tracking

Code practices

• LeetCode.com – FREE + $$
• HackerRank.com – FREE + $$
• GeeksForGeeks.org – FREE + $$
• CodeWars.com – FREE + $$
• CodeSignal.com – FREE + $$
• NeetCode.io – FREE + $$
• CodeChef.com – FREE + $$
• HackerEarth.com – FREE + $$
• FireCode.io –  $$
• ByteByteGo coding-patterns

Blogs

• AlgoMaster.io