Search for a command to run...
Articles tagged with #math
Given a positive integer n, find the pivot integer x such that: The sum of all elements between 1 and x inclusively equals the sum of all elements between x and n inclusively. Return the pivot integer x. If no such integer exists, return -1. It is ...
For two strings s and t, we say "t divides s" if and only if s = t + t + t + ... + t + t (i.e., t is concatenated with itself one or more times). Given two strings str1 and str2, return the largest string x such that x divides both str1 and str2. Lee...
Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2<sup>x</sup>. LeetCode Problem - 231 class Solution { // This method checks if a given ...
Given an array of integers nums, return the number of**good pairs. A pair (i, j) is called good if nums[i] == nums[j] and i < j. LeetCode Problem - 1512: Link | Click Here class Solution { // Method to count the number of identical pairs in an ar...
You have n coins and you want to build a staircase with these coins. The staircase consists of k rows where the i<sup>th</sup> row has exactly i coins. The last row of the staircase may be incomplete. Given the integer n, return the number of complet...
Given a positive integer num, return true if num is a perfect square or false otherwise. A perfect square is an integer that is the square of an integer. In other words, it is the product of some integer with itself. You must not use any built-in lib...
