February 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
This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution.
Day 1(01 FEB) : Word Search
Day 2(02 FEB) : Level order traversal
Day 3(03 FEB) : Height of Binary Tree
Day 4(04 FEB) : Diameter of a Binary Tree
Day 5(05 FEB) : Mirror Tree
Day 6(06 FEB) : Construct Tree from Inorder & Preorder
Day 7(07 FEB) : Inorder Traversal
Day 8(08 FEB) : Tree Boundary Traversal
Day 9(09 FEB) : Maximum path sum from any node
Day 10(10 FEB) : K Sum Paths
Day 11(11 FEB) : Check for BST
Day 12(12 FEB) : k-th Smallest in BST
Day 13(13 FEB) : Pair Sum in BST
Day 14(14 FEB) : Fixing Two nodes of a BST
Day 15(15 FEB) : Lowest Common Ancestor in a BST
Day 16(16 FEB) : Serialize and deserialize a binary tree
Day 17(17 FEB) : k largest elements
Day 18(18 FEB) : K Closest Points to Origin
Day 19(19 FEB) : Merge K sorted linked lists
Day 20(20 FEB) : Find median in a stream
Day 21(21 FEB) : Parenthesis Checker
Day 22(22 FEB) : Longest valid Parentheses
Day 23(23 FEB) : Next Greater Element
Day 24(24 FEB) : Stock span problem
Day 25(25 FEB) : Histogram Max Rectangular Area
Day 26(26 FEB) : Maximum of minimum for every window size
Day 27(27 FEB) : Get Min from Stack
Day 28(28 FEB) : Evaluation of Postfix Expression
Last updated