3210. Find the Encrypted String
3210. Find the Encrypted String
Description
You are given a string s and an integer k. Encrypt the string using the following algorithm:
536. Construct Binary Tree from String
536. Construct Binary Tree from String
Description
You need to construct a binary tree from a string consisting of parenthesis and integers.
582. Kill Process
742. Closest Leaf in a Binary Tree
742. Closest Leaf in a Binary Tree
Description
Given the root of a binary tree where every node has a unique value and a target integer k, return the value of the nearest leaf node to the target k in the tree.
3209. Number of Subarrays With AND Value of K
3209. Number of Subarrays With AND Value of K
Description
Given an array of integers nums and an integer k, return the number of subarrays of nums where the bitwise AND of the elements of the subarray equals k.
3208. Alternating Groups II
3207. Maximum Points After Enemy Battles
3207. Maximum Points After Enemy Battles
Description
You are given an integer array enemyEnergies denoting the energy values of various enemies.
3206. Alternating Groups I
863. All Nodes Distance K in Binary Tree
863. All Nodes Distance K in Binary Tree
Description
Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the target node.
919. Complete Binary Tree Inserter
919. Complete Binary Tree Inserter
Description
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.