String 4: Recursively remove all adjacent duplicates | Must Do Coding Questions | GeeksForGeeks

Опубликовано: 03 Август 2026
на канале: Krishna Teaches

10,213

103

This video contains Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, …
from geeksforgeeks platform.

website link:
https://www.geeksforgeeks.org/must-do...

Topics covered in this video series are:
1.Arrays
   • 1.1 ARRAYS | Must Do Coding Questions
2.String
   • 1.2 STRING | Must Do Coding Questions
3.Linked List
4.Stack and Queue
5.Tree and BST
6.Heap
7.Recursion
8.Hashing
9.Graph
10.Greedy
11.Dynamic Programming
12.Divide and Conquer
13.Backtracking
14.Bit Magic

String:
4. Recursively remove all adjacent duplicates:
Given a string s, recursively remove adjacent duplicate characters from the string s. The output string should not have any adjacent duplicates.

Example:
Input:
2
geeksforgeek
acaaabbbacdddd

Output:
gksforgk
acac

Code Link:
https://github.com/krishna-gavas/Comp...

Complete Playlist:
   • 1.1 ARRAYS | Must Do Coding Questions

Intro Music :
   • Video