1. Sort the given array using only O(n) solution: [0,1,1,1,0,0,0,1,0,1,0,1,1,0,0]
2. Which languages are you comfortable speaking: Hindi, Kannada, or English?
3. How do you prioritize tasks?
4. What are the agile ceremonies?
5. 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. Notice that the solution set must not contain duplicate triplets.