Back To Back SWE Courses

Coding Interview Questions - Data Structures and Algorithms

Master essential coding interview algorithms and data structures through 38+ hands-on problems covering dynamic programming, backtracking, trees, graphs, and optimization techniques.

• YouTube
• 11 hours 59 minutes
• Self-Paced
• Free Video

Time and Space Complexity

Master asymptotic analysis with Big O, Omega, and Theta notations to evaluate algorithm efficiency and understand logarithmic time complexities in computer science.

• YouTube
• 1 hour 4 minutes
• Self-Paced
• Free Video

Trees, Binary Trees, and Binary Search Trees - Questions and Explanations

Explore binary tree concepts through hands-on problem solving, covering traversals, serialization, balanced trees, heaps, and search algorithms with recursive solutions.

• YouTube
• 2 hours 26 minutes
• Self-Paced
• Free Video

Linked Lists and Hashtables

Master linked lists and hashtables through hands-on problem solving with graph cloning, substring algorithms, list merging, LRU cache implementation, and reversal techniques.

• YouTube
• 1 hour 32 minutes
• Self-Paced
• Free Video

Graphs, Greedy Algorithms, and Other Computer Science Fundamentals

Master graph algorithms, asymptotic analysis, and greedy techniques through hands-on problem solving and algorithmic fundamentals.

• YouTube
• 2 hours 50 minutes
• Self-Paced
• Free Video

Arrays, Primitives, and Strings - Programming Interview Preparation

Master arrays, strings, and primitives through advanced algorithms like Karatsuba multiplication, KMP pattern matching, and dynamic programming techniques for coding interviews.

• YouTube
• 4 hours 28 minutes
• Self-Paced
• Free Video

Dynamic Programming, Recursion, and Backtracking

Master dynamic programming, recursion, and backtracking through 23 algorithmic challenges including classic problems like N Queens, Sudoku solving, and coin change optimization.

• YouTube
• 6 hours 32 minutes
• Self-Paced
• Free Video