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 moreLeetCode 3483 Unique 3-Digit Even Numbers solution in Elixir. An optimized approach using digit frequencies with O(n) time and O(1) space.
Read moreLeetCode 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 moreLeetCode 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 moreLeetCode 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 moreLeetCode 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