## DELETE Kth NODE FROM THE END

This blog will give the detailed description to Delete Nth node from the end of the linked list. Deleting the Nth node from the end of the linked list will...

Skip to content
## DELETE Kth NODE FROM THE END

## TOYS

## FOOLISH ITEMS

## BALANCED PARENTHESIS COUNT

## BST COUNT

## LONGEST COMMON SUBSEQUENCE

## COIN DIVISION

## DROP EGG

## CHEATING CLASS

## FORM STRING

## RAHUL AND PUZZLE WORLD

## CHOCOLATE DILEMMA

## MONOPOLY

## MONOPOLY AGAIN

## MONOPOLY ONCE AGAIN

## REVERSE LINK LIST

## Play With Brackets

## Stack Challenge

## Valuable Time

## Sum Subarray

## Quiz Test

## Play Games 2

## Play Games 4

## Fear of Heights

## Points Collision

## Min Heap

## Heap Operations

## Parallelograming

## Nearest Cell(paid)

## Play Games 3

Get free ebooK with 50 must do coding Question for Product Based Companies solved

Fill the details & get ebook over email

Thank You!

We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

This blog will give the detailed description to Delete Nth node from the end of the linked list. Deleting the Nth node from the end of the linked list will...

Concepts Used DYNAMIC PROGRAMMING Difficulty Level Easy. Problem Statement : Once upon a time, Arya visited a toy store. As Arya is a small kid he is attracted to every...

CONCEPTS USED: Dynamic programming. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Arnab is now handed N rupees, he is asked by his mom to buy at least two ingredients which when used...

CONCEPTS USED: Recursion and Backtracking. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Rohan is now fond of balanced sequences, but suddenly he realized that he is in love with balanced parenthesis. Now...

CONCEPTS USED: Recursion,Dynamic programming. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Arnab is now given N nodes. Now he asked how many binary search trees can be formed using those N nodes....

LCS, which stands for "Longest Common Subsequence" is a fundamental problem in computer science and bioinformatics. It involves finding the longest subsequence that is common to two or more sequences....

CONCEPTS USED: Dynamic programming. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Arnab is now given N numbers, which are actually stacks of coins containing a[i] amount of coins each. Now he is...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Himanshu visited a building with N floors and he carried with him k eggs, he found out that the eggs are...

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...

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...

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...

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...

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...

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...

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...

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,...

Concepts Used Stack Difficulty Level Easy. Problem Statement : Rashid is given a set of open and closed brackets of each type such as [ , ], ( , )...

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...

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...

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...

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...

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...

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...

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...

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...

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...

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...

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...

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...

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...