Logo
MainBooksThoughtsAbout

Patterns

Elixir solutions

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

3483 LeetCode problem solution

LeetCode 3483 Unique 3-Digit Even Numbers is an easy problem with two different solutions. Let's start with a simple O(n³) approach and then optimize it to O(n).

Read more

4001 LeetCode problem solution

LeetCode 4001 Aggregate Two Time Series is a merge-style problem where we combine two timestamped series and sum values that share the same timestamp.

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

2265 LeetCode problem solution

LeetCode 2265 problem is a good example of DFS with postorder traversal. For each node, we calculate the sum and number of nodes in its subtree.

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

© 2026 Algobytes

Privaci Policy