Author: ACMer
Given a string s and an integer k, return the number of k-length substrings that occur more than once in s. Constraints n ≤ 100,000 where n is the …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given an integer n, return the number of 1 bits in n. Constraints 0 ≤ n < 2 ** 31 …
You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in the array. Return the sum of all the …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a binary tree root, return whether all leaves are at the same level. Constraints n ≤ 100,000 where n …
Given an integer n, you can swap any two digits at most once. Return the maximum value of the resulting number. Constraints 0 ≤ n < 2 ** 31 …