Logo
MainBooksThoughtsAbout

Patterns

Elixir solutions

1401 LeetCode problem solution

LeetCode 1401: Circle and Rectangle Overlapping solution using Geometry and Clamping patterns to find the closest rectangle point to the circle center and compare the squared distance with the radius. Time O(1), Space O(1).

Read more

LeetCode 1401 Elixir solution

LeetCode 1401 Circle and Rectangle Overlapping Elixir solution using Geometry and Clamping patterns to find the closest point and detect overlap. O(1) time and O(1) space complexity.

Read more

1520 LeetCode problem solution

LeetCode 1520 Maximum Number of Non-Overlapping Substrings solution with a clear greedy approach, step-by-step explanation, examples, and code.

Read more

LeetCode 2 Add Two Numbers Elixir solution

LeetCode 2 Add Two Numbers Elixir solution recursively processes both linked lists, adding the current node values together with the carry. Each call creates a new node with sum % 10 and passes sum / 10 as the carry to the next recursive call.

Read more

4003 LeetCode problem solution

LeetCode 4003 Minimum Cost Path with Alternating Directions III solution using Dijkstra's algorithm with parity states to find the minimum-cost path.

Read more
PreviousPage 5 of 13Next
☕Support AlgoBytes on Patreon

© 2026 Algobytes

Privaci Policy