Math

Leetcode - Number of Good Pairs Solution

Given an array of integers nums. A pair (i,j) is called

Leetcode - Maximum 69 Number Solution

Given a positive integer num consisting only of digits 6 and 9.

Leetcode - Subtract the Product and Sum of Digits of an Integer Solution

Given an integer number n, return the difference between the product of

Leetcode - Self Dividing Numbers Solution

A self-dividing number is a number that is divisible by every digit

Leetcode - Power of Three Solution

Given an integer n, return true if it is a power of

Leetcode - Happy Number Solution

Write an algorithm to determine if a number n is happy. A

Leetcode - Sqrt(x) Solution

Given a non-negative integer x, compute and return the square root of

Leetcode - Multiply Strings Solution

Given two non-negative integers num1 and num2 represented as strings, return the

Hackerrank Polar Coordinates Solution

Hackerrank Polar Coordinates Solution

Polar coordinates are an alternative way of representing Cartesian coordinates or Complex