initial commit

Author: javydevx

README.md

@@ -0,0 +1,111 @@
+# 🚀 NeetCode 150 in Go
+
+[![Go Version](https://img.shields.io/badge/Go-1.20-blue.svg)](https://golang.org/dl/)
+[![NeetCode Practice](https://img.shields.io/badge/NeetCode-Practice-blue)](https://neetcode.io/practice)
+[![LeetCode List](https://img.shields.io/badge/LeetCode-NeetCode%20150-orange)](https://leetcode.com/problem-list/plakya4j/)
+[![YouTube Playlist](https://img.shields.io/badge/YouTube-Playlist-red)](https://www.youtube.com/playlist?list=PLQZEzAa9dfpkv0kZkjomTj553gQyafNiB)
+
+---
+
+## 📚 Overview
+
+Welcome to my journey of mastering Data Structures and Algorithms (DSA) by solving the [NeetCode 150](https://neetcode.io/practice?tab=neetcode150) problems using **Golang**. This repository contains my solutions, organized by topic, to help reinforce my understanding and prepare for coding interviews.
+
+---
+
+## 🗂️ Topic-wise Breakdown
+
+### 1. Arrays & Hashing
+- Fundamentals of storage and access.
+- Must-have for any coding interview.
+
+### 2. Two Pointers
+- Techniques for traversing arrays and strings efficiently.
+
+### 3. Sliding Window
+- Optimized solutions for subarray and substring problems.
+
+### 4. Stack
+- Essential for parsing expressions and backtracking problems.
+
+### 5. Binary Search
+- Divide-and-conquer approach for sorted data structures.
+
+### 6. Linked List
+- Classic data structure with unique pointer manipulation challenges.
+
+### 7. Trees
+- Core topic involving recursion and hierarchical data.
+
+### 8. Tries
+- Specialized tree for prefix-based problems.
+
+### 9. Heap / Priority Queue
+- Useful for problems requiring dynamic ordering.
+
+### 10. Backtracking
+- Recursive approach for exploring all possibilities.
+
+### 11. Graphs
+- Covers DFS, BFS, and shortest path algorithms.
+
+### 12. Advanced Graphs
+- Includes Dijkstra's, Union-Find, and Topological Sort.
+
+### 13. Greedy
+- Builds solutions piece by piece with the best immediate choice.
+
+### 14. 1D Dynamic Programming
+- Solving problems by breaking them down into simpler subproblems.
+
+### 15. 2D Dynamic Programming
+- Extends DP to two-dimensional data structures.
+
+### 16. Bit Manipulation
+- Efficient techniques for handling binary representations.
+
+---
+
+## 🧠 Study Tips
+
+- **Start with Easy Problems**: Build confidence before tackling harder ones.
+- **Understand Patterns**: Recognize common approaches across problems.
+- **Review Solutions**: Learn from different methods and optimize your code.
+- **Consistent Practice**: Aim for daily problem-solving to build momentum.
+
+---
+
+## 📅 Suggested Practice Schedule
+
+| Week | Topics Covered                         |
+|------|----------------------------------------|
+| 1    | Arrays & Hashing, Two Pointers         |
+| 2    | Sliding Window, Stack                  |
+| 3    | Binary Search, Linked List             |
+| 4    | Trees, Tries                           |
+| 5    | Heap / Priority Queue, Backtracking    |
+| 6    | Graphs, Advanced Graphs                |
+| 7    | Greedy, 1D Dynamic Programming         |
+| 8    | 2D Dynamic Programming, Bit Manipulation |
+
+*Adjust the schedule based on your personal pace and understanding.*
+
+---
+
+## 🔗 Resources
+
+- [NeetCode Practice Platform](https://neetcode.io/practice)
+- [LeetCode NeetCode 150 List](https://leetcode.com/problem-list/plakya4j/)
+- [NeetCode Roadmap](https://neetcode.io/roadmap)
+- [YouTube Playlist - Solving All 150 NeetCode Problems](https://www.youtube.com/playlist?list=PLQZEzAa9dfpkv0kZkjomTj553gQyafNiB)
+
+---
+
+## 📝 Notes
+
+- This plan is adaptable. Feel free to modify the schedule and topics based on your strengths and weaknesses.
+- Regularly revisit challenging problems to reinforce your understanding.
+
+---
+
+Happy Coding! 🚀