Leetcode 15 - 3Sum

Prompt: Given a list of integers, nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. [Read More]
Tags: Leetcode

Leetcode 341 - Flatten Nested List Iterator

Prompt: Given a list, the possible elements are integers or lists, which also contains integers or list of integers, make a class that can iterate over the next integer of the flatten list. The flatten list is a 1 dimensional version of the original list where all elements are integers.... [Read More]