# November 2025 GFG SOLUTION

### 📜 Table of Contents 📜

For discussions, questions, or doubts related to this solution, please visit my LinkedIn: [Any Questions](https://www.linkedin.com/in/patel-hetkumar-sandipbhai-8b110525a/). 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](https://hunterdii.gitbook.io/gfg-solution/readme)📝
* [Solutions](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution)💡
* [Day 1: Course Schedule II](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/01-nov-course-schedule-ii)🔀📚🔄
* [Day 2: Max DAG Edges](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/02-nov-max-dag-edges)🧮📊📘
* [Day 3: Safe States](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/03-nov-safe-states)🔒🛡️✅
* [Day 4: Frog Jump](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/04-nov-frog-jump)🐸🏗️💡
* [Day 5: Get Minimum Squares](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/05-nov-get-minimum-squares)🧮📏💭
* [Day 6: Ways To Tile A Floor](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/06-nov-ways-to-tile-a-floor)🧱📐🪵
* [Day 7: Weighted Job Scheduling](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/07-nov-weighted-job-scheduling)⏰📅💰
* [Day 8: Number of paths in a matrix with k coins](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/08-nov-number-of-paths-in-a-matrix-with-k-coins)🪙🧭🚀
* [Day 9: Chocolate Pickup II](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/09-nov-chocolate-pickup-ii)🍫🤖🍬
* [Day 10: Stock Buy and Sell with Cooldown](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/10-nov-stock-buy-and-sell-with-cooldown)📈💰🧊
* [Day 11: Shortest Common Supersequence](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/11-nov-shortest-common-supersequence)⏳✨🔤
* [Day 12: Wildcard Pattern Matching](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/12-nov-wildcard-pattern-matching)🎭🔍💻
* [Day 13: Interleaved Strings](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/13-nov-interleaved-strings)🔀🧩🏷️
* [Day 14: Minimum Cost to Merge Stones](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/14-nov-minimum-cost-to-merge-stones)🪨➕🧠
* [Day 15: Minimum Cost to Cut a Stick of length N](https://hunterdii.gitbook.io/gfg-solution/november-2025-gfg-solution/15-nov-minimum-cost-to-cut-a-stick-of-length-n)🔪📏✂️

### Introduction

This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution.

*Day 1(01 NOV) :* Course Schedule II

*Day 2(02 NOV) :* Max DAG Edges

*Day 3(03 NOV) :* Safe States

*Day 4(04 NOV) :* Frog Jump

*Day 5(05 NOV) :* Get Minimum Squares

*Day 6(06 NOV) :* Ways To Tile A Floor

*Day 7(07 NOV) :* Weighted Job Scheduling

*Day 8(08 NOV) :* Number of paths in a matrix with k coins

*Day 9(09 NOV) :* Chocolate Pickup II

*Day 10(10 NOV) :* Stock Buy and Sell with Cooldown

*Day 11(11 NOV) :* Shortest Common Supersequence

*Day 12(12 NOV) :* Wildcard Pattern Matching

*Day 13(13 NOV) :* Interleaved Strings

*Day 14(14 NOV) :* Minimum Cost to Merge Stones

*Day 15(15 NOV) :* Minimum Cost to Cut a Stick of length N
