Featured Lists

Top 20 Problems on Dynamic programming

Top 10 Problems on Backtracking

Top 20 Problems on Graph

Top 25 Problems on Trees

Top 10 Problems on Bits Manipulation

Top 15 Problems in LinkedList

All Problems

# Status Problem video Level Completes Likes
265

Java Pair Class

Beginner % 0
264

Graph Implementation – Adjacency List - Better| Set 2

Beginner % 0
263

Minimum Copy Paste Operations

Medium % 0
262

Count and print all Subarrays with product less than K in O(n)

Hard % 0
261

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Hard % 0
260

Deque Implementation – Java

Beginner % 0
254

Sum of all sub arrays in O(n) Time

Hard % 0
252

Text Justification Problem (OR Word Wrap Problem) - Leetcode 68

Hard % 0
251

Dynamic Programming - Egg Dropping Problem

Hard % 0
250

Nuts & Bolts Problem (Lock & Key problem)

Beginner % 0
249

Divide and Conquer - Rearrange array elements in special order

Medium % 0
248

Remove Duplicates from a string | 4 Approaches

Medium % 0
247

Find median of two sorted arrays of same size

Medium % 0
246

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
245

Dynamic programming – Printer Problem | Leetcode

Hard % 0
244

Dynamic programming - Remove Boxes Problem | leetcode

Hard % 0
241

Separate even and odd integers in a given array

Beginner % 0
239

Find local minimum or local maximum in O(1)

Medium % 0
238

Separate 0’s and 1’s in a given array

Beginner % 0
237

Find three elements in an array that sum to a zero

Beginner % 0
235

Majority Element- Boyer–Moore majority vote algorithm

Medium % 0
234

Majority Element – Part 1

Beginner % 0
233

Find the local minima in a given array

Medium % 0
232

Check whether the given number is a perfect square

Beginner % 0
231

Check if array is sorted using recursion

Beginner % 0
230

Find the Index from which 0 starts

Beginner % 0
229

Find the increasing OR decreasing point in an array

Beginner % 0
226

Find remainder without using modulo operator

Beginner % 0
225

Swap two numbers without using extra variable

Beginner % 0
222

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Hard % 0
221

Identifying Maximum Gain from Sequential Elements

Medium % 0

Java Pair Class

Graph Implementation – Adjacency List - Better| Set 2

Minimum Copy Paste Operations

Count and print all Subarrays with product less than K in O(n)

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Deque Implementation – Java

Sum of all sub arrays in O(n) Time

Text Justification Problem (OR Word Wrap Problem) - Leetcode 68

Dynamic Programming - Egg Dropping Problem

Nuts & Bolts Problem (Lock & Key problem)

Divide and Conquer - Rearrange array elements in special order

Remove Duplicates from a string | 4 Approaches

Find median of two sorted arrays of same size

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem | Leetcode

Dynamic programming - Remove Boxes Problem | leetcode

Separate even and odd integers in a given array

Find local minimum or local maximum in O(1)

Separate 0’s and 1’s in a given array

Find three elements in an array that sum to a zero

Majority Element- Boyer–Moore majority vote algorithm

Majority Element – Part 1

Find the local minima in a given array

Check whether the given number is a perfect square

Check if array is sorted using recursion

Find the Index from which 0 starts

Find the increasing OR decreasing point in an array

Find remainder without using modulo operator

Swap two numbers without using extra variable

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Identifying Maximum Gain from Sequential Elements