LeetCode 338. Counting BitsGiven an integer n, return an array ans of length n + 1 such that for each i (0 <= i <=

LeetCode 263. Ugly NumberLeetCode-263 An ugly number is a positive integer whose prime factors are limited to 2, 3, and

LeetCode 392. Is SubsequenceGiven two strings s and t, return true if s is a subsequence of t, or false otherwise. Examp

LeetCode 201. Bitwise AND of Numbers RangeLeetCode-201 Given two integers left and right that represent the range [left,

LeetCode 268. Missing NumberLeetCode-268 Given an array nums containing n distinct numbers in the range [0, n], return t

LeetCode 190. Reverse BitsLeetCode-190 Reverse bits of a given 32 bits unsigned integer. Example 1:Input: n = 0000001010

LeetCode 67. Add BinaryGiven two binary strings a and b, return their sum as a binary string. Example 1:Input: a = "11",

LeetCode 371. Sum of Two IntegersGiven two integers a and b, return the sum of the two integers without using the operat