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
141

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

 		Medium % 0
142

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

 		Medium % 0
143

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

 		Beginner % 0
144

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

 		Hard % 0
145

Check if Arithmetic Expression contains duplicate parenthesis

 		Medium % 0
146

Introduction to Bipartite Graphs OR Bigraphs

 		Medium % 0
147

Reverse the Directed Graph

 		Beginner % 0
148

Round Price Problem

 		Hard % 0
149

Smallest Number after Removing K digits

 		Hard % 0
150

Find Third Smallest elements in a given array

 		Beginner % 0
151

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

 		Medium % 0
152

Implement Graph Using Map - Java

 		Medium % 0
153

Find the maximum number present in a String

 		Beginner % 0
154

Count number of subgraphs in a given graph

 		Beginner % 0
155

Reverse a Stack using recursion - In Place (Without using extra memory)

 		Hard % 1
156

Check if given an edge is a bridge in the graph

 		Medium % 0
157

Convert Prefix to Postfix Expression

 		Medium % 0
158

Convert Roman Number to Integer

 		Beginner % 0
159

Sort a given stack - Using Temporary Stack

 		Medium % 0
160

Convert Postfix to Prefix Expression

 		Medium % 0
161

Convert Integer to Roman

 		Medium % 0
162

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

 		Medium % 0
163

Grouping of Anagrams

 		Medium % 0
166

K-Means Algorithm

 		Hard % 0
167

Count the number of nodes in a given binary tree

 		Beginner % 0
168

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

 		Medium % 0
169

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

 		Beginner % 0
170

Convert Postfix to Infix Expression

 		Medium % 0
171

Collatz Conjecture - Steps to transform Number to 1

 		Beginner % 0
172

String to Integer (AtoI - ASCII to Integer)

 		Beginner % 1
173

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

 		Beginner % 0
174

Longest substring with at most two unique characters

 		Medium % 0
175

Monotone Increasing Digits

 		Medium % 1

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

Reverse a Stack using recursion - In Place (Without using extra memory)

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

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

String to Integer (AtoI - ASCII to Integer)

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

Longest substring with at most two unique characters

Monotone Increasing Digits