## A-Good String: Codeforces 1385 D: Explained

This is another editorial post of the code forces problem a-Good String. Detailed Editorial In this problem our task is to find the minimum number of moves required to obtain a-good string from the given…

Skip to content
# Category: problem

## A-Good String: Codeforces 1385 D: Explained

## Hilbert’s Hotel Editorial | Explained | CodeForces

## Little Girl and Maximum Sum, Editorial | Codeforces

## Mashmokh and ACM Editorial | GeeksToCode

## Easiest Explanation of Angry Delta , Editorial Codechef

## The Painter’s Partition Problem

## Problems on Topological Sorting

## Clone a link list with next and random Pointer (Part II)

## Clone a linked list with next and random pointer

## Rat in a Maze Problem Explained 2020 (Backtracking)

Live To Code, Code To Live

This is another editorial post of the code forces problem a-Good String. Detailed Editorial In this problem our task is to find the minimum number of moves required to obtain a-good string from the given…

This is another editorial post of the code forces problem Hilbert’s Hotel. Problem Hilbert’s Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for…

This is an editorial post of the codeforces problem Little Girl and Maximum Sum. Detailed Editorial If you observe the problem statement carefully, it is a range sum query problem that can be easily done…

This is an editorial post of the code forces problem Mashmokh and ACM. Problem Statement Mashmokh’s boss, Bimokh, didn’t like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM…

This is the Angry Delta Editorial Codechef. One day, Delta, the dog, got very angry. He has N items with different values, and he decided to destroy a few of them. However, Delta loves his…

In this post, we are going to discuss a famous Binary Search problem that is The Painter’s Partition Problem. Also, I am going to discuss a general way to tackle some

In the previous post, we discussed Topological Sorting and in this post, we are going to discuss two problems based on it. So, let’s start. Leetcode 210 : Course Schedule II There are a total…

In the previous post, we have already discussed the map-based solution of the problem clone a link list with next and random pointer. The map-based solution took O(n) extra space but in this post, we…

Leetcode Problem 138 A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. We need to clone-a-linked-list-with-next-and-random-pointer. Read rat in…

Problem Statement of rat in a maze problem The problem is a rat in a maze problem. Consider a rat placed at (0, 0) in a square matrix of order N*N. It has to reach the destination at (n-1,…