About Course

It has all the required topics in one place to prepare technical interview and written test for product based company. It clearly covered important data structures, algorithms as well as techniques. Clear and concise yet easy to comprehend.

Course Syllabus

Arrays and strings:

Two-pointers, Reverse String, Squares of a Sorted Array, Sliding window, Maximum Average Subarray I, Max Consecutive Ones III, Prefix sum, Running Sum of 1d Array, Hashmaps and sets, Minimum Value to Get Positive Step by Step Sum, K Radius Subarray Averages, More common patterns.

Problems on Arrays and Strings

Hashing:

Checking for existence, Missing Number, Counting Elements, Find Players With Zero or One Losses, Largest Unique Number, Maximum Number of Balloons, Ransom Note, Jewels and Stones, Longest Substring Without Repeating Characters

Problems on Hashing

Linked lists:

Fast and slow pointers, Middle of the Linked List, Remove Duplicates from Sorted List, Reversing a linked list, Reverse Linked List II

Problems on Linked Lists

Stacks and queues:

String problems, Simplify Path, Make The String Great, Moving Average from Data Stream, Monotonic, Next Greater Element I, Online Stock Span

Problems on Stack and Queues

Trees and graphs:

Binary Tree, Binary trees – DFS, Minimum Depth of Binary Tree, Maximum Difference Between Node and Ancestor, Diameter of Binary Tree, Binary trees – BFS, Deepest Leaves Sum, Binary Tree Zigzag Level Order Traversal, Binary search trees, Insert into a Binary Search Tree, Closest Binary Search Tree Value.

Graphs:

Graphs – DFS, Find if Path Exists in Graph, Number of Connected Components in an Undirected Graph, Max Area of Island, Reachable Nodes With Restrictions, Graphs – BFS, Nearest Exit from Entrance in Maze, Snakes.

Problems on Trees and Graphs

Heaps:

Kth Largest Element in a Stream, Remove Stones to Minimize the Total, Minimum Cost to Connect Sticks, Top k, Kth Largest Element in an Array, K Closest Points to Origin

Problems on heaps

Greedy algorithms:

Maximum 69 Number, Maximum Units on a Truck, How Many Apples Can You Put into the Basket, Reduce Array Size to The Half.

Problems on Greedy Algorithms

Binary search:

Search Insert Position, Longest Subsequence With Limited Sum, On solution spaces, Find the Smallest Divisor Given a Threshold, Divide Chocolate, Split Array Largest Sum

Problems on Binary Search

Backtracking:

Generation, All Paths From Source to Target, Letter Combinations of a Phone Number, More constrained backtracking, Generate Parentheses, Numbers With Same Consecutive Differences, Combination Sum III.

Problems on BackTracking

Dynamic Programming:

Framework for DP, 1D problems, Climbing Stairs, Min Cost Climbing Stairs, Coin Change, Multi-dimensional problems, Best Time to Buy and Sell Stock with Transaction Fee, Best Time to Buy and Sell Stock with Cooldown, Matrix DP, Unique Paths II, Minimum Falling Path Sum.

Problems on Dynamic Programming