Rippling SDE Interview Question 2025 February | Backtracking | on-campus

Question 1: Permutations II Problem Statement Given a collection of numbers nums that might contain duplicates, return all possible unique permutations in any order. Constraints 1 <= nums.length <= 8 -10 <= nums[i] <= 10 Examples Example 1: Input: nums = [1, 1, 2] Output: [[1,1,2], [1,2,1], [2,1,1]] Explanation 1: Sort → [1,1,2]. Fix 1st=1(idx 0): generates [1,1,2] and [1,2,1]. Skip 1st=1(idx 1) — duplicate. Fix 1st=2: generates [2,1,1]. Total = 3 unique permutations (3!/2! = 3 due to one ...