Posts tagged "leetcode"

3414 LeetCode problem solution

For solving this problem we need to use the Weighted Interval Scheduling pattern with Dynamic Programming and Binary Search patterns. First, we sort all intervals by their right endpoint while keeping their original indices. For each interval, we use binary search to find the last interval whose right endpoint is strictly smaller than the current left endpoint.

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.

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).

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.

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.

PreviousPage 8 of 11Next