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 are the foundation of computer science regardless of which language you code them in and where you go.
Course Content
Math:
Logarithms
Permutations
Combinations
Geometric progression
Arithmetic progression
Median
Modulus
GCD
Fibonacci
(anything required in the context of coding interviews)
Data structures:
Array
Linked List (Singly / Doubly)
Stack
Queue
Struct/Class
Hash Table
Balanced BST
B Tree/B+Tree
Map (Hash Table vs BST)
Set (Hash Table vs BST)
Heap (Min Heap/Max Heap/Priority Queue)
Trie (Prefix/Radix/Suffix)
Applications, Complexities, Pros & Cons, Container classes of all above
Algorithms:
Asymptotic Notations (Big Oh, Omega, Theta)
Time & Space Complexities: Constant/Logarithmic/Linear/Polynomial/Exponential/Factorial
Sorting
Searching
Traversals (Depth First/Breadth First)
Recursion (Top Down/Bottom Up/Hybrid)
Divide & Conquer
Dynamic Programming
Bit Manipulations
Greedy Approach
Strategies: Mentioned here.
Coding: Ensure test cases, elegance, correctness, efficiency and best coding practices.
Mock interviews: Ace interviews by getting used to solving problems and writing code within 25-45 minutes.