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
212

Social Network Problem

Hard % 0
213

Maximum number edges to make Acyclic Undirected/Directed Graph

Beginner % 0
214

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
215

Hamming Distance between two given strings

Beginner % 0
216

Breadth-First Search in Disconnected Graph

Medium % 0
217

ZigZag OR Diagonal traversal in 2d array/Matrix using queue

Medium % 0
218

Check if Number is divisible by its digits

Beginner % 0
219

Check if the given number is Armstrong number or not

Beginner % 0
220

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
221

Minimum Boats Required to rescue people

Medium % 0
222

Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem.

Medium % 0
223

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Medium % 0
224

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Medium % 0
225

Find all the numbers in the range which has prime set bits.

Beginner % 0
226

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Hard % 0
227

Check if Arithmetic Expression contains duplicate parenthesis

Medium % 0
228

Introduction to Bipartite Graphs OR Bigraphs

Medium % 0
229

Reverse the Directed Graph

Beginner % 0
230

Round Price Problem

Hard % 0
231

Smallest Number after Removing K digits

Hard % 0
232

Find Third Smallest elements in a given array

Beginner % 0
233

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

Medium % 0
234

Implement Graph Using Map - Java

Medium % 0
235

Find the maximum number present in a String

Beginner % 0
236

Count number of subgraphs in a given graph

Beginner % 0
237

Check if given an edge is a bridge in the graph

Medium % 0
238

Convert Prefix to Postfix Expression

Medium % 0
239

Convert Roman Number to Integer

Beginner % 0
240

Sort a given stack - Using Temporary Stack

Medium % 0
241

Convert Postfix to Prefix Expression

Medium % 0
242

Convert Integer to Roman

Medium % 0
243

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Medium % 0
244

Grouping of Anagrams

Medium % 0

Social Network Problem

Maximum number edges to make Acyclic Undirected/Directed Graph

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Hamming Distance between two given strings

Breadth-First Search in Disconnected Graph

ZigZag OR Diagonal traversal in 2d array/Matrix using queue

Check if Number is divisible by its digits

Check if the given number is Armstrong number or not

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Minimum Boats Required to rescue people

Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem.

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Find all the numbers in the range which has prime set bits.

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Check if Arithmetic Expression contains duplicate parenthesis

Introduction to Bipartite Graphs OR Bigraphs

Reverse the Directed Graph

Round Price Problem

Smallest Number after Removing K digits

Find Third Smallest elements in a given array

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

Implement Graph Using Map - Java

Find the maximum number present in a String

Count number of subgraphs in a given graph

Check if given an edge is a bridge in the graph

Convert Prefix to Postfix Expression

Convert Roman Number to Integer

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

Convert Integer to Roman

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Grouping of Anagrams