Cracking Product based Companies Interviews (like Google, Amazon)

Key Points

Earn Certificate of completion

Average time to complete 70 days

Pre-requisites: Basic knowledge of data structures and algorithms

Chapter 1

Arrays

1 Note & 10 Problems

Asked in

0/560

Array Notes

View

Pair Sum

0/40

Attempt

Overlapping Intervals

0/40

Attempt

Flip Bits

0/40

Attempt

Majority element

0/40

Attempt

Smallest Subarray with K Distinct Elements

0/40

Attempt

Container with most water

0/80

Attempt

Sort 0 1 2

0/40

Attempt

Sum of Infinite Array

0/80

Attempt

Search In Rotated Sorted Array

0/80

Attempt

Find all triplets with zero sum

0/80

Attempt

Chapter 2

Multi-Dimensional Arrays

1 Note & 10 Problems

Asked in

0/520

Mutli-Dimensional Arrays Notes

View

Matrix Is Symmetric

0/40

Attempt

Summed Matrix

0/40

Attempt

Search in a row wise and column wise sorted matrix

0/80

Attempt

Rotate matrix to the right

0/80

Attempt

Matrix Flip Bit

0/40

Attempt

Number of rectangles in MxN grid

0/40

Attempt

Matrix Median

0/80

Attempt

Inplace rotate matrix 90 degree

0/40

Attempt

Empty Cells in a Matrix

0/40

Attempt

Find nth elements of spiral matrix

0/40

Attempt

Chapter 3

Strings

1 Note & 10 Problems

Asked in

0/680

Strings Notes

View

Left And Right Rotation Of A String

0/40

Attempt

Shortest substring with all characters

0/80

Attempt

Next smaller Palindrome

0/40

Attempt

Longest Substring Without Repeating Characters

0/80

Attempt

Anagram Difference

0/80

Attempt

Match Specific Pattern

0/40

Attempt

Minimum operations to make strings equal

0/80

Attempt

Find K’th Character of Decrypted String

0/80

Attempt

Anagram Substring Search

0/80

Attempt

Uncommon Characters

0/80

Attempt

Chapter 4

Recursion and Backtracking

1 Note & 10 Problems

Asked in

0/600

Recursion and Backtracking Notes

View

Reach the destination

0/40

Attempt

Reverse Stack Using Recursion

0/40

Attempt

K subsets with equal sum

0/40

Attempt

Minimum distance points

0/40

Attempt

Print Permutations - String

0/40

Attempt

IP Address

0/80

Attempt

Replace ‘O’ with ‘X’

0/80

Attempt

Return Subsets Sum to K

0/80

Attempt

Binary strings with no consecutive 1s

0/80

Attempt

Sudoku?

0/80

Attempt

Chapter 5

Linked Lists

1 Note & 14 Problems

Asked in

0/920

LinkedLists Notes

View

Reverse List in K groups

0/120

Attempt

Sum Between Zeroes

0/40

Attempt

Rearrange Linked List

0/80

Attempt

Clone Linked List with Random Pointer

0/40

Attempt

Merge Two Sorted Linked Lists

0/80

Attempt

Detect and Remove Cycle

0/40

Attempt

Remove String

0/80

Attempt

Add First and Second Half

0/80

Attempt

Intersection of Linked List

0/40

Attempt

Left Short

0/40

Attempt

Count Inversion

0/80

Attempt

Flatten The Multi-Level Linked List

0/80

Attempt

Count triplets in a sorted doubly linked list whose sum is equal to a given value x

0/80

Attempt

Deletion in Circular Linked List

0/40

Attempt

Chapter 6

Stacks and Queues

1 Note & 10 Problems

Asked in

0/600

Stacks & Queues Notes

View

Implement Stack with Linked List

0/80

Attempt

Next Greater Element

0/40

Attempt

Valid Parentheses

0/40

Attempt

Two Stacks

0/80

Attempt

Evaluation of postfix expression

0/40

Attempt

Queue Using Stack

0/80

Attempt

Reverse First K elements of Queue

0/40

Attempt

Reversing a Queue

0/40

Attempt

LRU Cache Implementation

0/80

Attempt

Stack using queue

0/80

Attempt

Chapter 7

Trees

1 Note & 10 Problems

Asked in

0/720

Trees Notes

View

Binary Tree from Parent Array

0/40

Attempt

Print Leaf Nodes

0/40

Attempt

Diagonal Anagram

0/80

Attempt

Maximum sum path from the leaf to root

0/40

Attempt

Print Nodes at distance K from a given node

0/120

Attempt

LCA of three Nodes

0/40

Attempt

Count elements in all subtrees

0/40

Attempt

Maximum Width In Binary Tree

0/80

Attempt

Count Special Nodes in Generic Tree

0/120

Attempt

Time to Burn Tree

0/120

Attempt

Chapter 8

Binary Search Trees

1 Note & 10 Problems

Asked in

0/600

BST Notes

View

BST Delete

