This repository contains efficient Dart implementations of the Blind 75 LeetCode problems. The goal is to provide well-structured, optimized solutions while improving problem-solving skills using Dart.
- 🏆 Covers essential data structures & algorithms
- 📝 Well-commented, readable Dart solutions
- ⏳ Optimized approaches including Brute Force, Hashing, Two-Pointers, DP, and Graphs
- 🎯 Ideal for interview preparation and competitive programming
✔ Two Sum
✔ Valid Parentheses
✔ Best Time to Buy and Sell Stock
✔ Longest Substring Without Repeating Characters
✔ … (More problems will be added in future)
-
Clone this repository:
git clone https://github.com/BasitRaza228/dart-leetcode-blind75.git
-
Navigate to a specific problem directory
-
Run the Dart file: cd folder_name dart run file_name.dart
Contributions are welcome! If you have a better solution, feel free to open a Pull Request.
Blind 75 problem set curated by Amogh. (https://leetcode.com/u/amoghmc)
This repository is licensed under the MIT License.