Problems

# Status Problem Level Completes Likes
106

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

Hard % 0
107

Merge K sorted Linked List - Using Priority Queue

Hard % 0
108

Count Set bits in a given Number

Beginner % 0
109

Valid Multiple Parentheses

Medium % 0
110

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

Beginner % 0
111

Find first three largest elements in a given array

Beginner % 0
112

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

Hard % 0
113

Valid Brackets – Part 2 | Stack Method

Beginner % 0
114

Given two strings validate the output string

Beginner % 0
115

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

Medium % 0
116

Find two smallest elements in a given array

Beginner % 0
118

Multiply with power of 2 without using pow() or * operator

Beginner % 0
119

Find Number of reverse pairs in an array

Medium % 0
120

Calculate Logn base r – Java Implementation

Beginner % 0
121

Max Flow Problem – Introduction

Hard % 0
122

Dijkstra Algorithm Implementation – TreeSet and Pair Class

Hard % 0
123

Check if Given Number is power of 2.

Beginner % 0
124

Heap Sort – Java Implementation

Medium % 0
125

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Hard % 0
126

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation

Hard % 0
127

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

Medium % 0
129

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation

Hard % 0
130

Swap two numbers using Bitwise XOR Operator

Medium % 0
131

Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation

Hard % 0
132

Fizz Buzz Challenge - Java Implementation

Beginner % 0
133

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
134

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Hard % 0
135

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Hard % 0
136

Graph – Count all paths between source and destination

Medium % 0
137

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
138

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
139

Snake and Ladder Problem

Hard % 0
140

Graph – Depth First Search in Disconnected Graph

Medium % 1

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

Merge K sorted Linked List - Using Priority Queue

Count Set bits in a given Number

Valid Multiple Parentheses

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

Find first three largest elements in a given array

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

Valid Brackets – Part 2 | Stack Method

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

Multiply with power of 2 without using pow() or * operator

Find Number of reverse pairs in an array

Calculate Logn base r – Java Implementation

Max Flow Problem – Introduction

Dijkstra Algorithm Implementation – TreeSet and Pair Class

Check if Given Number is power of 2.

Heap Sort – Java Implementation

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation

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

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation

Swap two numbers using Bitwise XOR Operator

Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation

Fizz Buzz Challenge - Java Implementation

Dijkstra's – Shortest Path Algorithm (SPT)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Graph – Count all paths between source and destination

Graph – Detect Cycle in a Directed Graph using colors

Graph – Detect Cycle in an Undirected Graph using DFS

Snake and Ladder Problem

Graph – Depth First Search in Disconnected Graph