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๐๐ข๐บ๏ธ
Day 19: Remove K Digits๐๏ธโ๏ธ๐
Day 20: Implement UNDO & REDO๐๐๐
Day 21: Stock span problem๐๐๐
Day 22: Sum of subarray ranges๐ฆโ๐
Day 23: Maximum People Visible in a Line๐๐งโโ๏ธ๐งโโ๏ธ
Day 24: Josephus problem๐ฅ๐ก๏ธโญ
Day 25: Number of Valid Parentheses๐ขโ โ
Day 26: Generate Permutations of an array๐งฎโป๏ธ๐ฏ
Day 27: Word Search๐ค๐๐ง
Day 28: Count Subset With Target Sum II๐ฆ๐ข๐งฎ
Day 29: Stream First Non-repeating๐ค๐๐
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
Day 19(19 JAN) : Remove K Digits
Day 20(20 JAN) : Implement UNDO & REDO
Day 21(21 JAN) : Stock span problem
Day 22(22 JAN) : Sum of subarray ranges
Day 23(23 JAN) : Maximum People Visible in a Line
Day 24(24 JAN) : Josephus problem
Day 25(25 JAN) : Number of Valid Parentheses
Day 26(26 JAN) : Generate Permutations of an array
Day 27(27 JAN) : Word Search
Day 28(28 JAN) : Count Subset With Target Sum II
Day 29(29 JAN) : Stream First Non-repeating
Last updated