First, I completed the coding assessment, with all test cases passing. Then, I received an invitation for a technical interview round.

During the interview, I was asked two medium-level LeetCode questions. I needed to explain the optimal approach, justify why it was chosen, and state its time and space complexity.

Unfortunately, after a week, I received a rejection email with the common reason: "Not proceeding with your candidacy at this time."

Group Anagram and 3 Sum

This section covers two common algorithm problems:

• Group Anagram: Given a list of strings, group the anagrams together. Anagrams are words or phrases formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
• 3 Sum: Given an array of integers, find all unique triplets in the array which give the sum of zero. The solution set must not contain duplicate triplets.