# October 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/october-2025-gfg-solution)💡 * [Day 1: All Unique Permutations of an array](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/01-oct-all-unique-permutations-of-an-array)🔀🌀♻️ * [Day 2: Unique K-Number Sum](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/02-oct-unique-k-number-sum)🎯🪄📈 * [Day 3: Possible Words From Phone Digits](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/03-oct-possible-words-from-phone-digits)📱📞🔢 * [Day 4: Expression Add Operators](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/04-oct-expression-add-operators)💡🧮🏁 * [Day 5: Rat in a Maze](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/05-oct-rat-in-a-maze)🐭🐀🚀 * [Day 6: The Knight's tour problem](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/06-oct-the-knights-tour-problem)♞♟️🔄 * [Day 7: Bottom View of Binary Tree](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/07-oct-bottom-view-of-binary-tree)🌳📚🔍 * [Day 8: Construct Tree from Preorder & Postorder](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/08-oct-construct-tree-from-preorder-and-postorder)🌳🌲📘 * [Day 9: Postorder Traversal](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/09-oct-postorder-traversal)🔄🌳📊 * [Day 10: ZigZag Tree Traversal](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/10-oct-zigzag-tree-traversal)🔁🌳⬅️ * [Day 11: Maximum path sum](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/11-oct-maximum-path-sum)🌳💰🔝 * [Day 12: Distribute Candies](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/12-oct-distribute-candies)🍬🔢⚖️ * [Day 13: Maximum Non-Adjacent Nodes Sum](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/13-oct-maximum-non-adjacent-nodes-sum)🌳🚫📈 * [Day 14: Sum of Nodes in BST Range](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/14-oct-sum-of-nodes-in-bst-range)🌳↔️🪓 * [Day 15: k-th Smallest in BST](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/15-oct-k-th-smallest-in-bst)🌳🎯🧩 * [Day 16: Remove BST keys outside given range](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/16-oct-remove-bst-keys-outside-given-range)🌳🏁🔄 * [Day 17: BST to greater sum tree](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/17-oct-bst-to-greater-sum-tree)🔄📊🌳 * [Day 18: Median of BST](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/18-oct-median-of-bst)🌳⚖️📈 * [Day 19: K closest Values](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/19-oct-k-closest-values)📏🎯🌳 * [Day 20: Number of BST From Array](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/20-oct-number-of-bst-from-array)🌳🔢🚀 * [Day 21: Top K Frequent Elements in Array](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/21-oct-top-k-frequent-in-array)🔝📊⚡ * [Day 22: Nearly sorted](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/22-oct-nearly-sorted)🧩📉🪜 * [Day 23: K Closest Points to Origin](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/23-oct-k-closest-points-to-origin)📍🧭↔️ * [Day 24: Split Array Subsequences](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/24-oct-split-array-subsequences)🔢✂️💻 * [Day 25: Minimum Steps to Halve Sum](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/25-oct-minimum-steps-to-halve-sum)⚖️📉➗ * [Day 26: Minimum Cost of ropes](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/26-oct-minimum-cost-of-ropes)🪢🔗🌳 * [Day 27: Find K Smallest Sum Pairs](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/27-oct-find-k-smallest-sum-pairs)📈🔢📦 * [Day 28: Distance of nearest cell having 1](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/28-oct-distance-of-nearest-cell-having-1)🗺️🌊🔢 * [Day 29: Graph Diameter](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/29-oct-graph-diameter)🌳🌐📉 * [Day 30: Replace O's with X's](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/30-oct-replace-os-with-xs)🔄🌊📍 * [Day 31: Shortest Cycle](https://hunterdii.gitbook.io/gfg-solution/october-2025-gfg-solution/31-oct-shortest-cycle)🔁🔄📈 ### Introduction This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution. *Day 1(01 OCT) :* All Unique Permutations of an array *Day 2(02 OCT) :* Unique K-Number Sum *Day 3(03 OCT) :* Possible Words From Phone Digits *Day 4(04 OCT) :* Expression Add Operators *Day 5(05 OCT) :* Rat in a Maze *Day 6(06 OCT) :* The Knight's tour problem *Day 7(07 OCT) :* Bottom View of Binary Tree *Day 8(08 OCT) :* Construct Tree from Preorder & Postorder *Day 9(09 OCT) :* Postorder Traversal *Day 10(10 OCT) :* ZigZag Tree Traversal *Day 11(11 OCT) :* Maximum path sum *Day 12(12 OCT) :* Distribute Candies *Day 13(13 OCT) :* Maximum Non-Adjacent Nodes Sum *Day 14(14 OCT) :* Sum of Nodes in BST Range *Day 15(15 OCT) :* k-th Smallest in BST *Day 16(16 OCT) :* Remove BST keys outside given range *Day 17(17 OCT) :* BST to greater sum tree *Day 18(18 OCT) :* Median of BST *Day 19(19 OCT) :* K closest Values *Day 20(20 OCT) :* Number of BST From Array *Day 21(21 OCT) :* Top K Frequent Elements in Array *Day 22(22 OCT) :* Nearly sorted *Day 23(23 OCT) :* K Closest Points to Origin *Day 24(24 OCT) :* Split Array Subsequences *Day 25(25 OCT) :* Minimum Steps to Halve Sum *Day 26(26 OCT) :* Minimum Cost of ropes *Day 27(27 OCT) :* Find K Smallest Sum Pairs *Day 28(28 OCT) :* Distance of nearest cell having 1 *Day 29(29 OCT) :* Graph Diameter *Day 30(30 OCT) :* Replace O's with X's *Day 31(31 OCT) :* Shortest Cycle