Find LCM of N numbers, with modulo M, where for this problem statement M is 1e9 + 7.

Given a number, count the number of set bits.

Given a string A representing JSON object. Return an array of the string denoting JSON object with proper indentation. Rules for proper inde

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a f

Multiply Strings in C++, without using libraries for this purpose.

Find if the given number is a power of 2 or not. More specifically, find if the given number can be expressed as 2^k where k >= 1.

Given two binary strings, return their sum (also a binary string). Example: a = "100" -> 4 in decimal b = "11" -> 3 in decimal Return a +

Given a string A representing a roman numeral. Convert A into an integer. A is guaranteed to be within the range from 1 to 3999.

Given an integer A, convert it to a roman numeral, and return a string corresponding to its roman numeral version.

Given a string containing only digits, restore it by returning all possible valid IP address combinations. A valid IP address must be in the