✨160 Days of Problem Solving 🔥

Welcome to 160 Days of Problem Solving, where we conquer one challenging problem at a time! 🌟 This repository is a treasure trove of daily coding solutions for GFG problems, with multiple language support including C, C++, Java, and Python.

📌 Table of Contents

🚀 Introduction

This repository is your companion for 160 days of consistent problem-solving, focusing on core data structures and algorithms. Each problem is thoughtfully solved and documented in four popular programming languages.

🚀 Languages Used

Whether you're a beginner or looking to sharpen your skills, these solutions will guide you through structured problem-solving.

📊 Progress Overview

Completed: 94/160 Problems 🎉 In Progress: 66 Problems ⏳ Target: Solve all 160 problems! 🏆

📅 Day-wise Problem List

🌴 GFG 160 Days of Problem Solving (Tree) 🌴

Day

Problem Name

C

C++

Java

Python

Day 1

Level order traversal 🌳📤📈

Solution

Solution

Solution

Day 2

Height of Binary Tree🌲📏🪵

Solution

Solution

Solution

Solution

Day 3

Diameter of a Binary Tree 🌳📏🔄

Solution

Solution

Solution

Solution

Day 4

Mirror Tree 🌳🪞📌

Solution

Solution

Solution

Solution

Day 5

Construct Tree from Inorder & Preorder 🌳🔀📜

Solution

Solution

Solution

Day 6

Inorder Traversal 🌳➡️📄

Solution

Solution

Solution

Solution

Day 7

Tree Boundary Traversal 🌳📐🌿

Solution

Solution

Solution

Day 8

Maximum path sum from any node 🌳🛤️🔼

Solution

Solution

Solution

Day 9

K Sum Paths 🌳🛤️🔍

Solution

Solution

Solution

Day 10

Check for BST 🌳✅🔍

Solution

Solution

Solution

Day 11

k-th Smallest in BST 🌳🔢🗂️

Solution

Solution

Solution

Solution

Day 12

Pair Sum in BST.md 🌳➕🔢

Solution

Solution

Solution

Day 13

Fixing Two nodes of a BST 🌳🔄🛠️

Solution

Solution

Solution

Day 14

Lowest Common Ancestor in a BST🌳🔍🤝

Solution

Solution

Solution

Day 15

Serialize and deserialize a binary tree 🌲📤💾

Solution

Solution

Solution

🤝 Contributing

Want to contribute? 🌟 Here's how:

  1. Fork the repository and create a pull request with a new solution.

  2. Solve a problem or improve existing code/documentation.

  3. Share this repo with others, and encourage them to star it for support!

  4. Discuss issues and share tips by opening an issue or using the Discussions tab.

🏆 Acknowledgements

This repository is maintained with by Hunterdii. Special thanks to all contributors and supporters for making this journey possible!

Special thanks to the GeeksforGeeks community for providing such an amazing set of problems to work on. Without their platform, this wouldn't have been possible. 🧑‍💻

Don't forget to star this repository to stay updated!

📍Visitor Count

Previous6. Integer to Words 🧠NextDay 1. Level order traversal 🧠

Last updated