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
362

Stack Java Class - Explained

Beginner % 0
359

Merge K sorted Linked List - Using Priority Queue

Hard % 0
358

Infix, Postfix and Prefix Notations/Expressions

Beginner % 0
353

Reverse a given number

Beginner % 1
351

Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1

Hard % 1
350

Find first three largest elements in a given array

Beginner % 0
344

Given two strings validate the output string

Beginner % 0
338

Find Number of reverse pairs in an array

Hard % 1
334

Dijkstra Algorithm Implementation – TreeSet

Hard % 0
330

Check if Given Number is power of 2

Beginner % 1
318

Calculate Log2n without using built-in function

Beginner % 1
313

Check if two Strings are equal without using built-in function

Beginner % 0
312

Remove Vowels from a given String

Beginner % 0
305

Find number of Distinct Permutations of a String

Medium % 0
301

Bitwise Trick: Divide by Powers of 2 Without Operators

Beginner % 1
293

Convert Number to base 3 String Representation

Beginner % 1
290

Reverse a String using Recursion

Beginner % 0
277

Graph – Count all paths between source and destination

Medium % 1
276

Graph – Find Number of non reachable vertices from a given vertex

Medium % 0
275

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
274

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
272

Graph – Software Installation Problem

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
252

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

Hard % 0
251

Dynamic Programming - Egg Dropping Problem

Hard % 0
249

Divide and Conquer - Rearrange array elements in special order

Medium % 0
244

Dynamic programming - Remove Boxes Problem | leetcode

Hard % 0
242

Find the Bit Flips Needed: Convert One Binary Number to Another

Beginner % 1
240

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Hard % 1
239

Find local minimum or local maximum in O(1)

Medium % 0
233

Find the local minima in a given array

Medium % 0
231

Check if array is sorted using recursion

Beginner % 0

Stack Java Class - Explained

Merge K sorted Linked List - Using Priority Queue

Infix, Postfix and Prefix Notations/Expressions

Reverse a given number

Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1

Find first three largest elements in a given array

Given two strings validate the output string

Find Number of reverse pairs in an array

Dijkstra Algorithm Implementation – TreeSet

Check if Given Number is power of 2

Calculate Log2n without using built-in function

Check if two Strings are equal without using built-in function

Remove Vowels from a given String

Find number of Distinct Permutations of a String

Bitwise Trick: Divide by Powers of 2 Without Operators

Convert Number to base 3 String Representation

Reverse a String using Recursion

Graph – Count all paths between source and destination

Graph – Find Number of non reachable vertices from a given vertex

Graph – Detect Cycle in a Directed Graph using colors

Graph – Detect Cycle in an Undirected Graph using DFS

Graph – Software Installation Problem

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)

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

Dynamic Programming - Egg Dropping Problem

Divide and Conquer - Rearrange array elements in special order

Dynamic programming - Remove Boxes Problem | leetcode

Find the Bit Flips Needed: Convert One Binary Number to Another

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Find local minimum or local maximum in O(1)

Find the local minima in a given array

Check if array is sorted using recursion