✨ 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 Description Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements. Examp
🔍 Problem Description Given a non-negative integer array height[] representing the elevation map where the width of each bar is 1, compute how much w