Cracking Coding Interviews – Math, Data Structures & Algorithms

Testimonials from my students and mentees in Google, Amazon, Apple, Salesforce, IIT Madras (PhD), etc.


If you can’t attend the course live you can opt for video recordings that will be made available immediately after registration and payment. Please register for further details.

Watch Session 1 & Session 2 on YouTube

Coding interviews are super stressful. The amount of preparation required to succeed is increasingly overwhelming. If you are already employed somewhere and looking for a change, it is extremely hard to find long stretches of time to prepare for interviews.

This course is delivered online keeping in mind the participants’ availability. Anyone with as little as 0 to as much as 20 years of experience, from anywhere in the world, can attend. You could have as little as 3 hours per week or 20 hours per week to spare.

In this course, you will learn how to crack coding interviews methodically. You will gain solid foundation required in Math, Data structures & Algorithms and the confidence to solve problems and implement solutions within stipulated time.

This course helps pursue development or automation opportunities in product based companies anywhere in the world. You can also apply the learning while working as a freelancer or launching your own thing.

Data structures & Algorithms (beyond Math) are the foundations of problem solving regardless of which language you code them in.

Course Content

  1. Math:
    1. Logarithms
    2. Exponentiation
    3. Permutations
    4. Combinations
    5. Geometric progression
    6. Arithmetic progression
    7. Median
    8. Modulus
    9. Fibonacci
    10. Number systems
    11. (anything required in the context of coding interviews)
  2. Data structures:
    1. Array
    2. Linked List (Singly/Doubly)
    3. Stack
    4. Queue
    5. Struct/Class
    6. Hash Table
    7. Balanced BST
    8. B Tree/B+Tree
    9. Map (Hash Table vs BST)
    10. Set (Hash Table vs BST)
    11. Heap (Min Heap/Max Heap/Priority Queue)
    12. Trie (Prefix/Radix/Suffix)
    13. Applications, Complexities, Pros & Cons, Container classes of all above
  3. Algorithms:
    1. Asymptotic Notations (Big Oh, Omega, Theta)
    2. Time & Space Complexities: Constant/Logarithmic/Linear/Polynomial/Exponential/Factorial
    3. Sorting
    4. Searching
    5. Traversals (Depth First/Breadth First)
    6. Recursion (Top Down/Bottom Up/Hybrid)
    7. Divide & Conquer
    8. Dynamic Programming
    9. Bit Manipulations
    10. Greedy Approach
    11. Comparators
  4. Strategies: Mentioned here.
  5. Coding: Ensure test cases, elegance, correctness, efficiency and best coding practices.
  6. Mock interviews: Ace interviews by getting used to solving problems and writing code within 25-45 minutes.
  7. Tips: Complete list is here.

To inquire further or undergo this training, please register.