Data Structures for Coding Interviews in JavaScript Course Course

Module 1: Big-O and Problem Solving Patterns

⏳ 0.5 week

• Topics: Time/space complexity, sliding window, two-pointer techniques

• Hands-on: Solve problems using optimized patterns and Big-O comparisons

Module 2: Arrays & Strings

⏳ 0.5 week

• Topics: Traversal, in-place modifications, substring and subarray logic

• Hands-on: Build algorithms to detect duplicates, rotate arrays, and validate anagrams

Module 3: Hash Tables & Sets

⏳ 0.5 week

• Topics: Key-value access, collision handling, set operations

• Hands-on: Solve problems involving frequency counting and maps

Module 4: Linked Lists

⏳ 0.5 week

• Topics: Singly/doubly linked lists, fast and slow pointer methods

• Hands-on: Implement reversal, cycle detection, and merge operations

Module 5: Stacks & Queues

⏳ 0.5 week

• Topics: Stack/queue design, LIFO/FIFO logic, monotonic stacks

• Hands-on: Solve problems like balanced parentheses and sliding window maximum

Module 6: Trees & Binary Search Trees

⏳ 1 week

• Topics: DFS, BFS, traversal (inorder, preorder, postorder), BST logic

• Hands-on: Implement tree search, path sum, and node distance problems

Module 7: Heaps & Graphs

⏳ 1 week

• Topics: Min/max heaps, priority queues, graph representations

• Hands-on: Apply Dijkstra’s, BFS/DFS, and topological sorting algorithms

Module 8: Recursion & Backtracking

⏳ 0.5 week

• Topics: Recursive calls, memoization, call stack visualization

• Hands-on: Solve maze, permutation, and subset problems recursively

Get certificate