Valuable Time
Concepts Used Queues. Difficulty Level Easy. Problem Statement : Ravi is asked to solve a challenge by his friend Salma. He is given a sequence and is asked to perform...
Sum Subarray
Concepts Used Queues. Difficulty Level Hard. Problem Statement : You are given an array A of size N. You have to print the length of the smallest subarray that has...
Quiz Test
Concepts Used Queues. Difficulty Level Hard. Problem Statement : Ram has recently appeared for his Physics, Maths, and Chemistry quiz where each subject has multiple quizzes. Ram's class teacher asked...
Play Games 2
CONCEPTS USED: Game theory DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Arnab wants to play games with his friend. He made a pile of chocolates and now he will take the first...
Play Games 4
CONCEPTS USED: Game theory DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Arnab wants to play games with his friend. Now this time Arnab made an array of integers that represent the piles...
Fear of Heights
CONCEPTS USED: Computational geometry. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): For any triangle ABC we know that the height from A to the line BC(or it's extension) is Ha, from B...
Points Collision
CONCEPTS USED: Computational geometry. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): A segment of line is defined as the line connecting two points in the Cartesian Coordinate System. The segments are defined...
Min Heap
CONCEPTS USED: Heaps. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N integers, your task is to create a min-heap using the elements of the given array and print...
Heap Operations
CONCEPTS USED: Heaps. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N integers, your task is: To create min-heap(Insert elements one by one). Extract the minimum element from the...
Parallelograming
CONCEPTS USED: Computational Geometry DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Alex likes parallelograms very much. So one day his sister Alice gave him n numbers and asked him to calculate the...
Nearest Cell(paid)
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT (SIMPLIFIED): Rahul is stuck in a maze world, where the maze is a binary matrix of size NXM (each cell has value...
Play Games 3
CONCEPTS USED: Game theory DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Nishant wants to play games with his friend. Now this time Nishant made an array of integers. So in each turn...
Longest Palindromic Substring
CONCEPTS USED: Recursion,Dynamic programming. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT (SIMPLIFIED): You are given a string str, find the longest palindromic substring in str. Longest Palindromic Substring of string str:LPS[i...j], where...
Min Query
Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...
ADD ONE TO THE NUMBER
In this article, we will learn how to add one to linked list. As we know inked list points to every next node as well as contains the address of...
List Reduction
This blog Discusses the famous question “list reduction in linked list”. Linked list reduction plays an important role in improving your data structures like linked list. In linked list reduction,...
Arrange the List
CONCEPTS USED: Basic Pointer Manipulation DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given a linked list of N nodes such that the list is sorted in two parts, the first part and...
Arrange the Salary
CONCEPTS USED: Basic Pointer Manipulation DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given a linked list of N elements and a value X, your task is to arrange the list in such...
Binary list
CONCEPTS USED: Basic Manipulation DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a linked list of N nodes, each node containing binary bit either 0 or 1 as a character. Your task...
Number of islands
Concepts Used Depth First Search, Disjoint Set Difficulty Level Medium Problem Statement : Given a 2D matrix, which contains only two numbers 0 or 1. In the map group of...
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. Solution Approach : Introduction : For a graph to...
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...