# Status Problem video Level Completes Likes
364

Find three smallest elements in a given array

Beginner % 0
363

Evaluation of Infix expressions

Medium % 0
361

Convert Prefix to Infix Expression

Medium % 0
360

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

Hard % 0
359

Merge K sorted Linked List - Using Priority Queue

Hard % 0
357

Count Set bits in a given Number

Beginner % 1
354

Valid Multiple Parentheses

Medium % 1
352

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

Beginner % 0
350

Find first three largest elements in a given array

Beginner % 0
347

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

Hard % 0
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
344

Given two strings validate the output string

Beginner % 0
343

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

Medium % 0
342

Find two smallest elements in a given array

Beginner % 0
338

Find Number of reverse pairs in an array

Hard % 1
335

Max Flow Problem – Introduction

Hard % 0
334

Dijkstra Algorithm Implementation – TreeSet

Hard % 0
328

Heap Sort

Medium % 0
325

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

Medium % 1
322

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

Hard % 0
317

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

Medium % 0
310

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

Hard % 0
307

Swap two numbers using Bitwise XOR Operator

Medium % 1
303

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

Hard % 0
302

Fizz Buzz Challenge

Beginner % 0
297

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
285

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

Hard % 0
280

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

Hard % 0
277

Graph – Count all paths between source and destination

Medium % 1
275

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
274

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
271

Snake and Ladder Problem

Hard % 1
269

Graph – Depth First Search in Disconnected Graph

Medium % 1
267

Graph – Depth First Search using Recursion

Beginner % 1

Find three smallest elements in a given array

Evaluation of Infix expressions

Convert Prefix to Infix Expression

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

Find Number of reverse pairs in an array

Max Flow Problem – Introduction

Dijkstra Algorithm Implementation – TreeSet

Heap Sort

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

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

Swap two numbers using Bitwise XOR Operator

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

Fizz Buzz Challenge

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

Graph – Depth First Search using Recursion