All Posts

Leetcode 1276: Number of Burgers with No Waste of Ingredients

Given two integers tomatoSlices and cheeseSlices, return the number of Jumbo and Small burgers that can be made, such that all tomatoSlices and cheeseSlices are used. If it is not possible, return an empty list.

Leetcode 1344: Angle Between Hands of a Clock

Given an hour and minute value, return the smaller angle (in degrees) formed between the hour and minute hands of a clock.

Leetcode 1352: Product of the Last K Numbers

Design an algorithm that accepts a stream of integers and retrieves the product of the last k integers in the stream.

Leetcode 1362: Closest Divisors

Given an integer num, find the closest two integers whose product is equal to either num + 1 or num + 2 and whose absolute difference is the smallest. You need to return these two integers in any order.

Leetcode 1390: Four Divisors

Given an integer array nums, find the sum of divisors of all integers in that array that have exactly four divisors. If there are no such integers, return 0.

Leetcode 1401: Circle and Rectangle Overlapping

You are given a circle represented by its radius and center coordinates, as well as an axis-aligned rectangle represented by its bottom-left and top-right corners. Determine if the circle and the rectangle overlap, i.e., if there is any point inside both the circle and the rectangle.