Optimizing Two Sum: Moving from O(n²) to O(n) with Hash Maps
Learn how to optimize the Two Sum problem by replacing O(n²) brute force with a single-pass O(n) hash map, including a breakdown of the time-space trade-off.
Loading…
ReadMeFeed / Community knowledge
#algorithms
Real questions. Useful conversations. Find the people who know your stack.
leetcodePolyglot Logic: The Engineering Trade-offs of TheAlgorithms
Explore TheAlgorithms’ engineering choices: polyglot, zero‑dependency, naive implementations that prioritize learning over performance.
Mapping Algorithm Logic Across Languages with thealgorithms
Explore how thealgorithms project uses a standard-library-only approach to provide cross-language algorithm references for engineers migrating logic between stacks.
Read the Constraints First: Using LeetCode's Limits and Custom Test Runner to Pick the Right Algorithm
LeetCode's constraints and Run Code runner are a specification and a free debugging pass. Learn to derive a complexity budget from input bounds, debug edge cases without submitting, and read verdicts as signals.
LeetCode's Difficulty Labels Are Stuck in 2015 — Here's a Better Way to Score Problems
LeetCode's Easy/Medium/Hard tiers are static thresholds on aggregate stats, which misrepresents difficulty across skill groups. This post proposes a hybrid score combining solve time, success rate, and problem length, with a worked example and validation steps.
Implementing Dijkstra’s Algorithm in Python with heapq: Complexity, Edge‑Weight Rules, and Practical Trade‑offs
Implement Dijkstra’s algorithm in Python using heapq: understand the O((V+E) log V) complexity, handle non‑negative edge weights, and learn practical trade‑offs for sparse graphs. Includes a worked example and testing tips.
Architecture Note: Using Binary Search from thealgorithms Library
Explains how to integrate the binary search routine from thealgorithms into a service, covering requirements, design, trust boundaries, checks, and failure modes.
javaImplementing Robust Binary Search Patterns for LeetCode Problems
Avoid infinite loops and off-by-one errors in LeetCode problems by implementing standardized binary search templates for both sorted arrays and optimization search spaces.
Embedded doctests vs. dedicated pytest modules for algorithm edge cases
The Python repository emphasizes the use of doctests within function docstrings to provide both documentation and executable verification. This approach ensures that basic usage examples remain synchronized with the implementation during CI via pytest --doctest-modules . However, when implementing complex sorting or mathematical algorithms, a clear trade-off
pytest
python