Solve by topics
Choose one of the topics to practice coding interview questions
Data Structures
Programming Fundamentals
Recursion & Backtracking
Others
Coding Interview Questions
Topics
Company
Difficulty
Problem Title
Difficulty
Avg Time to solve
Attempted
Min cost to reach N
2

Easy
10 mins
28
Longest Subarray Zero Sum
0

Easy
18 mins
23
Number X
0
Easy
20 mins
1
Minimize the Maximum
1
Easy
15 mins
30
Unique Pair using Bits
0

Easy
15 mins
2
Left Right Node Balancing
0

Easy
15 mins
5
Sudoku?
52




+3
Moderate
40 mins
100
Smallest Window
0

Easy
10 mins
8
Convert Min-Heap to Max-Heap
0

Easy
26 mins
14
Equation Solver
0

Easy
10 mins
4
Minimum Parentheses
0

Easy
10 mins
3
Change Start Node
0



Easy
20 mins
38
Social Networking Graph
1

Easy
15 mins
15
Generate Binary Numbers
2

Easy
10 mins
10
Pair with Given Sum in a Balanced BST
0

Moderate
25 mins
6
Add First and Second Reversed Half NEW
0


Moderate
42 mins
10
Alternatives NEW
0

Easy
15 mins
6
Alien dictionary NEW
0

Hard
46 mins
8
Increasing Subsegment
0

Easy
15 mins
1
Remove Vowels
0

Easy
10 mins
48
Preorder Binary Tree
0
Easy
mins
7
Longest Bracket
0

Easy
20 mins
5
Minimum number of lamps needed to be installed
0

Easy
10 mins
3
Delete Leaf Nodes with Value X
1

Easy
27 mins
16
Intersection of Linked List
8




Moderate
25 mins
163
Min cost to reach N NEW
Easy

2 upvotes
Longest Subarray Zero Sum NEW
Easy

0 upvotes
Number X NEW
Easy
0 upvotes
Minimize the Maximum NEW
Easy
1 upvote
Unique Pair using Bits NEW
Easy

0 upvotes
Left Right Node Balancing NEW
Easy

0 upvotes
Sudoku? NEW
Moderate


+5
52 upvotes
Smallest Window NEW
Easy

0 upvotes
Convert Min-Heap to Max-Heap NEW
Easy

0 upvotes
Equation Solver NEW
Easy

0 upvotes
Minimum Parentheses NEW
Easy

0 upvotes
Change Start Node NEW
Easy


+1
0 upvotes
Social Networking Graph NEW
Easy

1 upvote
Generate Binary Numbers NEW
Easy

2 upvotes
Pair with Given Sum in a Balanced BST NEW
Moderate

0 upvotes
Add First and Second Reversed Half NEW
Moderate


0 upvotes
Alternatives NEW
Easy

0 upvotes
Alien dictionary NEW
Hard

0 upvotes
Increasing Subsegment NEW
Easy

0 upvotes
Remove Vowels NEW
Easy

0 upvotes
Preorder Binary Tree NEW
Easy
0 upvotes
Longest Bracket NEW
Easy

0 upvotes
Minimum number of lamps needed to be installed NEW
Easy

0 upvotes
Delete Leaf Nodes with Value X NEW
Easy

1 upvote
Intersection of Linked List NEW
Moderate


+2
8 upvotes
Preparation Video
How To Crack Product Based Companies?