3870 LeetCode problem solution
Another LeetCode problem solved with just one line of code. The trick is simple: every number in the given range can contain at most one comma.
Read moreLeetCode 940 Dynamic Programming Solution After LeetCode 115
LeetCode 940 solution using Dynamic Programming with Last Occurrence and Deduplication to count distinct subsequences efficiently in O(n) time and O(1) space.
Read moreLeetCode 3903 Elixir solution
LeetCode 3903 Smallest Stable Index I solution in Elixir. The same approach and solution used in Java, C++, and Python, now implemented in Elixir.
Read moreLeetCode 115: two solutions - Space optimization using a 1D array
See how a simple 1D array optimization reduces space complexity from O(n * m) to O(m) while keeping O(n * m) time complexity.
Read moreLeetCode 4000 - 4010 problems: patterns and approaches explained
A quick overview of LeetCode problems 4000 - 4010. Each problem includes a short description and the main algorithm patterns and techniques that can be used to solve it, without providing full code solutions.
Read more