Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/akr-2803/dsa-declassified

Declassified, easy to-understand explanations and visuals to DSA problems and more.
https://github.com/akr-2803/dsa-declassified
algorithms algorithms-and-data-structures data-structures data-structures-and-algorithms dynamic-programming leetcode leetcode-solutions problem-of-the-day
Last synced: 1 day ago
JSON representation
Declassified, easy to-understand explanations and visuals to DSA problems and more.
Host: GitHub
URL: https://github.com/akr-2803/dsa-declassified
Owner: AKR-2803
Created: 2024-08-18T03:05:45.000Z (6 months ago)
Default Branch: main
Last Pushed: 2025-01-17T03:54:23.000Z (25 days ago)
Last Synced: 2025-01-17T04:31:37.912Z (25 days ago)
Topics: algorithms, algorithms-and-data-structures, data-structures, data-structures-and-algorithms, dynamic-programming, leetcode, leetcode-solutions, problem-of-the-day
Language: Java
Homepage:
Size: 8.22 MB
Stars: 0
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project

README

        # Welcome to DSA-Declassified! 🐱‍👤 📃

This repository is dedicated to sharing and explaining all the things related to Data Structures and Algorithms (DSA). Here, you'll find interactive problem explanations, complete with images and detailed insights to help deepen your understanding.

Quickly browse through sections using the following information:

|        Folder        | Purpose  |

|----------------|-------------|

| [POTD-Leetcode](https://github.com/AKR-2803/DSA-Declassified/tree/main/POTD-Leetcode)  | Leetcode Daily Challenge explained with code |

| [Dynamic Programming](https://github.com/AKR-2803/DSA-Declassified/tree/main/Problems/Dynamic%20Programming)  | Problems related to Dynamic Programming |

| [Notes](https://github.com/AKR-2803/DSA-Declassified/tree/main/Notes)  | Notes on some DSA Concepts |

## Leetcode Daily Challenge

| Date      | Problem | Difficulty | Solution |

|------------|---------|------------|-------------------|

| 12-14-2024 | [2762. Continuous Subarrays](https://leetcode.com/problems/continuous-subarrays/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-14-2024-continuous-subarrays.md) |

| 12-15-2024 | [1792. Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-15-2024-max-avg-pass-ratio.md) |

| 12-16-2024 | [3264. Final Array State After K Multiplicatio](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/description/) | ![Easy][easy_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-16-2024-final-array-state-after-k.md) |

| 12-17-2024 | [2182. Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-17-2024-construct-string-with-repeat-limit.md) |

| 12-18-2024 | [1475. Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/description/) | ![Easy][easy_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-18-2024-final-prices-special-discount.md) |     

| 12-19-2024 | [769. Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-19-2024-max-chunks-to-make-sorted.md) |   

| 12-20-2024 | [2415. Reverse Odd Levels of Binary Tree](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-20-2024-reverse-odd-levels-binary-tree.md) |   

| 12-21-2024 | [2872. Maximum Number of K-Divisible Components](https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/) | ![Hard][hard_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-21-2024-max-no-of-k-div-components.md) |   

| 12-22-2024 | [2940. Find Building Where Alice and Bob Can Meet](https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/description/) | ![Hard][hard_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-22-2024-find-building-alice-n-bob-can-meet.md) |   

| 12-23-2024 | [2471. Minimum No. of Operations to Sort a Binary Tree by Level](https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-23-2024-min-ops-to-sort-binary-tree-by-lvl.md) |   

| 12-24-2024 | [3203. Find Minimum Diameter After Merging Two Trees ](https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/description/) | ![Hard][hard_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-24-2024-find-min-diameter-after-merging-two-trees.md) |   

| 12-25-2024 | [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-25-2024-find-largest-value-in-each-tree-row.md) |   

| 12-26-2024 | [494. Target Sum](https://leetcode.com/problems/target-sum/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-26-2024-target-sum.md) |     

| 12-27-2024 | [1014. Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-27-2024-best-sightseeing-pair.md) |     

| 12-28-2024 | [689. Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/description/) | ![Hard][hard_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-28-2024-max-sum-of-3-non-overlapping-subarrays.md) |     

| 12-29-2024 | [1639. Number of Ways to Form a Target String Given a Dictionary](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/description/) | ![Hard][hard_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/December/12-29-2024-form-a-target-string-given-a-dictionary.md) |

| 01-01-2025 | [1422. Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/description/) | ![Easy][easy_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-01-2025-max-score-after-splitting-a-string.md) |     

| 01-02-2025 | [2559. Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-02-2025-count-vowel-strings-in-ranges.md) |     

| 01-03-2025 | [2270. Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-03-2025-no-of-ways-to-split-array.md) |     

| 01-04-2025 | [1930. Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-04-2025-unique-length-3-palindromic-subsequences.md) |     

| 01-05-2025 | [2381. Shifting Letters II](https://leetcode.com/problems/shifting-letters-ii/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-05-2025-shifting-letters-II.md) |

| 01-06-2025 | [1769. Min. No. of Ops to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-06-2025-min-ops-to-move-all-balls-to-each-box.md) |     

| 01-07-2025 | [1408. String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/description/) | ![Easy][easy_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-07-2025-string-matching-in-an-array.md) |     

| 01-08-2025 | [3042. Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/description/) | ![Easy][easy_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-08-2025-count-prefix-and-suffix-pairs-I.md) |     

| 01-09-2025 | [2185. Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/description/) | ![Easy][easy_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-09-2025-counting-words-with-a-given-prefix.md) |     

| 01-10-2025 | [916. Word Subsets](https://leetcode.com/problems/word-subsets/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-10-2025-word-subsets.md) |     

| 01-11-2025 | [1400. Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/description) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-11-2025-construct-k-palindrome-strings.md) |     

| 01-12-2025 | [2116. Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-12-2025-check-if-parentheses-string-can-be-valid.md) |     

| 01-13-2025 | [3223. Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-13-2025-min-length-of-string-after-operations.md) |     

| 01-14-2025 | [2657. Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-14-2025-find-prefix-common-array-of-two-arrays.md) |     

| 01-15-2025 | [2429. Minimize XOR](https://leetcode.com/problems/minimize-xor/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-15-2025-minimize-xor.md) |     

| 01-16-2025 | [2425. Bitwise XOR of All Pairings](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-16-2025-bitwise-xor-of-all-pairings.md) |     

| 01-17-2025 | [2683. Neighboring Bitwise XOR](https://leetcode.com/problems/neighboring-bitwise-xor/description/) | ![Medium][medium_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-17-2025-neighboring-bitwise-xor.md) |     

| 01-18-2025 | [1368. Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/) | ![Hard][hard_tag] | [Solution](https://github.com/AKR-2803/DSA-Declassified/blob/main/POTD-Leetcode/January/01-18-2025-min-cost-to-make-at-least-1-valid-path.md) |     

[easy_tag]: https://img.shields.io/badge/Easy-green?style=for-the-badge

[medium_tag]: https://img.shields.io/badge/Medium-yellow?style=for-the-badge

[hard_tag]: https://img.shields.io/badge/Hard-red?style=for-the-badge



As I’m learning alongside you, any feedback and reviews are highly appreciated.