March 2025 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 1: Decode the string๐๐ ๐
Day 2: K Sized Subarray Maximum๐ข๐ฉ๐
Day 3: Longest Bounded-Difference Subarray๐๐ข๐ฐ
Day 4: Longest Increasing Subsequence๐๐๐งฉ
Day 5: Longest String Chain๐โ๏ธ๐
Day 6: Longest Common Subsequence๐โ๏ธ๐
Day 7: Longest Palindromic Subsequence๐๐ซ๐ฌ
Day 8: Longest Palindrome in a String๐ ๐๐
Day 9: Palindrome SubStrings๐๐๐ข
Day 10: Edit Distanceโ๏ธ๐งฎ๐ข
Day 11: Ways to Reach the n'th Stairโก๏ธ๐โโ๏ธ๐ข
Day 12: Min Cost Climbing Stairs๐โโ๏ธ๐ฐ๐
Day 13: 0 - 1 Knapsack Problem๐๐ฐ๐ข
Day 14: Coin Change (Count Ways)๐ช๐ข๐ฐ
Day 15: Coin Change (Minimum Coins)๐ช๐๐ฐ
Day 16: Minimum Jumps๐โโ๏ธ๐จโก๏ธ
Day 17: Subset Sum Problem๐ฏ๐ขโ
Day 18: Partition Equal Subset Sumโ๐ขโ
Day 21: Stickler Thief๐ฆนโโ๏ธ๐ ๐
Day 22: Stickler Thief II๐ฆนโโ๏ธ๐ ๐ฐ
Day 23: Total Decoding Messages๐ขโก๏ธ๐ก
Day 24: Matrix Chain Multiplicationโ๐๐ข
Day 25: Boolean Parenthesization๐งฎโ โ
Day 26: Word Break๐โ๏ธ๐
Day 27: Minimum Platforms๐๐โณ
Day 28: Activity Selection๐ โณ๐
Day 29: Job Sequencing Problem๐ ๐ผ๐ฐ
Day 30: Gas Stationโฝ๐๐จ
Day 31: Maximize partitions in a String๐ ๐งฉ๐
Introduction
This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution.
Day 1(01 MAR) : Decode the string
Day 2(02 MAR) : K Sized Subarray Maximum
Day 3(03 MAR) : Longest Bounded-Difference Subarray
Day 4(04 MAR) : Longest Increasing Subsequence
Day 5(05 MAR) : Longest String Chain
Day 6(06 MAR) : Longest Common Subsequence
Day 7(07 MAR) : Longest Palindromic Subsequence
Day 8(08 MAR) : Longest Palindrome in a String
Day 9(09 MAR) : Palindrome SubStrings
Day 10(10 MAR) : Edit Distance
Day 11(11 MAR) : Ways to Reach the n'th Stair
Day 12(12 MAR) : Min Cost Climbing Stairs
Day 13(13 MAR) : 0 - 1 Knapsack Problem
Day 14(14 MAR) : Coin Change (Count Ways)
Day 15(15 MAR) : Coin Change (Minimum Coins)
Day 16(16 MAR) : Minimum Jumps
Day 17(17 MAR) : Subset Sum Problem
Day 18(18 MAR) : Partition Equal Subset Sum
Day 19(19 MAR) : Stock Buy and Sell โ Max K Transactions Allowed
Day 20(20 MAR) : Stock Buy and Sell โ Max 2 Transactions Allowed
Day 21(21 MAR) : Stickler Thief
Day 22(22 MAR) : Stickler Thief II
Day 23(23 MAR) : Total Decoding Messages
Day 24(24 MAR) : Matrix Chain Multiplication
Day 25(25 MAR) : Boolean Parenthesization
Day 26(26 MAR) : Word Break
Day 27(27 MAR) : Minimum Platforms
Day 28(28 MAR) : Activity Selection
Day 29(29 MAR) : Job Sequencing Problem
Day 30(30 MAR) : Gas Station
Day 31(31 MAR) : Maximize partitions in a String
Last updated