Assignment 1 - Problem Solving by Python

Problem 1: Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Problem 2: Given an integer array 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.