Find the Count of Good Integers You are given two positive integers n and k. An integer x is called k-palindromic if: x is a palindrome. x is divisible by k. An integer is called good if its ...

Count Symmetric Integers You are given two positive integers low and high. An integer x consisting of 2 * n digits is symmetric if the sum of the first n digits of x is equal to the sum of the l...

Count the Number of Powerful Integers You are given three integers start, finish, and limit. You are also given a 0-indexed string s representing a positive integer. A positive integer x is call...

Minimum Operations to Make Array Values Equal to K You are given an integer array nums and an integer k. An integer h is called valid if all values in the array that are strictly greater than h ...

Minimum Number of Operations to Make Elements in Array Distinct You are given an integer array nums. You need to ensure that the elements in the array are distinct. To achieve this, you can perfo...

Largest Divisible Subset Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies: answer...

Sum of All Subset XOR Totals The XOR total of an array is defined as the bitwise XOR of** all its elements, or 0 if the array is empty**. For example, the **XOR total** of the array [2,5,6] is 2...

Lowest Common Ancestor of Deepest Leaves Given the root of a binary tree, return the lowest common ancestor of its deepest leaves. Recall that: The node of a binary tree is a leaf if and only i...

Maximum Value of an Ordered Triplet II You are given a 0-indexed integer array nums. Return the maximum value over all triplets of indices (i, j, k) such that i < j < k*. *If all such trip...

Maximum Value of an Ordered Triplet I You are given a 0-indexed integer array nums. Return the maximum value over all triplets of indices (i, j, k) such that i < j < k. If all such triplet...