https://github.com/arunesh-tiwari/dsa-practice
https://github.com/arunesh-tiwari/dsa-practice
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/arunesh-tiwari/dsa-practice
- Owner: Arunesh-Tiwari
- License: mit
- Created: 2023-03-30T18:21:09.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-08-27T20:00:40.000Z (9 months ago)
- Last Synced: 2025-02-14T15:44:00.135Z (4 months ago)
- Language: Python
- Size: 306 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# 📚 DSA Practice Repository
Welcome to my Data Structures and Algorithms (DSA) practice repository! This repo is where I sharpen my problem-solving skills, tackle challenging algorithms, and continuously improve my coding prowess.
## 🚀 About the Repository
This repository contains solutions to a variety of DSA problems. The solutions are organized by topics, and each topic has its own folder.
### 🛠️ Features
- **Comprehensive DSA Problems**: Covers a wide range of topics from arrays, linked lists, and trees to dynamic programming, graph theory, and beyond.
- **Efficient Solutions**: Focuses on optimizing time and space complexity.
- **Clean Code**: Well-documented and easy-to-understand code solutions.
### 😅 Struggles & Wins
There have been moments of frustration, but nothing beats the satisfaction of finally cracking a tough problem! 💪
# Leetcode
# LeetCode Topics
## Array
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Arunesh-Tiwari/DSA/tree/master/0011-container-with-most-water) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Arunesh-Tiwari/DSA/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0219-contains-duplicate-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0219-contains-duplicate-ii) |
| [0624-maximum-distance-in-arrays](https://github.com/Arunesh-Tiwari/DSA/tree/master/0624-maximum-distance-in-arrays) |
| [0985-bag-of-tokens](https://github.com/Arunesh-Tiwari/DSA/tree/master/0985-bag-of-tokens) |
| [2631-sort-the-students-by-their-kth-score](https://github.com/Arunesh-Tiwari/DSA/tree/master/2631-sort-the-students-by-their-kth-score) |
## Sorting
| |
| ------- |
| [0985-bag-of-tokens](https://github.com/Arunesh-Tiwari/DSA/tree/master/0985-bag-of-tokens) |
| [2631-sort-the-students-by-their-kth-score](https://github.com/Arunesh-Tiwari/DSA/tree/master/2631-sort-the-students-by-their-kth-score) |
| [2887-sort-vowels-in-a-string](https://github.com/Arunesh-Tiwari/dsa-practice/tree/master/2887-sort-vowels-in-a-string) |
## Matrix
| |
| ------- |
| [2631-sort-the-students-by-their-kth-score](https://github.com/Arunesh-Tiwari/DSA/tree/master/2631-sort-the-students-by-their-kth-score) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Arunesh-Tiwari/DSA/tree/master/0011-container-with-most-water) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0143-reorder-list](https://github.com/Arunesh-Tiwari/DSA/tree/master/0143-reorder-list) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Arunesh-Tiwari/DSA/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0985-bag-of-tokens](https://github.com/Arunesh-Tiwari/DSA/tree/master/0985-bag-of-tokens) |
## Binary Search
| |
| ------- |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Arunesh-Tiwari/DSA/tree/master/0167-two-sum-ii-input-array-is-sorted) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Arunesh-Tiwari/DSA/tree/master/0011-container-with-most-water) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0624-maximum-distance-in-arrays](https://github.com/Arunesh-Tiwari/DSA/tree/master/0624-maximum-distance-in-arrays) |
| [0985-bag-of-tokens](https://github.com/Arunesh-Tiwari/DSA/tree/master/0985-bag-of-tokens) |
## Linked List
| |
| ------- |
| [0143-reorder-list](https://github.com/Arunesh-Tiwari/DSA/tree/master/0143-reorder-list) |
## Stack
| |
| ------- |
| [0143-reorder-list](https://github.com/Arunesh-Tiwari/DSA/tree/master/0143-reorder-list) |
## Recursion
| |
| ------- |
| [0143-reorder-list](https://github.com/Arunesh-Tiwari/DSA/tree/master/0143-reorder-list) |
## Dynamic Programming
| |
| ------- |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
## Hash Table
| |
| ------- |
| [0219-contains-duplicate-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0219-contains-duplicate-ii) |
## Sliding Window
| |
| ------- |
| [0219-contains-duplicate-ii](https://github.com/Arunesh-Tiwari/DSA/tree/master/0219-contains-duplicate-ii) |
## Bit Manipulation
| |
| ------- |
| [0476-number-complement](https://github.com/Arunesh-Tiwari/dsa-practice/tree/master/0476-number-complement) |
## String
| |
| ------- |
| [2887-sort-vowels-in-a-string](https://github.com/Arunesh-Tiwari/dsa-practice/tree/master/2887-sort-vowels-in-a-string) |