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
Euler’s Totient Function
0
Easy
15 mins
29
Move Zeroes to End
14
Moderate
30 mins
1944
Implementation: HashMap
3
Easy
10 mins
11
Count ROR
0
Easy
10 mins
6
Path with Maximum Gold
0
Moderate
25 mins
0
Disjoint Intervals
0
Easy
10 mins
15
Nearest Multiple of 10
0
Easy
15 mins
51
Minimum Number of Vertices to Reach All Nodes
0
Moderate
30 mins
3
Fire in the cells.
1
Easy
15 mins
60
Coin game winner where every player has three choices
4
Moderate
25 mins
16
Find the Winner
0
Easy
10 mins
5
Find Duplicates Using Bit Array
0
Easy
10 mins
3
First and Last Position of an Element In Sorted Array
0
Easy
15 mins
20
Sort Array
0
Moderate
35 mins
0
Add One to Linked List NEW
0
Easy
10 mins
49
Maximum Swap
0
Easy
15 mins
1
Minimum Number of Platforms
0
Moderate
30 mins
41
K Turns Allowed
3
Moderate
25 mins
12
Ninja and Infinite Size Array
0
Easy
15 mins
1
Maximum of all sub-arrays of size K.
0
Easy
10 mins
4
Element that appears once
1
Easy
15 mins
18
Partition
1
Easy
10 mins
12
Merge overlapping intervals
0
Easy
10 mins
2
Replace 0's
0
Easy
10 mins
6
Collect Maximum Apples
0
Easy
15 mins
0
Euler’s Totient Function NEW
Easy
0 upvotes
Move Zeroes to End NEW
Moderate
14 upvotes
Implementation: HashMap NEW
Easy
+1
3 upvotes
Count ROR NEW
Easy
0 upvotes
Path with Maximum Gold NEW
Moderate
0 upvotes
Disjoint Intervals NEW
Easy
0 upvotes
Nearest Multiple of 10 NEW
Easy
0 upvotes
Minimum Number of Vertices to Reach All Nodes NEW
Moderate
0 upvotes
Fire in the cells. NEW
Easy
1 upvote
Coin game winner where every player has three choices NEW
Moderate
4 upvotes
Find the Winner NEW
Easy
0 upvotes
Find Duplicates Using Bit Array NEW
Easy
0 upvotes
First and Last Position of an Element In Sorted Array NEW
Easy
0 upvotes
Sort Array NEW
Moderate
0 upvotes
Add One to Linked List NEW
Easy
0 upvotes
Maximum Swap NEW
Easy
+1
0 upvotes
Minimum Number of Platforms NEW
Moderate
0 upvotes
K Turns Allowed NEW
Moderate
3 upvotes
Ninja and Infinite Size Array NEW
Easy
+1
0 upvotes
Maximum of all sub-arrays of size K. NEW
Easy
0 upvotes
Element that appears once NEW
Easy
1 upvote
Partition NEW
Easy
+2
1 upvote
Merge overlapping intervals NEW
Easy
0 upvotes
Replace 0's NEW
Easy
0 upvotes
Collect Maximum Apples NEW
Easy
0 upvotes
Page of 71
Preparation Video
How To Crack Product Based Companies?
Recently Asked Interview Questions
Top Problem Lists
Top Uber Coding Interview Questions
Top Apple Coding Interview Questions
Top Recursion And Backtracking Interview Questions
Top E-commerce (Flipkart, Snapdeal, etc.) Interview Questions
Book - Cracking The Coding Interview Questions
Top Dynamic Programming Questions
Top Fintech Software Engineer Interview Questions
Top Adobe Coding Interview Questions
Top Facebook Coding Interview Questions
Top Google Coding Interview Questions
Top Array Coding Interview Questions
Top Microsoft Coding Interview Questions
Top Amazon Coding Interview Questions
