Seed Programming

School of Seed Programming Logo

Cracking the Coding Interview - Summer 2024

Online Course

Rs 15,000/- PKR per Month

About Course

Seed Programming is excited to once again launch “Cracking the Coding Interview” which 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:

Seed Programming is excited to once again launch “Cracking the Coding Interview” which 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: 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.

What Will You Learn?

  • Logical Problem Solving
  • Algorithm Efficiency
  • Implementing Chess in OOP
  • Templates and Introducing STL
  • Hands on with Vector/Stack/Queues 
  • Linked Structures vs. Hashing
  • Trees: Binary/BST/Random
  • Recursion and Backtracking
  • Analytical/Quantitative Reasoning
 
  • Divide and Conquer

  • Dynamic Programming

  • Greedy Algorithms

  • Big 0, omega Ω, theta θ

  • Graph and Applications

  • Priority Queues

  • ER Modeling & Normalizations

  • Models of Computation

  • Synchronisation Problems

Registration Queries

FOR ANY REGISTRATION QUERIES FEEL FREE TO REACH OUT TO OUR TEAM​