How alfred-cyber/leetcodetemplates works
This repository is a collection of standalone LeetCode pattern templates and problem solutions, not an application with a shared runtime workflow. The main template file documents a broad set of patterns; the solution directories organize implementations of binary search, sliding-window, and two-pointer problems. The files do not import or orchestrate one another, and the README is empty, so the graph shows these independent study components without inferred call or data-flow edges.
Components 17
Pattern Templates
- Pattern Templates
leetcode_patterns.py
Binary Search
- Binary Search
Solutions/binarySearch/bsearch.py - Rotated Search
Solutions/binarySearch/search.py - Search Insert
Solutions/binarySearch/searchInsert.py - Minimum Eating Speed
Solutions/binarySearch/minEatingSpeed.py
Sliding Window
- Character Replacement
Solutions/slidingwindow/charrep.py - Longest Substring
Solutions/slidingwindow/longestsubstring.py - Maximum Average
Solutions/slidingwindow/maxav.py - Minimum Subarray
Solutions/slidingwindow/min_size_sub.py - Minimum Window
Solutions/slidingwindow/min_window.py
Two Pointers
- Three Sum
Solutions/twoPointers/3sum.py - Valid Palindrome
Solutions/twoPointers/isPalindrome.py - Maximum Area
Solutions/twoPointers/maxArea.py - Remove Element
Solutions/twoPointers/removeElem.py - Remove Duplicates
Solutions/twoPointers/removedups.py - Sorted Squares
Solutions/twoPointers/sortedarr_sqr.py - Sorted Two Sum
Solutions/twoPointers/twoSum.py