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
399

Round Price Problem

Hard % 0
398

Smallest Number after Removing K digits

Hard % 0
396

Determine the order of Tests when tests have dependencies on each other

Medium % 0
395

Implement Graph Using Map - Java

Medium % 0
393

Count number of subgraphs in a given graph

Beginner % 0
390

Convert Prefix to Postfix Expression

Medium % 0
389

Convert Roman Number to Integer

Beginner % 0
388

Sort a given stack - Using Temporary Stack

Medium % 0
387

Convert Postfix to Prefix Expression

Medium % 0
384

Grouping of Anagrams

Medium % 0
381

K-Means Algorithm

Hard % 0
380

Count the number of nodes in a given binary tree

Beginner % 0
379

Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2

Medium % 0
376

Collatz Conjecture - Steps to transform Number to 1

Beginner % 0
374

Find all Prime Numbers less than equal to N | Set 1

Beginner % 0
372

Monotone Increasing Digits

Medium % 1
370

Find third largest element in a given array

Beginner % 0
368

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
367

Sum of all Unique elements in a given array

Beginner % 0
366

Java program to find the largest element in array

Beginner % 0
364

Find three smallest elements in a given array

Beginner % 0
361

Convert Prefix to Infix Expression

Medium % 0
360

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2

Hard % 0
356

Check if array contains all unique or distinct numbers.

Beginner % 0
355

Product of all Unique elements in a given array.

Beginner % 0
352

Check if given number is perfect square - O(√N) Solution

Beginner % 0
350

Find first three largest elements in a given array

Beginner % 0
349

Selection Sort – Java Implementation

Beginner % 0
347

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Hard % 0
345

Find the roots of Quadratic Equation – Java Program

Beginner % 0
343

Generate all the strings of length n from 0 to k-1.

Medium % 0
342

Find two smallest elements in a given array

Beginner % 0

Round Price Problem

Smallest Number after Removing K digits

Determine the order of Tests when tests have dependencies on each other

Implement Graph Using Map - Java

Count number of subgraphs in a given graph

Convert Prefix to Postfix Expression

Convert Roman Number to Integer

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

Grouping of Anagrams

K-Means Algorithm

Count the number of nodes in a given binary tree

Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2

Collatz Conjecture - Steps to transform Number to 1

Find all Prime Numbers less than equal to N | Set 1

Monotone Increasing Digits

Find third largest element in a given array

Max Flow Problem - Ford-Fulkerson Algorithm

Sum of all Unique elements in a given array

Java program to find the largest element in array

Find three smallest elements in a given array

Convert Prefix to Infix Expression

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2

Check if array contains all unique or distinct numbers.

Product of all Unique elements in a given array.

Check if given number is perfect square - O(√N) Solution

Find first three largest elements in a given array

Selection Sort – Java Implementation

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Find the roots of Quadratic Equation – Java Program

Generate all the strings of length n from 0 to k-1.

Find two smallest elements in a given array