Can you solve this real interview question? Beautiful Arrangement - Suppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful …

Can you solve this real interview question? Beautiful Arrangement II - Given two integers n and k, construct a list answer that contains n different positive integers ranging from 1 to n and obeys the …

Can you solve this real interview question? Beautiful Arrangement II - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next …

Can you solve this real interview question? Beautiful Towers I - You are given an array heights of n integers representing the number of bricks in n consecutive towers. Your task is to remove some …

Beautiful Array - An array nums of length n is beautiful if: * nums is a permutation of the integers in the range [1, n]. * For every 0 <= i < j < n, there is no index k with i < k < j where 2 * nums [k] == nums [i] …

Can you solve this real interview question? Reorganize String - Given a string s, rearrange the characters of s so that any two adjacent characters are not the same. Return any possible …

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = [1,2,2,3,4,4,3] Output: true Example 2: Input: root = [1,2,2,null,3,null,3] …

Can you solve this real interview question? Permutations - Given an array nums of distinct integers, return all the possible permutations. You can return the answer ...

Can you solve this real interview question? Random Pick with Weight - You are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index. You need to implement the …

Can you solve this real interview question? Subsets II - Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The ...