Logo
MainBooksThoughtsAbout

Patterns

Elixir solutions

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

LeetCode 836 Rectangle Overlap problem Elixir solution

LeetCode 836 Rectangle Overlap Elixir solution using the Interval Overlap pattern. Using this pattern we simply check whether the rectangles overlap on both the X and Y axes, which takes O(1) time and O(1) space.

Read more

LeetCode 835 Image Overlap Elixir solution

LeetCode 835 Image Overlap solution in Elixir using coordinate translation and frequency counting patterns. The O(n⁴) worst-case approach remains practical because the matrix size is limited to n ≤ 30.

Read more

LeetCode 3483 Elixir solution

LeetCode 3483 Unique 3-Digit Even Numbers solution in Elixir. An optimized approach using digit frequencies with O(n) time and O(1) space.

Read more

LeetCode 1 Two Sum Elixir solution

LeetCode 1 Two Sum solution in Elixir. The same approach and solution used in Java, C++, and Python in an imperative style, here implemented in Elixir using a functional style.

Read more
PreviousPage 2 of 3Next
☕Support AlgoBytes on Patreon

© 2026 Algobytes

Privaci Policy