[Codeforces] Round #112 (Div. 2) B. Burning Midnight OilRead more
[Codeforces] Round #113 (Div. 2) C. MedianRead more
[Codeforces] Round #113 (Div. 2) E. TetrahedronRead more
[Codeforces] Croc Champ 2012 - Qualification Round C. BusRead more
[LeetCode] Count Subarrays With Fixed Bounds

2444. Count Subarrays With Fixed Bounds

You are given an integer array nums and two integers minK and maxK.

A fixed-bound subarray of nums is a subarray that satisfies the following conditions:

  • The minimum value in the subarray is equal to minK.
  • The maximum value in the subarray is equal to maxK.

Return the number of fixed-bound subarrays.

A subarray is a contiguous part of an array.

Read more
[LeetCode] Sum of Number and Its Reverse

2443. Sum of Number and Its Reverse

Given a non-negative integer num, return true if num can be expressed as the sum of any non-negative integer and its reverse, or false otherwise.

Read more
[LeetCode] Count Number of Distinct Integers After Reverse Operations

2442. Count Number of Distinct Integers After Reverse Operations

You are given an array nums consisting of positive integers.

You have to take each integer in the array, reverse its digits, and add it to the end of the array. You should apply this operation to the original integers in nums.

Return the number of distinct integers in the final array.

Read more
[LeetCode] Largest Positive Integer That Exists With Its Negative

2441. Largest Positive Integer That Exists With Its Negative

Given an integer array nums that does not contain any zeros, find the largest positive integer k such that -k also exists in the array.

Return the positive integer k. If there is no such integer, return -1.

Read more
47th Place on Google Kickstart

Read more
[Kick Start 2022 Round G] Cute Little ButterflyRead more