✨ Problem Description Given an integer array nums, return all the unique triplets [nums[i], nums[j], nums[k]] such that i ≠ j ≠ k, and nums[i] + nums[
🧩 Problem Summary Given an array of strings, group the anagrams together. Anagram: A word formed by rearranging the letters of another word (e.g., "e