Problems

# Status Problem Level Completes Likes
71

Convert Integer to Roman

Medium % 0
72

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

Medium % 0
73

Grouping of Anagrams

Medium % 0
75

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

Medium % 0
76

Convert Postfix to Infix Expression

Medium % 0
77

Longest substring with at most two unique characters

Medium % 0
78

Monotone Increasing Digits

Medium % 0
79

Convert Infix to Prefix Expression

Medium % 0
80

Convert Infix to Postfix Expression

Medium % 0
81

Evaluation of Infix expressions

Medium % 0
82

Convert Prefix to Infix Expression

Medium % 0
83

Valid Multiple Parentheses

Medium % 0
84

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

Medium % 0
85

Find Number of reverse pairs in an array

Medium % 0
86

Heap Sort – Java Implementation

Medium % 0
87

Get the Sum of Digits in a number till it become a single digit

Medium % 0
88

Check if given number is Prime - O(√N) Solution – Java Program

Medium % 0
89

Swap two numbers using Bitwise XOR Operator

Medium % 0
90

Find number of Distinct Permutations of a String

Medium % 0
91

Replace all vowels with next consonant in a given string

Medium % 0
92

Introduction to Minimum Spanning Tree (MST)

Medium % 0
93

Graph – Count all paths between source and destination

Medium % 0
94

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

Medium % 0
95

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
96

Graph – Detect Cycle in a Directed Graph

Medium % 0
97

Graph – Software Installation Problem

Medium % 0
98

Graph – Depth First Search in Disconnected Graph

Medium % 1
99

Topological Sort

Medium % 0
100

Minimum Copy Paste Operations

Medium % 0
102

Graph – Print all paths between source and destination

Medium % 0
103

Graph – Depth First Traversal

Medium % 1

Convert Integer to Roman

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

Grouping of Anagrams

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

Convert Postfix to Infix Expression

Longest substring with at most two unique characters

Monotone Increasing Digits

Convert Infix to Prefix Expression

Convert Infix to Postfix Expression

Evaluation of Infix expressions

Convert Prefix to Infix Expression

Valid Multiple Parentheses

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

Find Number of reverse pairs in an array

Heap Sort – Java Implementation

Get the Sum of Digits in a number till it become a single digit

Check if given number is Prime - O(√N) Solution – Java Program

Swap two numbers using Bitwise XOR Operator

Find number of Distinct Permutations of a String

Replace all vowels with next consonant in a given string

Introduction to Minimum Spanning Tree (MST)

Graph – Count all paths between source and destination

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

Graph – Detect Cycle in an Undirected Graph using DFS

Graph – Detect Cycle in a Directed Graph

Graph – Software Installation Problem

Graph – Depth First Search in Disconnected Graph

Topological Sort

Minimum Copy Paste Operations

Graph – Print all paths between source and destination

Graph – Depth First Traversal