Featured Lists

Top 20 Problems on Dynamic programming

Top 10 Problems on Backtracking

Top 20 Problems on Graph

Top 25 Problems on Trees

All Problems

# Status Problem Level Completes Likes
247

K-Means Algorithm

Hard % 0
248

Count the number of nodes in a given binary tree

Beginner % 0
249

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

Medium % 0
250

Longest contiguous character in a given String - O(N) Solution

Beginner % 0
251

Convert Postfix to Infix Expression

Medium % 0
252

Collatz Conjecture - Steps to transform Number to 1

Beginner % 0
253

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

Beginner % 0
254

Longest substring with at most two unique characters

Medium % 0
255

Convert Infix to Prefix Expression

Medium % 0
256

Find third largest element in a given array

Beginner % 0
257

Find duplicates Characters in the given String

Beginner % 0
258

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
259

Sum of all Unique elements in a given array

Beginner % 0
260

Java program to find the largest element in array

Beginner % 0
261

Convert Infix to Postfix Expression

Medium % 0
262

Find three smallest elements in a given array

Beginner % 0
263

Evaluation of Infix expressions

Medium % 0
264

Stack Java Class - Explained

Beginner % 0
265

Convert Prefix to Infix Expression

Medium % 0
266

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

Hard % 0
267

Merge K sorted Linked List - Using Priority Queue

Hard % 0
268

Infix, Postfix and Prefix Notations/Expressions

Beginner % 0
269

Check if array contains all unique or distinct numbers.

Beginner % 0
270

Product of all Unique elements in a given array.

Beginner % 0
271

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

Beginner % 0
272

Find first three largest elements in a given array

Beginner % 0
273

Selection Sort – Java Implementation

Beginner % 0
275

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

Hard % 0
276

Valid Brackets – Part 2 | Stack Method

Beginner % 0
277

Find the roots of Quadratic Equation – Java Program

Beginner % 0
278

Given two strings validate the output string

Beginner % 0
279

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

Medium % 0
280

Find two smallest elements in a given array

Beginner % 0

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

Longest contiguous character in a given String - O(N) Solution

Convert Postfix to Infix Expression

Collatz Conjecture - Steps to transform Number to 1

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

Longest substring with at most two unique characters

Convert Infix to Prefix Expression

Find third largest element in a given array

Find duplicates Characters in the given String

Max Flow Problem - Ford-Fulkerson Algorithm

Sum of all Unique elements in a given array

Java program to find the largest element in array

Convert Infix to Postfix Expression

Find three smallest elements in a given array

Evaluation of Infix expressions

Stack Java Class - Explained

Convert Prefix to Infix Expression

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

Merge K sorted Linked List - Using Priority Queue

Infix, Postfix and Prefix Notations/Expressions

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.

Valid Brackets – Part 2 | Stack Method

Find the roots of Quadratic Equation – Java Program

Given two strings validate the output string

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

Find two smallest elements in a given array