How devdatta1429/leetcode works
This repository is a collection of independent LeetCode-style Python solutions, not a single application: a user selects a problem, supplies its inputs to that problem’s Solution method, and receives its computed result. The files cover array, string, numeric, search, and dynamic-programming tasks. There is no shared dispatcher, storage layer, or cross-solution runtime in the available evidence. Nodes represent notable individual solutions; the sampled code shows their algorithms, but not a common mechanism for invoking them.
Components 14
Array problems
- Nearby duplicate
219-contains-duplicate-ii/contains-duplicate-ii.py - Summary ranges
228-summary-ranges/summary-ranges.py - Array intersection
350-intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.py - Window average
643-maximum-average-subarray-i/maximum-average-subarray-i.py
String problems
- Palindrome check
125-valid-palindrome/valid-palindrome.py - Reverse vowels
345-reverse-vowels-of-a-string/reverse-vowels-of-a-string.py - Key formatting
482-license-key-formatting/license-key-formatting.py
Numeric problems
- Roman conversion
13-roman-to-integer/roman-to-integer.py - Binary addition
67-add-binary/add-binary.py - Triangle classification
3321-type-of-triangle/type-of-triangle.py
Search and DP
- Insert position
35-search-insert-position/search-insert-position.py - Range search
34-find-first-and-last-position-of-element-in-sorted-array/find-first-and-last-position-of-element-in-sorted-array.py - Coin change
322-coin-change/coin-change.py
Other components
- Problem user