Question Link : https://leetcode.com/problems/rectangle-area/

Difficulty: Medium

Question

Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area covered by the two rectangles. The first rectangle is defined by its bottom-left corner (ax1, ay1) and its top-right corner (ax2, ay2). The second rectangle …

Continue reading

Question Link : https://leetcode.com/problems/smallest-even-multiple/

Difficulty: Easy

Question

Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n.   Example 1:

Input: n = 5 Output: 10 Explanation: The smallest multiple of both 5 and 2 is 10.

Example 2:

Input …

Continue reading

Question Link : https://leetcode.com/problems/number-of-common-factors/

Difficulty: Easy

Question

Given two positive integers a and b, return the number of common factors of a and b. An integer x is a common factor of a and b if x divides both a and b.   Example 1:

Input: a = 12 …

Continue reading

Question Link : https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/

Difficulty: Easy

Question

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3. Note that the average of n elements is the sum of the n elements divided by n and rounded …

Continue reading

Question Link : https://leetcode.com/problems/single-number/

Difficulty: Easy

Question

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.   Example 1: Input: nums = [2,2 …

Continue reading

Question Link : https://leetcode.com/problems/find-the-original-array-of-prefix-xor/

Difficulty: Medium

Question

You are given an integer array pref of size n. Find and return the array arr of size n that satisfies:

pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i].

Note that ^ denotes the bitwise-xor operation. It can be proven that …

Continue reading

Question Link : https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/

Difficulty: Medium

Question

Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment or decrement an element of the array by 1. Test cases are designed …

Continue reading