How martindch24/leetcode-problems works
This is a collection of independent LeetCode Python solutions, not an integrated application. The principal workflow is: an interview learner selects a problem, invokes that problem’s Solution method, and receives the computed answer. The repository spans arrays, strings, graph traversal, trees, greedy methods, dynamic programming, and numerical/search techniques. Sampled files show algorithms owning their own data structures and nested helpers; there is no shared runtime, persistence layer, or repository-wide orchestrator.
Main entry points: 79.word_search.py Word Search · 2071.maximum_number_of_tasks_you_can_assign.py Task Assignment · 704.binary_search.py Binary Search · 35.search_insert_position.py Insert Position
Components 21
Arrays & Windows
- Binary Search
704.binary_search.py - Insert Position
35.search_insert_position.py - Maximum Average
643.maximum_average_subarray_i.py - Trapping Rain Water
42.trapping_rain_water.py
Strings & Grids
- Goal Parser
1678.goal_parser_interpretation.py - Word Search
79.word_search.py - Region Average
3030.find_the_grid_of_region_average.py - Regex Matching
10.regular_expression_matching.py
Graphs & Traversal
- Route Reordering
1466.reorder_routes_to_make_all_paths_lead_to_the_city_zero.py - Division Evaluation
399.evaluate_division.py - Point Connection
1584.min_cost_to_connect_all_points.py - Course Scheduling
207.course_schedule.py
DP & Optimization
- Task Assignment
2071.maximum_number_of_tasks_you_can_assign.py - Feasibility Check
2071.maximum_number_of_tasks_you_can_assign.py - Merge Stones
1000.minimum_cost_to_merge_stones.py - Coin Change
322.coin_change.py - House Robber
198.house_robber.py
Trees & Structures
- Same Tree
100.same_tree.py - Symmetric Tree
101.symmetric_tree.py - Stream Median
295.find_median_from_data_stream.py
Other components
- Interview Learner
Connections 41
- Interview Learner → Binary Search: invokes solution
- Binary Search → Interview Learner: returns index
- Interview Learner → Insert Position: invokes solution
- Insert Position → Interview Learner: returns position
- Interview Learner → Maximum Average: invokes solution
- Maximum Average → Interview Learner: returns average
- Interview Learner → Trapping Rain Water: invokes solution
- Trapping Rain Water → Interview Learner: returns volume
- Interview Learner → Goal Parser: invokes solution
- Goal Parser → Interview Learner: returns string
- Interview Learner → Word Search: invokes solution
- Word Search → Interview Learner: returns match
- Word Search → Word Search: calls DFS
- Interview Learner → Region Average: invokes solution
- Region Average → Interview Learner: returns grid
- Interview Learner → Regex Matching: invokes solution
- Regex Matching → Interview Learner: returns match
- Interview Learner → Route Reordering: invokes solution
- Route Reordering → Interview Learner: returns flips
- Interview Learner → Division Evaluation: invokes solution
- Division Evaluation → Interview Learner: returns values
- Interview Learner → Point Connection: invokes solution
- Point Connection → Interview Learner: returns cost
- Interview Learner → Course Scheduling: invokes solution
- Course Scheduling → Interview Learner: returns ordering
- Interview Learner → Task Assignment: invokes solution
- Task Assignment → Feasibility Check: checks feasibility
- Feasibility Check → Task Assignment: returns boolean
- Task Assignment → Interview Learner: returns count
- Interview Learner → Merge Stones: invokes solution
- Merge Stones → Interview Learner: returns cost
- Interview Learner → Coin Change: invokes solution
- Coin Change → Interview Learner: returns count
- Interview Learner → House Robber: invokes solution
- House Robber → Interview Learner: returns profit
- Interview Learner → Same Tree: invokes solution
- Same Tree → Interview Learner: returns equality
- Interview Learner → Symmetric Tree: invokes solution
- Symmetric Tree → Interview Learner: returns symmetry
- Interview Learner → Stream Median: invokes solution
- Stream Median → Interview Learner: returns median