0/40

Attempt

Total Number of BSTs using array elements as the root node

0/80

Attempt

Sorted Linked List to Balanced BST

0/80

Attempt

Find K-th smallest Element in BST

0/40

Attempt

Predecessor And Successor In BST

0/40

Attempt

Binary Tree To BST

0/40

Attempt

Pair Sum in BST

0/40

Attempt

Convert Bst To The Greater Sum Tree

0/80

Attempt

Two Sum in a BST

0/80

Attempt

Validate BST

0/80

Attempt

Chapter 9

Priority Queues & Heaps

1 Note & 10 Problems

Asked in

0/760

Priority Queues & Heaps Notes

View

Is Binary Heap Tree

0/40

Attempt

Convert Min-Heap to Max-Heap

0/80

Attempt

Kth largest element in the unsorted array

0/80

Attempt

Minimum K product

0/40

Attempt

Last Stone Weight

0/40

Attempt

Running median

0/120

Attempt

Minimum Character Deletion

0/80

Attempt

Minimum and Maximum Cost to buy N Candies

0/120

Attempt

K Most Frequent Words

0/80

Attempt

String Transformation

0/80

Attempt

Chapter 10

Graphs

1 Note & 10 Problems

Asked in

0/960

Graphs Notes

View

Is it a Tree?

0/80

Attempt

M-Coloring Problem

0/80

Attempt

Count nodes within K-distance

0/120

Attempt

Shortest path in an unweighted graph

0/80

Attempt

Fire in the cells

0/120

Attempt

Strongly Connected Components (Tarjan’s Algorithm)

0/120

Attempt

Minimum Spanning Tree

0/80

Attempt

Dijkstra’s shortest path

0/80

Attempt

Snake and Ladder

0/80

Attempt

Alien dictionary

0/120

Attempt

Chapter 11

Dynamic Programming

1 Note & 10 Problems

Asked in

0/840

Dynamic Programming Notes

View

Min cost to reach N

0/40

Attempt

Maximum sum of two non-overlapping subarrays of a given size

0/80

Attempt

Optimal Strategy for a game

0/40

Attempt

Edit Distance

0/80

Attempt

Rod Cutting Problem

0/80

Attempt

Longest Palindromic Substring

0/80

Attempt

Palindrome Partitioning ll

0/120

Attempt

Count ways to reach the nth stairs

0/80

Attempt

Colorful Knapsack

0/120

Attempt

Longest Palindromic Subsequence

0/120

Attempt

Chapter 12

Miscellaneous Topics

5 Notes & 9 Problems

Asked in

0/680

HashMap

0/40

Attempt

Circular Queues

0/80

Attempt

Deques

0/80

Attempt

Tries

0/280

Attempt

String Algorithms

0/200

Attempt

Earn 70% EXP without penalty to get certificate

Interview guide for product based companies

Arrays

Array Notes

Pair Sum

Overlapping Intervals

Flip Bits

Majority element

Smallest Subarray with K Distinct Elements

Container with most water

Sort 0 1 2

Sum of Infinite Array

Search In Rotated Sorted Array

Find all triplets with zero sum

Multi-Dimensional Arrays

Mutli-Dimensional Arrays Notes

Matrix Is Symmetric

Summed Matrix

Search in a row wise and column wise sorted matrix

Rotate matrix to the right

Matrix Flip Bit

Number of rectangles in MxN grid

Matrix Median

Inplace rotate matrix 90 degree

Empty Cells in a Matrix

Find nth elements of spiral matrix

Strings

Strings Notes

Left And Right Rotation Of A String

Shortest substring with all characters

Next smaller Palindrome

Longest Substring Without Repeating Characters

Anagram Difference

Match Specific Pattern

Minimum operations to make strings equal

Find K’th Character of Decrypted String

Anagram Substring Search

Uncommon Characters

Recursion and Backtracking

Recursion and Backtracking Notes

Reach the destination

Reverse Stack Using Recursion

K subsets with equal sum

Minimum distance points

Print Permutations - String

IP Address

Replace ‘O’ with ‘X’

Return Subsets Sum to K

Binary strings with no consecutive 1s

Sudoku?

Linked Lists

LinkedLists Notes

Reverse List in K groups

Sum Between Zeroes

Rearrange Linked List

Clone Linked List with Random Pointer

Merge Two Sorted Linked Lists

Detect and Remove Cycle

Remove String

Add First and Second Half

Intersection of Linked List

Left Short

Count Inversion

Flatten The Multi-Level Linked List

Count triplets in a sorted doubly linked list whose sum is equal to a given value x

Deletion in Circular Linked List

Stacks and Queues

Stacks & Queues Notes

Implement Stack with Linked List

Next Greater Element

Valid Parentheses

Two Stacks

Evaluation of postfix expression

Queue Using Stack

Reverse First K elements of Queue

Reversing a Queue

LRU Cache Implementation

Stack using queue

Trees

Trees Notes

Binary Tree from Parent Array