You are given an integer array nums containing unique elements. Find all possible subsets (the power set) of the array nums. The solution set should not contain duplicate subsets, and the result can be returned in any order.
You are given a 2D grid board containing characters and a string word. The task is to determine whether the given word can be formed by starting at any cell in the grid and moving to adjacent cells, which are horizontally or vertically neighboring. The same cell cannot be reused in forming the word.
You are given a sorted integer array nums that has been rotated at an unknown pivot index k. The array may contain duplicates. Your task is to determine whether a given target exists in the array, minimizing the number of operations as much as possible.
Given an integer array nums that may contain duplicates, return all possible subsets (the power set) of the array. The solution set should not contain duplicate subsets. The subsets should be returned in any order.
Given two integer arrays, preorder and inorder, representing the preorder and inorder traversals of a binary tree, your task is to reconstruct and return the binary tree. The values in the arrays are unique, and the preorder traversal provides the sequence in which nodes are visited before their children, while the inorder traversal provides the order in which nodes are visited between their children.
Given an integer numRows, return the first numRows of Pascal’s triangle. In Pascal’s triangle, each number is the sum of the two numbers directly above it. Your task is to generate and return the first ’numRows’ of the triangle.
