CHEATING CLASS
Concepts Used Dynamic programming. Difficulty Level Medium. Problem Statement : Let's suppose when a person i cheats from a person j, then we draw a line segment between them. We...
FORM STRING
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT (SIMPLIFIED): Arnab is now given a String S. He is given N different typed of pieces of sticks with strings written...
RAHUL AND PUZZLE WORLD
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): For each query , give the size of maximum square with all pictures i.e. all ones from the given matrix of...
CHOCOLATE DILEMMA
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Arnab can take one candy from each row of candies but with the restrictions imposed: There are 3 sections in each...
MONOPOLY
CONCEPTS USED: Recursion and memorization. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT$($SIMPLIFIED$)$: There are notes having values V1,V2,V3...Vn arranged in a row. You and your friend take turns alternatively. In each turn...
MONOPOLY AGAIN
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): After having lost to you the last time, your friend challenges you to another round of Monopoly. This time, he changes...
MONOPOLY ONCE AGAIN
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): After having lost to you again, your friend challenges you yet again for another round of Monopoly. This time, he changes...
REVERSE LINK LIST
Concepts Used Reversing a linked list,pointers Difficulty Level Hard. Problem Statement : Reverse a linked list from position M to N. Do it in-place and in one-pass. Example: Given 1−>2−>3−>4−>5−>NULL,...
Play With Brackets
Concepts Used Stack Difficulty Level Easy. Problem Statement : Rashid is given a set of open and closed brackets of each type such as [ , ], ( , )...
Stack Challenge
Concepts Used Stack Difficulty Level Hard Problem Statement : Rahul and Ritika are playing a game of stacks where each of them are having a stack A and B of...
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...