Ragnar Lorthbrok
Concepts Used Breadth First Search Difficulty Level Easy Problem Statement : Given locations of X & Y islands, we need to find the minimum distance between a given pair of...
Shortest cycle
Concepts Used Breadth First Search Difficulty Level Hard Problem Statement : Given a graph we have to find the length of the shortest cycle in the given graph. If no...
Median Again
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Find the maximum possible median of provided odd-sized array where you can increase any element by one where each increment is...
The Last Game
Concepts Used Sorting Difficulty Level Easy Problem Statement (Simplified): Print the last number left in the array after deleting the largest number in the array then the smallest number repeatedly....
Graph Tree
Concepts Used Depth First Search, Graph Difficulty Level Medium Problem Statement : Check whether the graph is a tree or not. See original problem statement here Solution Approach : Introduction...
Clan War
Concepts Used Depth First Search, Disjoint Set Difficulty Level Medium Problem Statement : There are two clans numbered sequentially from 1 to N and given two integers, u and v...
Count Components
Concepts Used Depth First Search, Disjoint Set Difficulty Level Easy Problem Statement : Given an undirected graph, print Yes if a cycle is present in the graph else print No....
K overlapping segment
Concepts Used: Stack. Difficulty Level: Medium. Problem Statement : Arnab is hosting a party but he has only k seats. Guest have come at different times and leave at different...
Max Rectangle
Concepts Used: DP/recursion and Stack. Difficulty Level: Hard. Problem Statement : Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing all ones and print...
Samir String
Concepts Used: Stack. Difficulty Level: Easy. Problem Statement : Make the minimum number without repetition of the digits such that it follows the sequence given in the string. 'I' represents...
Detect Cycle
Concepts Used Breadth First Search, Disjoint Set Difficulty Level Easy Problem Statement : Given an undirected graph, print Yes if a cycle is present in the graph else print No....
Hop Digits
Concepts Used Breadth First Search Difficulty Level Hard Problem Statement : Given a string , we are standing at the starting point and we have to reach end in minimum...
Next Greater Element
Concepts Used: Stacks. Difficulty Level: Medium. Problem Statement : Arnab is standing in a queue and he is irritated by the tall man standing after him, as he is obstructing...
Longest Path
Concepts Used Breadth First Search Difficulty Level Medium Problem Statement : Given an unweighted, undirected tree print the length of the longest path See original problem statement here Solution Approach...
Maximum Edges
Concepts Used Depth First Search, Disjoint Set Difficulty Level Medium Problem Statement : Given N number of vertices, M number of edges and relation between them to form an undirected...
Sort stack
Concepts Used: Stacks Difficulty Level: Easy. Problem Statement : Given a stack of integers, sort it in ascending order using another temporary stack. See original problem statement here Solving Approach:...
Remove all adjacent duplicates
Concepts Used Stack Difficulty Level Easy Problem Statement : Given a string str of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them....
Get Minimum Element from Stack
Get minimum element from stack is a common problem in computer science. A stack is a data structure that follows the Last-In-First-Out (LIFO) principle, where elements are added and removed...
Beach House
Concepts Used: Stack. Difficulty Level: Hard. Problem Statement : Nishant wants to buy a plot of land, which faces the beach. He will buy only a rectangular plot. So he...
One more GCD sum
Concepts Used Mathematics Difficulty Level Hard Problem Statement (Simplified): Calculate the sum for a given number n: See original problem statement here Solving Approach : Bruteforce Approach: 1) We can...
Beautiful Bracket String
Concepts Used: Stack Difficulty Level: Medium. Problem Statement : Find the minimum number of replacements required to make the given string of braces balanced. See original problem statement here Example:...
Small Group
Concepts Used Heap Difficulty Level Hard Problem Statement : Given an array of N integers, we want to know whether it is possible to divide the students into contiguous groups...
Fascinating Multiple Number
Concepts Used Heap Difficulty Level Medium Problem Statement : Given an array A of size N, we have to perform following operations, untill only one integer remains (N-1 times) :...
Swap Sum
Concepts Used Heap Difficulty Level Medium Problem Statement : We are given N elements with an integer S. We want to find such a sub-array that has the maximum possible...
Binary Queue
Concepts Used: Queues. Difficulty Level: Medium. Problem Statement : Given a number N, print all possible binary numbers with decimal values from 1 to N, but the catch is you...
Enqueue and Dequeue in Data Structure
The queue is a linear data structure that follows the First-In-First-Out (FIFO) principle. Since queues maintain the order of insertion of elements and also remove elements in the same order...
Print first Non-repeating character in a string
Concepts Used: Hashing. Difficulty Level: Easy. Problem Statement : You are given a string str consisting of lowercase Latin letters. Find the first non-repeating character in str. Note: You have...
Compile Code
Concepts Used: Stacks. Difficulty Level: Medium. Problem Statement : Given a string of open angular bracket ‘<‘ and closed bracket ‘>’. The task is to find the length of longest...
Edge Divide(C, JAVA CODE NOT INCLUDED)
Concepts Used Depth First Search Difficulty Level Hard Problem Statement : Given an undirected connected graph, you must find all the edges which when removed divide the graph. See original...
Arrogant Students
Concepts Used: Stacks Difficulty Level: Hard. Problem Statement : Sachin is teaching a group of N students. Now every student has an arrogance level. He make all the N students...