Count Square Sum Triples A square triple (a,b,c) is a triple where a, b, and c are integers and a2 + b2 = c2. Given an integer n, return *the number of square triples such that *1 <= a, b, c ...

Count Odd Numbers in an Interval Range Given two non-negative integers low and high. Return the count of odd numbers between *low and high (inclusive)*.   Example 1: **Input:** low = 3, high ...

Count Partitions With Max-Min Difference at Most K You are given an integer array nums and an integer k. Your task is to partition nums into one or more non-empty contiguous segments such that in...

Count Partitions with Even Sum Difference You are given an integer array nums of length n. A partition is defined as an index i where 0 <= i < n - 1, splitting the array into two non-empty...

Count Collisions on a Road There are n cars on an infinitely long road. The cars are numbered from 0 to n - 1 from left to right and each car is present at a unique point. You are given a 0-inde...

Count Number of Trapezoids I You are given a 2D integer array points, where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane. A horizontal trapezoid is a c...

Make Sum Divisible by P Given an array of positive integers nums, remove the smallest subarray (possibly empty) such that the sum of the remaining elements is divisible by p. It is not allowed to...

Minimum Operations to Make Array Sum Divisible by K You are given an integer array nums and an integer k. You can perform the following operation any number of times: Select an index i and repla...

Maximum Subarray Sum With Length Divisible by K You are given an array of integers nums and an integer k. Return the maximum sum of a subarray of nums, such that the size of the subarray is divi...

Paths in Matrix Whose Sum Is Divisible by K You are given a 0-indexed m x n integer matrix grid and an integer k. You are currently at position (0, 0) and you want to reach position (m - 1, n - 1...