Seed Programming

School of Seed Programming Logo

Cracking the Coding Interview

Categories: Programming, Recorded
Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

The “Cracking the Coding Interview” course is a comprehensive program designed to prepare individuals for technical interviews. It covers various aspects of the interview process over the span of seven weeks and 150+ Leetcode Problems:


Week 1-2 focuses on brainstorming strategies, understanding data, problem-solving techniques, and the efficiency of algorithms. It delves into topics like direct access techniques, string processing, and hashing.

Week 2 explores search problem strategies, emphasizing linked structures and dynamic data structures, including lists and binary trees.

Week 3 introduces the concept of recursion and when to use brute force in problem-solving.

Week 4-5 covers optimization techniques, including dynamic programming and greedy algorithms.

Week 6 delves into modeling dependency-based problems, focusing on graph theory, priority queues, and greedy algorithms.

Week 7 provides domain-specific knowledge for programming interviews, including object-oriented programming, database concepts, and operating systems.

Throughout the course, participants learn essential problem-solving skills, data structures, and interview-specific techniques to excel in technical interviews.

Show More

What Will You Learn?

  • Understanding Data
  • Problem Solving Strategies
  • Algorithm Efficiency
  • Arrays, Strings, Stacks, Queues
  • STL
  • 150+ Leetcode Problems
  • Dynamic Data Structures
  • Binary Trees
  • Linked Structures vs. Hashing
  • Understanding Recursion
  • Solution Space Navigation
  • Dynamic Programming
  • Greedy Algorithms
  • Graph Modeling
  • Priority Queues
  • Greedy Algorithms
  • Object-Oriented Programming
  • Databases
  • Operating Systems (Threads, Locks)
  • Theory of Computation
  • Quantitative and Analytical Problems

Course Content

Week 1

  • Arrays and Strings
  • Algorithm and Data Structure’s Efficiency
  • Stacks and Queues(using vector) and their applications – Iterative Merge Sort

Week 2

Week 3

Week 4

Week 5

Week 6

Week 7

Student Ratings & Reviews

No Review Yet
No Review Yet