January 2026 GFG SOLUTION
๐ Table of Contents ๐
For discussions, questions, or doubts related to this solution, please visit my LinkedIn: Any Questions. Thank you for your input, together, we strive to create a space where learning is a collaborative endeavor.
๐ฎYour feedback is valuable! Please consider leaving a ๐ star ๐ and sharing your thoughts in the comments.
Introduction๐
Solutions๐ก
Day 11: Minimum Window Subsequence๐งต๐ค๐ง
Day 12: K Sized Subarray Maximum๐ข๐ฉ๐
Day 13: Bus Ticket Change๐๐๐ซ
Day 14: Police and Thieves๐โ๏ธ๐โโ๏ธ
Day 15: Candy๐ฌ๐ก๐ญ
Day 16: Minimum Number of Workers๐ท๐ง๐
Day 18: Next element with greater frequency๐๐ข๐บ๏ธ
Introduction
This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution.
Day 11(11 JAN) : Minimum Window Subsequence
Day 12(12 JAN) : K Sized Subarray Maximum
Day 13(13 JAN) : Bus Ticket Change
Day 14(14 JAN) : Police and Thieves
Day 15(15 JAN) : Candy
Day 16(16 JAN) : Minimum Number of Workers
Day 17(17 JAN) : Expression contains redundant bracket or not
Day 18(18 JAN) : Next element with greater frequency
Last updated