Codestin Search App

Practice › Codeforces Solutions ›

Codeforces Round 1091 (Div. 2) and CodeCraft 26

Codeforces Round 1091 (Div. 2) and CodeCraft 26 Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 1000-2600 | Time: 7m 34s Problem Name Rating Tags Solve Time Verified B Flip the Bit (Easy Version) 1000 greedy, implementation 2m 15s ✗ D Flip the Bit (Hard Version) 1900 greedy, implementation, math 1m 50s ✗ E Definitely Larger 2000 binary-search, constructive-algorithms, data-structures 1m 39s ✗ G Down the...

Practice › Codeforces Solutions › Codeforces Round 1091 (Div. 2) and CodeCraft 26 ›

CF 2217G - Down the Pivot

CF 2217G - Down the Pivot Rating: 2600 Tags: combinatorics, dp, math, trees Solve time: 1m 50s Verified: no Solution Problem Understanding We are working with rooted binary trees where each node carries a binary label, either zero or one. The tree structure is arbitrary as long as every node has at most two children. On top of that structure, we assign labels independently. The only allowed operation is very...

Practice › Codeforces Solutions › Codeforces Round 1091 (Div. 2) and CodeCraft 26 ›

CF 2217D - Flip the Bit (Hard Version)

CF 2217D - Flip the Bit (Hard Version) Rating: 1900 Tags: greedy, implementation, math Solve time: 1m 50s Verified: no Solution Problem Understanding We are given a binary array where each position contains either 0 or 1. A subset of positions is marked as special, and all special positions initially share the same value, call it $x$. The goal is to transform the entire array so that every element becomes...

Practice › Codeforces Solutions ›

Codeforces Round 1090 (Div. 4)

Codeforces Round 1090 (Div. 4) Type: Div. 4 | Problems: 4 | Verified: 1/4 | Rating range: 800-1800 | Time: 10m 7s Problem Name Rating Tags Solve Time Verified A The 67th Integer Problem 800 brute-force, games, implementation 1m 27s ✓ D The 67th OEIS Problem 1100 constructive-algorithms, greedy, math 2m 4s ✗ F The 67th Tree Problem 1500 constructive-algorithms, implementation, trees 3m 38s ✗ G [The 67th Iteration of...

Practice › Codeforces Solutions › Codeforces Round 1090 (Div. 4) ›

CF 2218D - The 67th OEIS Problem

CF 2218D - The 67th OEIS Problem Rating: 1100 Tags: constructive algorithms, greedy, math, number theory Solve time: 2m 4s Verified: no Solution Problem Understanding We are asked to construct sequences of integers of length $n$ such that the greatest common divisor (gcd) of consecutive elements is always distinct. Each test case provides a number $n$, and for each, we must output one valid sequence of length $n$. The output...

Practice › Codeforces Solutions › Codeforces Round 1090 (Div. 4) ›

CF 2218A - The 67th Integer Problem

CF 2218A - The 67th Integer Problem Rating: 800 Tags: brute force, games, implementation, math Solve time: 1m 27s Verified: yes Solution Problem Understanding The problem asks us to pick an integer $y$ for a given integer $x$ so that the minimum of $x$ and $y$ is as large as possible. We are given multiple test cases, each consisting of a single integer $x$ between -67 and 67. Our output...

Practice › Codeforces Solutions › Codeforces Round 114 (Div. 2) ›

CF 168A - Wizards and Demonstration

CF 168A - Wizards and Demonstration Rating: 900 Tags: implementation, math Solve time: 2m 1s Verified: yes Solution Problem Understanding The city has n real residents. Among them, exactly x are wizards, and all of those wizards will attend a demonstration. Nobody else will attend. The administration measures attendance as a percentage of the real city population, which remains n even if the wizards create clones. A clone counts as...

Practice › Codeforces Solutions ›

Codeforces Round 114 (Div. 2)

Codeforces Round 114 (Div. 2) Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 900-900 | Time: 2m 1s Problem Name Rating Tags Solve Time Verified A Wizards and Demonstration 900 implementation, math 2m 1s ✓

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219A - Grid L

CF 2219A - Grid L Rating: - Tags: brute force, constructive algorithms, math, number theory Solve time: 3m 30s Verified: no Solution Problem Understanding An $n \times m$ grid consists of all unit segments that form the lattice. Every cell contributes edges, but neighboring cells share edges, so the total number of unit segments in the whole grid is not $4nm$. We are given two types of pieces. A straight...

Practice › Codeforces Solutions ›

Codeforces Round 1093 (Div. 1)

Codeforces Round 1093 (Div. 1) Type: Div. 1 | Problems: 1 | Verified: 0/1 | Rating range: - | Time: 3m 30s Problem Name Rating Tags Solve Time Verified A Grid L - brute-force, constructive-algorithms, math 3m 30s ✗

Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227A - Koshary

CF 2227A - Koshary Rating: - Tags: implementation, math Solve time: 2m 38s Verified: no Solution Problem Understanding We are given a grid starting at the origin point $(0,0)$ and a target point $(x,y)$. At each move, Yousef can increase exactly one coordinate by 2 using a long step, either moving right by 2 or up by 2. In addition, he is allowed to use a single special move during...

Practice › Codeforces Solutions › Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) ›

CF 2222C - Median Partition

CF 2222C - Median Partition Rating: - Tags: dp, math Solve time: 2m 36s Verified: no Solution Setup The simulator maintains a global simulated time variable $CLOCK$ and executes each MIX instruction by dispatching to a routine that models its effect on registers, memory, and timing. The I/O instructions considered here are restricted to devices $16$ and $18$. Device $16$ represents the read-card unit, and device $18$ represents the printer...

Practice › Codeforces Solutions › Codeforces Round 1095 (Div. 2) ›

CF 2226E - Mental Monumental (Hard Version)

CF 2226E - Mental Monumental (Hard Version) Rating: - Tags: data structures, greedy, math, two pointers Solve time: 3m 59s Verified: no Solution Problem Understanding We are given an array, and we look at it prefix by prefix. For each prefix we are allowed to transform each element independently exactly once using a very permissive operation: pick any integer $b_i \ge 1$, replace $a_i$ with the remainder of dividing it...

Practice › Codeforces Solutions › Codeforces Round 1095 (Div. 2) ›

CF 2226A - Disturbing Distribution

CF 2226A - Disturbing Distribution Rating: - Tags: greedy, math Solve time: 3m 10s Verified: no Solution Problem Understanding We are given a sequence of positive integers. We repeatedly remove groups of elements until nothing remains. Each group must respect two constraints: if we look at the chosen indices in increasing order, the corresponding values must be nondecreasing, and the indices themselves must be strictly increasing as usual for a...

Practice › Codeforces Solutions › Codeforces Round 1095 (Div. 2) ›

CF 2226B - Everything Everywhere

CF 2226B - Everything Everywhere Rating: - Tags: greedy, math, number theory Solve time: 3m 22s Verified: no Solution Problem Understanding We are given a permutation of the integers from 1 to n . For every contiguous subarray, we look at three quantities: its maximum value, its minimum value, the GCD of all values inside it. A subarray is called good when $$\max - \min = \gcd(\text{all elements})$$ The task...

Practice › Codeforces Solutions ›

Codeforces Round 1096 (Div. 3)

Codeforces Round 1096 (Div. 3) Type: Div. 3 | Problems: 8 | Verified: 0/8 | Rating range: - | Time: 27m 59s Problem Name Rating Tags Solve Time Verified A Koshary - implementation, math 2m 38s ✗ B Party Monster - greedy 3m 38s ✗ C Snowfall - constructive-algorithms, math 4m 24s ✗ D Palindromex - binary-search, brute-force, constructive-algorithms 3m 24s ✗ E It All Went Sideways - binary-search, data-structures,...

Practice › Codeforces Solutions › Codeforces Round 1095 (Div. 2) ›

CF 2226D - Reserved Reversals

CF 2226D - Reserved Reversals Rating: - Tags: constructive algorithms, dp, greedy, math Solve time: 2m 22s Verified: no Solution Problem Understanding We are given several test cases, each consisting of an array. The task is to decide whether we can transform each array into a non-decreasing order using a specific operation: we may pick any subarray, compute its minimum and maximum values, and reverse it, but only if the...

Practice › Codeforces Solutions ›

Codeforces Round 1095 (Div. 2)

Codeforces Round 1095 (Div. 2) Type: Div. 2 | Problems: 7 | Verified: 0/7 | Rating range: - | Time: 23m 23s Problem Name Rating Tags Solve Time Verified A Disturbing Distribution - greedy, math 3m 10s ✗ B Everything Everywhere - greedy, math, number-theory 3m 22s ✗ C Mental Monumental (Easy Version) - binary-search, data-structures, greedy 6m 17s ✗ D Reserved Reversals - constructive-algorithms, dp, greedy 2m 22s ✗...

Practice › Codeforces Solutions ›

Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)

Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Type: Div. 1+2 | Problems: 6 | Verified: 0/6 | Rating range: - | Time: 23m 39s Problem Name Rating Tags Solve Time Verified A A Wonderful Contest - brute-force, dp, math 4m 29s ✗ B Artistic Balance Tree - greedy, sortings 3m 53s ✗ C Median Partition - dp, math 2m 36s ✗ D Permutation Construction -...

Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227F - It Just Keeps Going Sideways

CF 2227F - It Just Keeps Going Sideways Rating: - Tags: binary search, data structures, dp, greedy, math Solve time: 5m 5s Verified: no Solution Problem Understanding Each column contains cubes stacked from height $1$ up to height $a_i$. After gravity turns to the right, cubes never change height. Cubes at the same height slide independently and occupy the rightmost available positions on that horizontal level. It is useful to...

Practice › Codeforces Solutions ›

Educational Codeforces Round 189 (Rated for Div. 2)

Educational Codeforces Round 189 (Rated for Div. 2) Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: - | Time: 14m 18s Problem Name Rating Tags Solve Time Verified B Alternating String - brute-force, greedy 3m 12s ✗ C Red-Black Pairs - dp, greedy 2m 34s ✗ D Exceptional Segments - bitmasks, brute-force, math 3m 1s ✗ E Covering Points with Circles - constructive-algorithms, geometry, math 2m...

Practice › Codeforces Solutions › Codeforces Round 1095 (Div. 2) ›

CF 2226F - Inversion Invasion

CF 2226F - Inversion Invasion Rating: - Tags: math, number theory Solve time: 1m 41s Verified: no Solution Problem Understanding For every divisor $d\mid n$, define $$G_d={v\in[1,n]\mid \gcd(v,n)=d}.$$ The array $a$ gradually fixes some positions. If $a_i=d\neq 0$, then position $i$ must contain a value from $G_d$. Unfixed positions may contain any remaining values. A valid permutation exists only if, for every divisor $d$, $$c_d \le |G_d|,$$ where $c_d$ is...

Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227G - Drowning

CF 2227G - Drowning Rating: - Tags: binary search, data structures, math Solve time: 2m 57s Verified: no Solution Problem Understanding Ta có một mảng số nguyên dương. Một phép giảm chọn ba phần tử liên tiếp sao cho phần tử giữa nhỏ hơn tổng hai phần tử hai bên. Khi đó bộ ba $$(c_{i-1},c_i,c_{i+1})$$ được thay bằng một giá trị duy nhất $$x=c_{i-1}-c_i+c_{i+1}.$$ Mỗi lần thực hiện, độ dài...

Practice › Codeforces Solutions › Codeforces Round 1095 (Div. 2) ›

CF 2226C - Mental Monumental (Easy Version)

CF 2226C - Mental Monumental (Easy Version) Rating: - Tags: binary search, data structures, greedy, math, two pointers Solve time: 6m 17s Verified: no Solution Problem Understanding Each array element can be modified independently. For a value $x$, we may choose any positive integer $b$, then replace $x$ by $x \bmod b$. The goal is to maximize the MEX of the resulting array. Since the operation is applied independently to...

Practice › Codeforces Solutions › Educational Codeforces Round 189 (Rated for Div. 2) ›

CF 2225E - Covering Points with Circles

CF 2225E - Covering Points with Circles Rating: - Tags: constructive algorithms, geometry, math Solve time: 2m 37s Verified: no Solution Problem Understanding We are given up to $10^4$ integer points on the plane and a fixed radius $r$. We must output the centers of several circles, all having radius $r$, such that the centers have integer coordinates and no two circles overlap in positive area. Touching is allowed, but...

Practice › Codeforces Solutions › Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) ›

CF 2222A - A Wonderful Contest

CF 2222A - A Wonderful Contest Rating: - Tags: brute force, dp, math Solve time: 4m 29s Verified: no Solution Problem Understanding Each problem in the contest is worth at most 100 points. If a problem has $a_i$ subtasks, then every solved subtask contributes $$\frac{100}{a_i}$$ points, and $a_i$ is guaranteed to divide 100. This means every problem contributes one of the values $$0,\ \frac{100}{a_i},\ 2\cdot\frac{100}{a_i},\ \ldots,\ 100.$$ For a contestant,...

Practice › Codeforces Solutions › Educational Codeforces Round 189 (Rated for Div. 2) ›

CF 2225D - Exceptional Segments

CF 2225D - Exceptional Segments Rating: - Tags: bitmasks, brute force, math Solve time: 3m 1s Verified: no Solution Problem Understanding The sequence $[1,2,\dots,n]$ is fixed. For any interval $[l,r]$, the value of interest is the bitwise XOR of all integers in that interval. A segment is valid when two conditions hold simultaneously. The index $x$ lies inside the segment, so $l \le x \le r$. The XOR of the...

Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227C - Snowfall

CF 2227C - Snowfall Rating: - Tags: constructive algorithms, math Solve time: 4m 24s Verified: no Solution Problem Understanding A subarray product is divisible by $6$ if and only if the product contains at least one factor $2$ and at least one factor $3$. For each number, only its divisibility by $2$ and $3$ matters. The exact value is irrelevant. Every element belongs to one of four groups: $A$: divisible...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3761 - Minimum Absolute Distance Between Mirror Pairs

LeetCode Problem 3761 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math Solution Problem Understanding We are given an integer array nums . A pair of indices (i, j) is called a mirror pair if: i < j reverse(nums[i]) == nums[j] The operation reverse(x) reverses the decimal digits of x and removes any leading zeros that appear after reversal. For example: reverse(12) = 21 reverse(120) = 21 reverse(1000) = 1 The...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3430 - Maximum and Minimum Sums of at Most Size K Subarrays

LeetCode Problem 3430 Difficulty: 🔴 Hard Topics: Array, Math, Stack, Monotonic Stack Solution Problem Understanding We are remains efficient even at the maximum constraint limit.

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3671 - Sum of Beautiful Subsequences

LeetCode Problem 3671 Difficulty: 🔴 Hard Topics: Array, Math, Binary Indexed Tree, Number Theory Solution Problem Understanding Let a subsequence of nums be any sequence multiples. citeturn0search1turn0search2 check whether it is strictly increasing, compute its GCD, and add that GCD to the answer. This is correct because every valid subsequence is examined exactly once. Unfortunately, there are 2^n subsequences. Even for `n = um queries efficiently. citeturn0search1turn0 Force | O(2^n...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3669 - Balanced K-Factor Decomposition

LeetCode Problem 3669 Difficulty: 🟡 Medium Topics: Math, Backtracking, Number Theory Solution Problem Understanding We are given two integers, n and k . Our goal is to split n into exactly k positive integers whose product is equal to n . Among all valid decompositions, we want the one where the difference between the largest number and the smallest number is as small as possible. Since the maximum difference between...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3621 - Number of Integers With Popcount-Depth Equal to K I

LeetCode Problem 3621 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Bit Manipulation, Combinatorics Solution Problem Understanding This problem asks us to count integers x in the range [1, n] such that the popcount-depth of x is exactly k . The popcount-depth is defined via a sequence p0, p1, ... where p0 = x and pi+1 = popcount(pi) for all i ≥ 0 . The popcount of a number is the...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3610 - Minimum Number of Primes to Sum to Target

LeetCode Problem 3610 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Number Theory Solution Problem Understanding The problem requires us to determine the minimum number of prime numbers from the first m primes whose sum equals n . A multiset is allowed, meaning each prime may be chosen multiple times. The input integers n and m specify the target sum and the number of primes available, respectively. The output is...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3602 - Hexadecimal and Hexatrigesimal Conversion

LeetCode Problem 3602 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The numbers that still fit in standard integer types; the algorithm scales logarithmically with digit count.

Practice › Codeforces Solutions › Codeforces Round 282 (Div. 2) ›

CF 495B - Modular Equations

CF 495B - Modular Equations Rating: 1600 Tags: math, number theory Solve time: 5m 26s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 938 (Div. 3) ›

CF 1955G - GCD on a grid

CF 1955G - GCD on a grid Rating: 1900 Tags: brute force, dfs and similar, dp, implementation, math, number theory Solve time: 1m 6s Verified: yes Solution Problem Understanding We are given a rectangular grid of integers. A move starts at the top-left cell and ends at the bottom-right cell, and at each step we can only go either one cell down or one cell right. Every such move sequence...

Practice › Codeforces Solutions › Codeforces Round 936 (Div. 2) ›

CF 1946B - Maximum Sum

CF 1946B - Maximum Sum Rating: 1100 Tags: dp, greedy, math Solve time: 2m 45s Verified: no Solution Problem Understanding We are given an array of integers and we are allowed to perform exactly k operations. Each operation lets us pick any contiguous segment of the current array, compute its sum, and insert that sum back into the array at any position. The key effect of an operation is that...

Practice › Codeforces Solutions › Codeforces Round 947 (Div. 1 + Div. 2) ›

CF 1975F - Set

CF 1975F - Set Rating: 2600 Tags: bitmasks, brute force, combinatorics, dfs and similar, divide and conquer, dp, math Solve time: 5m 17s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945B - Fireworks

CF 1945B - Fireworks Rating: 900 Tags: math, number theory Solve time: 1m 25s Verified: yes Solution Problem Understanding Two firework machines start at time zero and then keep launching fireworks periodically. The first machine fires at times that are multiples of a , and the second fires at multiples of b . Every firework, once launched, stays visible for m + 1 minutes, so a firework launched at time...

Practice › Codeforces Solutions › Codeforces Round 938 (Div. 3) ›

CF 1955A - Yogurt Sale

CF 1955A - Yogurt Sale Rating: 800 Tags: math Solve time: 54s Verified: yes Solution Problem Understanding Maxim wants to buy exactly n yogurts from a store where a single yogurt costs a burles, but there is a promotion offering two yogurts for b burles. For each test case, we must calculate the minimum amount he can spend to buy exactly n yogurts. The input specifies multiple test cases, each...

Practice › Codeforces Solutions › Codeforces Round 939 (Div. 2) ›

CF 1956D - Nene and the Mex Operator

CF 1956D - Nene and the Mex Operator Rating: 2000 Tags: bitmasks, brute force, constructive algorithms, divide and conquer, dp, greedy, implementation, math Solve time: 1m 10s Verified: yes Solution Problem Understanding We are given a short array of length at most 18. The only allowed move is to pick a contiguous segment, compute the mex of that segment, and overwrite the entire segment with that mex value. This operation...

Practice › Codeforces Solutions › Educational Codeforces Round 164 (Rated for Div. 2) ›

CF 1954B - Make It Ugly

CF 1954B - Make It Ugly Rating: 1200 Tags: implementation, math Solve time: 1m 15s Verified: no Solution Problem Understanding We are given an array of integers that is guaranteed to be "beautiful," which means that through a specific operation, all elements can eventually become the same. The operation allows us to pick any element that is not at the boundary and replace it with its neighboring value if the...

Practice › Codeforces Solutions › Kotlin Heroes: Episode 10 ›

CF 1958B - Clock in the Pool

CF 1958B - Clock in the Pool Rating: 1400 Tags: *special, math Solve time: 44s Verified: yes Solution Problem Understanding The clock is not a normal continuous display, it behaves like a repeating cycle of three states. Every cycle has length $3k$ seconds. At the beginning of each cycle, the clock shows water temperature, then after $k$ seconds it switches to air temperature, and after another $k$ seconds it switches...

Practice › Codeforces Solutions › Codeforces Round 937 (Div. 4) ›

CF 1950C - Clock Conversion

CF 1950C - Clock Conversion Rating: 800 Tags: implementation, math Solve time: 51s Verified: yes Solution Problem Understanding We are given times expressed in the 24-hour clock format, for example 00:00 for midnight, 13:45 for one forty-five in the afternoon, or 23:59 for one minute before midnight. Our task is to convert each time into the 12-hour clock format, which uses the familiar AM and PM labels. In this system,...

Practice › Codeforces Solutions › Testing Round 11 ›

CF 491B - New York Hotel

CF 491B - New York Hotel Rating: 2100 Tags: greedy, math Solve time: 11m 40s Verified: no Solution Problem Understanding The city is a rectangular grid. Every hotel and every restaurant is located at an intersection with coordinates $(x,y)$. Moving between neighboring intersections costs one kilometer, so the travel distance between two points is the Manhattan distance $$|x_1-x_2| + |y_1-y_2|.$$ All friends start from their hotels and travel to the...

Practice › Codeforces Solutions ›

Codeforces Round 279 (Div. 2)

Codeforces Round 279 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: 1500-2200 | Time: 44m 5s Problem Name Rating Tags Solve Time Verified B Queue 1500 dsu, implementation 11m 48s ✗ C Hacking Cypher 1700 brute-force, math, number-theory 5m 25s ✗ D Chocolate 1900 brute-force, dfs-and-similar, math 5m 18s ✗ E Restoring Increasing Sequence 2000 binary-search, brute-force, greedy 10m 45s ✗ F Treeland Tour...

Practice › Codeforces Solutions › European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) ›

CF 1949K - Make Triangle

CF 1949K - Make Triangle Rating: 2800 Tags: constructive algorithms, math Solve time: 2m 29s Verified: yes Solution Problem Understanding We are given a multiset of positive integers and three required group sizes. Every number must belong to exactly one of the three groups, and each group must contain exactly the requested number of elements. After splitting the numbers, we look only at the three group sums. If those sums...

Practice › Codeforces Solutions › Codeforces Round 938 (Div. 3) ›

CF 1955F - Unfair Game

CF 1955F - Unfair Game Rating: 1800 Tags: dp, games, greedy, math, schedules Solve time: 1m Verified: no Solution Problem Understanding We are asked to maximize the number of games Bob can win in a repeated XOR game against Alice. The game is played on a multiset of integers containing only ones, twos, threes, and fours. Alice wins if the XOR of all remaining numbers is non-zero; otherwise, Bob wins....

Practice › Codeforces Solutions › CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1942C1 - Bessie's Birthday Cake (Easy Version)

CF 1942C1 - Bessie's Birthday Cake (Easy Version) Rating: 1300 Tags: geometry, greedy, math Solve time: 56s Verified: yes Solution Problem Understanding We are given a regular polygon with $n$ vertices representing a cake. Some vertices are already selected by Bessie as potential endpoints for drawing diagonals. Each diagonal connects two chosen vertices, and the goal is to maximize the number of triangles formed by non-intersecting diagonals among these selected...

Practice › Codeforces Solutions ›

Codeforces Round 935 (Div. 3)

Codeforces Round 935 (Div. 3) Type: Div. 3 | Problems: 8 | Verified: 5/8 | Rating range: 800-2600 | Time: 9m 25s Problem Name Rating Tags Solve Time Verified A Setting up Camp 800 greedy, math 55s ✓ B Fireworks 900 math, number-theory 1m 25s ✓ C Left and Right Houses 1200 brute-force 48s ✓ D Seraphim the Owl 1300 dp, greedy 1m 20s ✓ E Binary Search 1700 binary-search,...

Practice › Codeforces Solutions ›

Codeforces Round 934 (Div. 2)

Codeforces Round 934 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1100 | Time: 2m 14s Problem Name Rating Tags Solve Time Verified A Destroying Bridges 800 graphs, greedy, math 55s ✓ B Equal XOR 1100 bitmasks, constructive-algorithms 1m 19s ✗

Practice › Codeforces Solutions › Codeforces Round 945 (Div. 2) ›

CF 1973B - Cat, Fox and the Lonely Array

CF 1973B - Cat, Fox and the Lonely Array Rating: 1300 Tags: binary search, bitmasks, data structures, greedy, math, two pointers Solve time: 5m 16s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 276 (Div. 1)

Codeforces Round 276 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1700-2500 | Time: 26m 55s Problem Name Rating Tags Solve Time Verified A Bits 1700 bitmasks, constructive-algorithms 5m 23s ✗ B Maximum Value 2100 binary-search, math, sortings 10m 57s ✗ D Kindergarten 2400 data-structures, dp, greedy 5m 17s ✗ E Sign on Fence 2500 binary-search, constructive-algorithms, data-structures 5m 18s ✗

Practice › Codeforces Solutions › Codeforces Round 947 (Div. 1 + Div. 2) ›

CF 1975B - 378QAQ and Mocha's Array

CF 1975B - 378QAQ and Mocha's Array Rating: 1000 Tags: brute force, greedy, math, sortings Solve time: 5m 18s Verified: no Solution

Practice › Codeforces Solutions › April Fools Day Contest 2024 ›

CF 1952G - Mathematician Takeover

CF 1952G - Mathematician Takeover Rating: - Tags: *special, binary search, dfs and similar, math Solve time: 1m 8s Verified: no Solution Problem Understanding We are given a single real number $x$ between 1 and 100, expressed to exactly three decimal places. The task is to compute a real number result from $x$, with the requirement that the answer's absolute or relative error does not exceed $10^{-4}$. The problem does...

Practice › Codeforces Solutions › Codeforces Round 939 (Div. 2) ›

CF 1956E1 - Nene vs. Monsters (Easy Version)

CF 1956E1 - Nene vs. Monsters (Easy Version) Rating: 2500 Tags: brute force, implementation, math Solve time: 1m 15s Verified: no Solution Problem Understanding We are given a circle of n monsters, each with an initial energy level a_i . They are numbered from 1 to n , and each monster attacks its clockwise neighbor simultaneously in a single round. When a monster with energy x attacks a neighbor with...

Practice › Codeforces Solutions › Codeforces Round 939 (Div. 2) ›

CF 1956E2 - Nene vs. Monsters (Hard Version)

CF 1956E2 - Nene vs. Monsters (Hard Version) Rating: 2700 Tags: brute force, greedy, implementation, math Solve time: 1m 1s Verified: no Solution Problem Understanding We are given a circle of monsters, each with an energy level. The monsters attack their neighbor in a fixed clockwise order: monster 1 attacks monster 2, monster 2 attacks monster 3, and so on, with the last monster attacking the first. The attack reduces...

Practice › Codeforces Solutions › CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1942A - Farmer John's Challenge

CF 1942A - Farmer John's Challenge Rating: 800 Tags: constructive algorithms, math Solve time: 1m 37s Verified: no Solution Problem Understanding We need to construct an array of length n such that exactly k of its cyclic shifts are sorted in nondecreasing order. A cyclic shift chooses some position as the new beginning of the array and wraps the remaining elements around. For example, the shifts of [1, 2, 3]...

Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486E - LIS of Sequence

CF 486E - LIS of Sequence Rating: 2200 Tags: data structures, dp, greedy, hashing, math Solve time: 5m 17s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 947 (Div. 1 + Div. 2)

Codeforces Round 947 (Div. 1 + Div. 2) Type: Div. 1+2 | Problems: 9 | Verified: 0/9 | Rating range: 800-3500 | Time: 47m 41s Problem Name Rating Tags Solve Time Verified A Bazoka and Mocha's Array 800 brute-force, greedy, implementation 5m 18s ✗ B 378QAQ and Mocha's Array 1000 brute-force, greedy, math 5m 18s ✗ C Chamo and Mocha's Array 1200 binary-search, brute-force, greedy 5m 19s ✗ D Paint...

Practice › Codeforces Solutions ›

Educational Codeforces Round 164 (Rated for Div. 2)

Educational Codeforces Round 164 (Rated for Div. 2) Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 900-3100 | Time: 7m 33s Problem Name Rating Tags Solve Time Verified A Painting the Ribbon 900 constructive-algorithms, greedy, math 1m 3s ✓ B Make It Ugly 1200 implementation, math 1m 15s ✗ C Long Multiplication 1200 greedy, math, number-theory 1m 13s ✗ D Colored Balls 1800 combinatorics, dp, math...

Practice › Codeforces Solutions › CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1942B - Bessie and MEX

CF 1942B - Bessie and MEX Rating: 1100 Tags: constructive algorithms, math Solve time: 1m 18s Verified: no Solution Problem Understanding We are given an array a of length n , constructed from some unknown permutation p of the integers 0 through n-1 . Each element of a satisfies the relation a[i] = MEX(p[1..i]) - p[i] . The task is to reconstruct any valid permutation p that produces this a...

Practice › Codeforces Solutions › Codeforces Global Round 25 ›

CF 1951G - Clacking Balls

CF 1951G - Clacking Balls Rating: 3100 Tags: combinatorics, math, probabilities Solve time: 1m 25s Verified: no Solution Problem Understanding We are given a circle of baskets numbered from 1 to $m$, and $n$ balls initially placed in distinct baskets. Alice repeatedly chooses one of the balls uniformly at random and moves it clockwise to the next basket. If that basket already contains a ball, the existing ball is thrown...

Practice › Codeforces Solutions › Codeforces Round 939 (Div. 2) ›

CF 1956C - Nene's Magical Matrix

CF 1956C - Nene's Magical Matrix Rating: 1600 Tags: constructive algorithms, greedy, math Solve time: 57s Verified: yes Solution Problem Understanding We are given a square matrix of size $n \times n$ initially filled with zeroes. Nene can perform two types of operations: either set an entire row to a permutation of $1$ through $n$ or set an entire column to such a permutation. The goal is to maximize the...

Practice › Codeforces Solutions › Codeforces Round 942 (Div. 1) ›

CF 1967A - Permutation Counting

CF 1967A - Permutation Counting Rating: 1400 Tags: binary search, greedy, implementation, math, sortings Solve time: 1m 16s Verified: no Solution Problem Understanding We are given a set of cards, each labeled with a number from 1 to n. For each number i, we have a_i cards of that type. We also have k coins, and each coin allows us to buy a new card of any type, so we...

Practice › Codeforces Solutions › CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1942C2 - Bessie's Birthday Cake (Hard Version)

CF 1942C2 - Bessie's Birthday Cake (Hard Version) Rating: 1700 Tags: geometry, greedy, math Solve time: 2m 8s Verified: no Solution Problem Understanding We have a regular polygon with n vertices arranged on a circle. Some x vertices are already available for use. We may additionally choose at most y more vertices. After selecting vertices, we are allowed to draw non-intersecting diagonals whose endpoints belong to the selected set. Every...

Practice › Codeforces Solutions › Codeforces Round 942 (Div. 1) ›

CF 1967E1 - Again Counting Arrays (Easy Version)

CF 1967E1 - Again Counting Arrays (Easy Version) Rating: 3100 Tags: combinatorics, dp, fft, math Solve time: 1m 13s Verified: no Solution Problem Understanding We are given a fixed starting height $b_0$ and we imagine building an integer path $b_0, b_1, \ldots, b_n$ where each step moves by exactly $+1$ or $-1$, but the path is never allowed to go below zero. This is a standard “walk on the non-negative...

Practice › Codeforces Solutions › Codeforces Round 934 (Div. 2) ›

CF 1944A - Destroying Bridges

CF 1944A - Destroying Bridges Rating: 800 Tags: graphs, greedy, math Solve time: 55s Verified: yes Solution Problem Understanding We are asked to consider a network of islands where initially every pair of islands is connected by a bridge. There are n islands, numbered from 1 to n , and Everule lives on island 1. Dominater can destroy up to k bridges to reduce the number of islands that Everule...

Practice › Codeforces Solutions › Codeforces Global Round 25 ›

CF 1951D - Buying Jewels

CF 1951D - Buying Jewels Rating: 2000 Tags: constructive algorithms, greedy, math Solve time: 1m 19s Verified: no Solution Problem Understanding We are given a buyer who starts with a fixed number of coins. A shop is not fixed in advance; instead, we are allowed to design up to 60 sequential stalls. Each stall has an unlimited supply of jewels, and a fixed integer price per jewel. The buyer behaves...

Practice › Codeforces Solutions › Codeforces Round 945 (Div. 2) ›

CF 1973E - Cat, Fox and Swaps

CF 1973E - Cat, Fox and Swaps Rating: 2500 Tags: graphs, math, sortings Solve time: 5m 15s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 941 (Div. 1)

Codeforces Round 941 (Div. 1) Type: Div. 1 | Problems: 6 | Verified: 0/6 | Rating range: 1400-3300 | Time: 7m 12s Problem Name Rating Tags Solve Time Verified A Everything Nim 1400 games, greedy, math 1m 24s ✗ B Missing Subsequence Sum 1800 bitmasks, constructive-algorithms, greedy 1m 17s ✗ C Folding Strip 2300 constructive-algorithms, greedy, strings 1m 8s ✗ D Missing Subarray Sum 2900 constructive-algorithms 1m 5s ✗ E...

Practice › Codeforces Solutions › Educational Codeforces Round 164 (Rated for Div. 2) ›

CF 1954D - Colored Balls

CF 1954D - Colored Balls Rating: 1800 Tags: combinatorics, dp, math, sortings Solve time: 1m 43s Verified: no Solution Problem Understanding We are given a collection of balls, each assigned one of n distinct colors, where color i has a_i balls. We are allowed to group these balls, but each group can have at most two balls, and no two balls in the same group can have the same color....

Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486D - Valid Sets

CF 486D - Valid Sets Rating: 2100 Tags: dfs and similar, dp, math, trees Solve time: 5m 18s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 938 (Div. 3) ›

CF 1955C - Inhabitant of the Deep Sea

CF 1955C - Inhabitant of the Deep Sea Rating: 1300 Tags: greedy, implementation, math Solve time: 1m 10s Verified: no Solution Problem Understanding We are given a line of ships, each with some durability, and a fixed attack pattern that always targets the current leftmost surviving ship, then the current rightmost surviving ship, and repeats this alternation until a total of $k$ attacks have been made or all ships sink....

Practice › Codeforces Solutions ›

Testing Round 11

Testing Round 11 Type: Special | Problems: 3 | Verified: 1/3 | Rating range: 1000-2300 | Time: 17m 39s Problem Name Rating Tags Solve Time Verified A Up the hill 1000 constructive-algorithms, implementation 5m 18s ✗ B New York Hotel 2100 greedy, math 11m 40s ✗ C Deciphering 2300 flows, graph-matchings 41s ✓

Practice › Codeforces Solutions › Codeforces Global Round 25 ›

CF 1951C - Ticket Hoarding

CF 1951C - Ticket Hoarding Rating: 1400 Tags: greedy, math, sortings Solve time: 59s Verified: no Solution Problem Understanding The task is to buy exactly k concert tickets over n days, with each day offering a ticket price a_i . You are limited to buying at most m tickets per day. Additionally, every ticket you buy increases the price of all future tickets by the number of tickets bought on...

Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493E - Vasya and Polynomial

CF 493E - Vasya and Polynomial Rating: 2800 Tags: math Solve time: 1m 15s Verified: no Solution Problem Understanding We are asked to count the number of polynomials with non-negative integer coefficients that satisfy a very specific evaluation property. Formally, we are given integers $a$, $b$, and $c$, and we need to find all polynomials $P(x) = a_0 + a_1 x + a_2 x^2 + \dots + a_n x^n$ such...

Practice › Codeforces Solutions › Codeforces Round 942 (Div. 1) ›

CF 1967B2 - Reverse Card (Hard Version)

CF 1967B2 - Reverse Card (Hard Version) Rating: 2200 Tags: brute force, math, number theory Solve time: 1m 30s Verified: no Solution Problem Understanding We are asked to count ordered pairs of integers $(a, b)$ with $1 \le a \le n$ and $1 \le b \le m$ such that $b \cdot \gcd(a, b)$ is divisible by $a+b$. The inputs are multiple test cases, each specifying a pair of limits $n$...

Practice › Codeforces Solutions ›

Codeforces Round 280 (Div. 2)

Codeforces Round 280 (Div. 2) Type: Div. 2 | Problems: 3 | Verified: 1/3 | Rating range: 1400-2000 | Time: 17m 42s Problem Name Rating Tags Solve Time Verified C Vanya and Exams 1400 greedy, sortings 57s ✓ D Vanya and Computer Game 1800 binary-search, implementation, math 11m 25s ✗ E Vanya and Field 2000 math 5m 20s ✗

Practice › Codeforces Solutions › Educational Codeforces Round 164 (Rated for Div. 2) ›

CF 1954A - Painting the Ribbon

CF 1954A - Painting the Ribbon Rating: 900 Tags: constructive algorithms, greedy, math Solve time: 1m 3s Verified: yes Solution Problem Understanding We are asked to decide whether Alice can paint a ribbon of n parts using m colors such that Bob, who can repaint at most k parts into the same color, cannot make the entire ribbon monochromatic. Alice has full freedom to choose the initial coloring, while Bob...

Practice › Codeforces Solutions ›

Codeforces Round 278 (Div. 1)

Codeforces Round 278 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1800-3200 | Time: 27m 2s Problem Name Rating Tags Solve Time Verified A Fight the Monster 1800 binary-search, brute-force, implementation 5m 21s ✗ C Prefix Product Sequence 2300 constructive-algorithms, math, number-theory 5m 22s ✗ D Conveyor Belts 2700 data-structures 5m 24s ✗ E Tourists 3200 data-structures, dfs-and-similar, graphs 10m 55s ✗

Practice › Codeforces Solutions › Educational Codeforces Round 166 (Rated for Div. 2) ›

CF 1976E - Splittable Permutations

CF 1976E - Splittable Permutations Rating: 2500 Tags: combinatorics, data structures, dfs and similar, greedy, math, trees Solve time: 5m 16s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 934 (Div. 1) ›

CF 1943B - Non-Palindromic Substring

CF 1943B - Non-Palindromic Substring Rating: 2000 Tags: hashing, implementation, math, strings Solve time: 1m 20s Verified: no Solution Problem Understanding We are given a string and multiple queries, each asking for a contiguous substring of the original string. For each query, we need to calculate a value f(t) for that substring t . The function f(t) is the sum of all lengths k such that there exists at least...

Practice › Codeforces Solutions › CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1942F - Farmer John's Favorite Function

CF 1942F - Farmer John's Favorite Function Rating: 2700 Tags: brute force, data structures, implementation, math Solve time: 2m 10s Verified: yes Solution Problem Understanding We have an array $a$, and a recursively defined value: $$f(1)=\sqrt{a_1}, \qquad f(i)=\sqrt{f(i-1)+a_i}.$$ After every point update $a_k \leftarrow x$, we need the integer part of $f(n)$. The first obstacle is that the recurrence uses real numbers. A direct simulation would repeatedly evaluate square roots...

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945H - GCD is Greater

CF 1945H - GCD is Greater Rating: 2600 Tags: brute force, data structures, math, number theory Solve time: 1m 17s Verified: no Solution Problem Understanding We are given an array of integers, and two players split the array into two groups. Kirill is allowed to choose a subset that is neither too small nor too large, specifically at least two elements and at most $n-2$ elements. Those chosen elements form...

Practice › Codeforces Solutions ›

Kotlin Heroes: Episode 10

Kotlin Heroes: Episode 10 Type: Kotlin | Problems: 10 | Verified: 7/10 | Rating range: 1100-3200 | Time: 11m 13s Problem Name Rating Tags Solve Time Verified A 1-3-5 1100 *special, dp 47s ✓ B Clock in the Pool 1400 *special, math 44s ✓ C Firewood 1500 *special 1m ✓ D Staircase 1600 *special 1m 14s ✗ E Yet Another Permutation Constructive 1900 *special, constructive-algorithms 1m 4s ✗ F Narrow...

Practice › Codeforces Solutions ›

Codeforces Round 934 (Div. 1)

Codeforces Round 934 (Div. 1) Type: Div. 1 | Problems: 8 | Verified: 1/8 | Rating range: 1300-3500 | Time: 10m 17s Problem Name Rating Tags Solve Time Verified A MEX Game 1 1300 games, greedy 1m 9s ✓ B Non-Palindromic Substring 2000 hashing, implementation, math 1m 20s ✗ C Tree Compass 2300 constructive-algorithms, dfs-and-similar, greedy 1m 16s ✗ D1 Counting Is Fun (Easy Version) 2400 brute-force, combinatorics, dp 1m...

Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493D - Vasya and Chess

CF 493D - Vasya and Chess Rating: 1700 Tags: constructive algorithms, games, math Solve time: 1m 25s Verified: yes Solution Problem Understanding We have an $n \times n$ board. The white queen starts at the top-left corner $(1,1)$, and the black queen starts at the top-right corner $(1,n)$. Every other square contains a green pawn. A move is mandatory. On each turn, a player must capture some piece with their...

Practice › Codeforces Solutions › Codeforces Global Round 25 ›

CF 1951A - Dual Trigger

CF 1951A - Dual Trigger Rating: 900 Tags: constructive algorithms, greedy, math Solve time: 51s Verified: yes Solution Problem Understanding We are given a row of lamps, all initially off. We can perform one type of operation any number of times: choose two lamps that are currently off and are not next to each other, and turn them both on simultaneously. Our task is to determine, for multiple test cases,...

Practice › Codeforces Solutions › CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1942G - Bessie and Cards

CF 1942G - Bessie and Cards Rating: 2800 Tags: combinatorics, dp, math Solve time: 3m 51s Verified: yes Solution Problem Understanding The deck contains four kinds of cards. A draw-0 card consumes one playable card from your hand and gives nothing back. A draw-1 card replaces itself. A draw-2 card consumes one card and gives two new cards, so it increases your future drawing power by one. There are also...

Practice › Codeforces Solutions › Educational Codeforces Round 164 (Rated for Div. 2) ›

CF 1954F - Unique Strings

CF 1954F - Unique Strings Rating: 3100 Tags: combinatorics, dp, math Solve time: 1m 7s Verified: yes Solution Problem Understanding We are given a binary string of length $n$ where the first $c$ characters are ones and the remaining $n - c$ characters are zeros. We are allowed to perform up to $k$ operations, where each operation flips a zero into a one. Two strings are considered identical if one...

Practice › Codeforces Solutions ›

Codeforces Round 278 (Div. 2)

Codeforces Round 278 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1100-1900 | Time: 21m 45s Problem Name Rating Tags Solve Time Verified A Giga Tower 1100 brute-force 10m 47s ✗ B Candy Boxes 1900 brute-force, constructive-algorithms, math 10m 58s ✗

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968A - Maximize?

CF 1968A - Maximize? Rating: 800 Tags: brute force, math, number theory Solve time: 1m 6s Verified: no Solution Problem Understanding We are given a small positive integer $x$. For each such value, we need to choose another integer $y$ strictly smaller than $x$, and we want to maximize the expression $\gcd(x, y) + y$. The interaction between the two terms is important. The gcd term grows when $y$ shares...

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490C - Hacking Cypher

CF 490C - Hacking Cypher Rating: 1700 Tags: brute force, math, number theory, strings Solve time: 5m 25s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 946 (Div. 3) ›

CF 1974A - Phone Desktop

CF 1974A - Phone Desktop Rating: 800 Tags: greedy, math Solve time: 5m 17s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 938 (Div. 3)

Codeforces Round 938 (Div. 3) Type: Div. 3 | Problems: 8 | Verified: 5/8 | Rating range: 800-2300 | Time: 7m 51s Problem Name Rating Tags Solve Time Verified A Yogurt Sale 800 math 54s ✓ B Progressive Square 1000 constructive-algorithms, data-structures, implementation 49s ✓ C Inhabitant of the Deep Sea 1300 greedy, implementation, math 1m 10s ✗ D Inaccurate Subsequence Search 1400 data-structures, two-pointers 46s ✓ E Long Inversions...

Practice › Codeforces Solutions › Codeforces Round 275 (Div. 2) ›

CF 483B - Friends and Presents

CF 483B - Friends and Presents Rating: 1800 Tags: binary search, math Solve time: 5m 22s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 943 (Div. 3)

Codeforces Round 943 (Div. 3) Type: Div. 3 | Problems: 2 | Verified: 1/2 | Rating range: 800-800 | Time: 2m 13s Problem Name Rating Tags Solve Time Verified A Maximize? 800 brute-force, math, number-theory 1m 6s ✗ B Prefiquence 800 greedy, two-pointers 1m 7s ✓

Practice › Codeforces Solutions › Codeforces Round 278 (Div. 2) ›

CF 488B - Candy Boxes

CF 488B - Candy Boxes Rating: 1900 Tags: brute force, constructive algorithms, math Solve time: 10m 58s Verified: no Solution Problem Understanding The task is to reconstruct a set of four integers representing candy counts in boxes such that three properties are equal: the arithmetic mean, the median, and the range. We are given some subset of these four numbers (0 to 4) in arbitrary order. The output should confirm...

Practice › Codeforces Solutions ›

Codeforces Global Round 25

Codeforces Global Round 25 Type: Global | Problems: 9 | Verified: 1/9 | Rating range: 900-3200 | Time: 11m 49s Problem Name Rating Tags Solve Time Verified A Dual Trigger 900 constructive-algorithms, greedy, math 51s ✓ B Battle Cows 1200 binary-search, data-structures, greedy 1m 24s ✗ C Ticket Hoarding 1400 greedy, math, sortings 59s ✗ D Buying Jewels 2000 constructive-algorithms, greedy, math 1m 19s ✗ E No Palindromes 2000 brute-force,...

Practice › Codeforces Solutions › European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) ›

CF 1949E - Damage per Second

CF 1949E - Damage per Second Rating: 2900 Tags: brute force, math Solve time: 1m 7s Verified: no Solution Problem Understanding We are asked to distribute a fixed number of skill points between two attributes: damage per hit and hits per second, in order to minimize the total time to kill a sequence of monsters. Each monster has a health value $h_i$, and the time to kill it is determined...

Practice › Codeforces Solutions › Codeforces Round 947 (Div. 1 + Div. 2) ›

CF 1975G - Zimpha Fan Club

CF 1975G - Zimpha Fan Club Rating: 3000 Tags: fft, greedy, math, strings Solve time: 5m 19s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 275 (Div. 2)

Codeforces Round 275 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1100-1800 | Time: 16m 14s Problem Name Rating Tags Solve Time Verified A Counterexample 1100 brute-force, implementation, math 10m 52s ✗ B Friends and Presents 1800 binary-search, math 5m 22s ✗

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490D - Chocolate

CF 490D - Chocolate Rating: 1900 Tags: brute force, dfs and similar, math, meet-in-the-middle, number theory Solve time: 5m 18s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 937 (Div. 4)

Codeforces Round 937 (Div. 4) Type: Div. 4 | Problems: 7 | Verified: 6/7 | Rating range: 800-1900 | Time: 7m 41s Problem Name Rating Tags Solve Time Verified A Stair, Peak, or Neither? 800 implementation 1m 4s ✓ B Upscaling 800 implementation 45s ✓ C Clock Conversion 800 implementation, math 51s ✓ D Product of Binary Decimals 1100 brute-force, dp, implementation 1m 17s ✓ E Nearly Shortest Repeating Substring...

Practice › Codeforces Solutions › European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) ›

CF 1949H - Division Avoidance

CF 1949H - Division Avoidance Rating: 3100 Tags: greedy, math Solve time: 5m 53s Verified: no Solution Problem Understanding The process starts with a single cell at (0, 0) . Whenever we divide a cell (x, y) , that cell disappears and produces (x + 1, y) and (x, y + 1) . A division is only legal if neither child is currently present. We are given a finite set...

Practice › Codeforces Solutions › Codeforces Round 945 (Div. 2) ›

CF 1973C - Cat, Fox and Double Maximum

CF 1973C - Cat, Fox and Double Maximum Rating: 1700 Tags: constructive algorithms, greedy, implementation, math, sortings Solve time: 5m 15s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Global Round 25 ›

CF 1951E - No Palindromes

CF 1951E - No Palindromes Rating: 2000 Tags: brute force, constructive algorithms, divide and conquer, greedy, hashing, implementation, math, strings Solve time: 1m 1s Verified: no Solution Problem Understanding We are given a string and we are allowed to cut it into contiguous pieces. The goal is to decide whether we can cut it so that every resulting piece is not a palindrome. If it is possible, we must also...

Practice › Codeforces Solutions › Codeforces Round 942 (Div. 1) ›

CF 1967B1 - Reverse Card (Easy Version)

CF 1967B1 - Reverse Card (Easy Version) Rating: 1400 Tags: brute force, math, number theory Solve time: 57s Verified: no Solution Problem Understanding We are asked to count the number of ordered pairs $(a, b)$ where $1 \le a \le n$ and $1 \le b \le m$ such that the sum $a+b$ is divisible by $b \cdot \gcd(a,b)$. In other words, if you take the greatest common divisor of $a$...

Practice › Codeforces Solutions › Codeforces Round 280 (Div. 2) ›

CF 492E - Vanya and Field

CF 492E - Vanya and Field Rating: 2000 Tags: math Solve time: 5m 20s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 945 (Div. 2) ›

CF 1973A - Chess For Three

CF 1973A - Chess For Three Rating: 900 Tags: brute force, dp, implementation, math Solve time: 5m 14s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 942 (Div. 1)

Codeforces Round 942 (Div. 1) Type: Div. 1 | Problems: 8 | Verified: 1/8 | Rating range: 1400-3500 | Time: 10m 27s Problem Name Rating Tags Solve Time Verified A Permutation Counting 1400 binary-search, greedy, implementation 1m 16s ✗ B1 Reverse Card (Easy Version) 1400 brute-force, math, number-theory 57s ✗ B2 Reverse Card (Hard Version) 2200 brute-force, math, number-theory 1m 30s ✗ C Fenwick Tree 2300 bitmasks, brute-force, combinatorics 1m...

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484B - Maximum Value

CF 484B - Maximum Value Rating: 2100 Tags: binary search, math, sortings, two pointers Solve time: 10m 57s Verified: no Solution Problem Understanding We are given a list of integers, and we are allowed to pick two positions in it, say one value acts as a dividend and the other as a divisor. The only restriction is that the dividend must be at least as large as the divisor. For...

Practice › Codeforces Solutions › Codeforces Round 934 (Div. 1) ›

CF 1943D1 - Counting Is Fun (Easy Version)

CF 1943D1 - Counting Is Fun (Easy Version) Rating: 2400 Tags: brute force, combinatorics, dp, math Solve time: 1m 31s Verified: no Solution Problem Understanding We are looking at arrays of length n , where each position can hold an integer between 0 and k . Every such array is considered a candidate, so the total universe is (k+1)^n . The notion of “good” is defined through an operation that...

Practice › Codeforces Solutions › Codeforces Round 945 (Div. 2) ›

CF 1973D - Cat, Fox and Maximum Array Split

CF 1973D - Cat, Fox and Maximum Array Split Rating: 2400 Tags: brute force, interactive, math Solve time: 5m 14s Verified: no Solution

Practice › Codeforces Solutions › Educational Codeforces Round 164 (Rated for Div. 2) ›

CF 1954C - Long Multiplication

CF 1954C - Long Multiplication Rating: 1200 Tags: greedy, math, number theory Solve time: 1m 13s Verified: no Solution Problem Understanding We are given two very large integers represented as strings, both having the same number of digits. Every digit is between 1 and 9, so there are no zeros to complicate positional effects or leading zero issues. The only operation allowed is to swap digits at the same position...

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965A - Everything Nim

CF 1965A - Everything Nim Rating: 1400 Tags: games, greedy, math, sortings Solve time: 1m 24s Verified: no Solution Problem Understanding We are given several independent games, each defined by a list of piles containing stones. Two players alternate turns. A move consists of choosing an integer $k$ that does not exceed the smallest nonempty pile, then simultaneously subtracting $k$ stones from every pile that is still nonempty. Any pile...

Practice › Codeforces Solutions ›

Codeforces Round 276 (Div. 2)

Codeforces Round 276 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1300-1400 | Time: 16m 31s Problem Name Rating Tags Solve Time Verified A Factory 1400 implementation, math, matrices 5m 22s ✗ B Valuable Resources 1300 brute-force, greedy 11m 9s ✗

Practice › Codeforces Solutions › Codeforces Round 280 (Div. 2) ›

CF 492D - Vanya and Computer Game

CF 492D - Vanya and Computer Game Rating: 1800 Tags: binary search, implementation, math, sortings Solve time: 11m 25s Verified: no Solution Problem Understanding The game produces an infinite sequence of hits. Vanya attacks every $\frac{1}{x}$ seconds, so his hits happen at times $$\frac1x,\frac2x,\frac3x,\dots$$ Vova attacks every $\frac{1}{y}$ seconds, so his hits happen at times $$\frac1y,\frac2y,\frac3y,\dots$$ Whenever a hit occurs, it contributes one damage point. If both players hit at...

Practice › Codeforces Solutions › Codeforces Round 278 (Div. 1) ›

CF 487C - Prefix Product Sequence

CF 487C - Prefix Product Sequence Rating: 2300 Tags: constructive algorithms, math, number theory Solve time: 5m 22s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 946 (Div. 3)

Codeforces Round 946 (Div. 3) Type: Div. 3 | Problems: 7 | Verified: 0/7 | Rating range: 800-2000 | Time: 36m 53s Problem Name Rating Tags Solve Time Verified A Phone Desktop 800 greedy, math 5m 17s ✗ B Symmetric Encoding 800 implementation, sortings, strings 5m 18s ✗ C Beautiful Triple Pairs 1400 combinatorics, data-structures 5m 16s ✗ D Ingenuity-2 1400 constructive-algorithms, greedy, implementation 5m 16s ✗ E Money Buys...

Practice › Codeforces Solutions › Educational Codeforces Round 164 (Rated for Div. 2) ›

CF 1954E - Chain Reaction

CF 1954E - Chain Reaction Rating: 2200 Tags: binary search, data structures, dsu, greedy, implementation, math, number theory Solve time: 1m 12s Verified: no Solution Problem Understanding We are given a line of monsters, each with some initial health. One operation consists of choosing a single monster as the starting point of a “chain lightning”. That lightning hits the chosen monster and then continues outward to both sides, always staying...

Practice › Codeforces Solutions ›

Codeforces Round 945 (Div. 2)

Codeforces Round 945 (Div. 2) Type: Div. 2 | Problems: 6 | Verified: 0/6 | Rating range: 900-3100 | Time: 31m 30s Problem Name Rating Tags Solve Time Verified A Chess For Three 900 brute-force, dp, implementation 5m 14s ✗ B Cat, Fox and the Lonely Array 1300 binary-search, bitmasks, data-structures 5m 16s ✗ C Cat, Fox and Double Maximum 1700 constructive-algorithms, greedy, implementation 5m 15s ✗ D Cat, Fox...

Practice › Codeforces Solutions ›

CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)

CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) Type: Div. 1+2 | Problems: 9 | Verified: 4/9 | Rating range: 800-3500 | Time: 16m 46s Problem Name Rating Tags Solve Time Verified A Farmer John's Challenge 800 constructive-algorithms, math 1m 37s ✗ B Bessie and MEX 1100 constructive-algorithms, math 1m 18s ✗ C1 Bessie's Birthday Cake (Easy Version) 1300 geometry, greedy, math 56s ✓ C2 Bessie's Birthday Cake...

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 2) ›

CF 485A - Factory

CF 485A - Factory Rating: 1400 Tags: implementation, math, matrices Solve time: 5m 22s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 277 (Div. 2)

Codeforces Round 277 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 800-2200 | Time: 26m 47s Problem Name Rating Tags Solve Time Verified A Calculating Function 800 implementation, math 10m 49s ✗ B OR in Matrix 1300 greedy, hashing, implementation 5m 23s ✗ D Valid Sets 2100 dfs-and-similar, dp, math 5m 18s ✗ E LIS of Sequence 2200 data-structures, dp, greedy 5m 17s ✗

Practice › Codeforces Solutions › Codeforces Round 942 (Div. 1) ›

CF 1967E2 - Again Counting Arrays (Hard Version)

CF 1967E2 - Again Counting Arrays (Hard Version) Rating: 3500 Tags: combinatorics, dp, math Solve time: 1m 26s Verified: no Solution Problem Understanding We are asked to count arrays of integers that meet a very particular set of conditions. We have a starting number, $b_0$, and we want to consider sequences $b_0, b_1, \dots, b_n$ where consecutive elements differ by exactly 1. Simultaneously, there is another sequence $a_1, \dots, a_n$...

Practice › Codeforces Solutions ›

Codeforces Round 936 (Div. 2)

Codeforces Round 936 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 1/5 | Rating range: 800-2500 | Time: 10m 41s Problem Name Rating Tags Solve Time Verified A Median of an Array 800 greedy, implementation, sortings 2m 44s ✗ B Maximum Sum 1100 dp, greedy, math 2m 45s ✗ C Tree Cutting 1600 binary-search, dp, greedy 2m 50s ✓ D Birthday Gift 1900 bitmasks, brute-force, constructive-algorithms 1m 7s...

Practice › Codeforces Solutions › Educational Codeforces Round 163 (Rated for Div. 2) ›

CF 1948F - Rare Coins

CF 1948F - Rare Coins Rating: 2500 Tags: combinatorics, math, probabilities Solve time: 2m 56s Verified: no Solution Problem Understanding Each bag contains a fixed number of gold coins and a number of silver coins. Gold coins always contribute one unit of value. Silver coins are uncertain, each silver coin independently contributes either 0 or 1 with equal probability. The randomness is only in silver coins; everything else is deterministic....

Practice › Codeforces Solutions › Codeforces Round 275 (Div. 2) ›

CF 483A - Counterexample

CF 483A - Counterexample Rating: 1100 Tags: brute force, implementation, math, number theory Solve time: 10m 52s Verified: no Solution Problem Understanding We are asked to construct three integers inside a given interval such that they form a very specific pattern of coprimality relationships. We need three distinct numbers $a < b < c$, all lying between $l$ and $r$, where adjacent pairs $(a,b)$ and $(b,c)$ share no common divisors...

Practice › Codeforces Solutions › Codeforces Round 942 (Div. 1) ›

CF 1967C - Fenwick Tree

CF 1967C - Fenwick Tree Rating: 2300 Tags: bitmasks, brute force, combinatorics, data structures, dp, math, trees Solve time: 1m 2s Verified: no Solution Problem Understanding We are asked to reverse a Fenwick Tree construction. A Fenwick Tree is normally defined for an array a of length n such that each element s_k stores the sum of a contiguous subarray of a whose length is the lowest set bit of...

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945A - Setting up Camp

CF 1945A - Setting up Camp Rating: 800 Tags: greedy, math Solve time: 55s Verified: yes Solution Problem Understanding We are given a group of participants who must be assigned into tents, where each tent can hold at most three people. The participants come in three types with different constraints on how they are willing to share a tent. Introverts refuse to share a tent at all, so each introvert...

Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486A - Calculating Function

CF 486A - Calculating Function Rating: 800 Tags: implementation, math Solve time: 10m 49s Verified: no Solution Problem Understanding We are given a single positive integer and asked to evaluate a function built by alternating addition and subtraction of consecutive integers starting from 1. The sequence begins by subtracting 1, then adding 2, subtracting 3, adding 4, and so on until we reach n. The sign of each term depends...

Practice › Codeforces Solutions ›

Codeforces Round 282 (Div. 2)

Codeforces Round 282 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 1100-1600 | Time: 7m 5s Problem Name Rating Tags Solve Time Verified A Digital Counter 1100 implementation 1m 39s ✓ B Modular Equations 1600 math, number-theory 5m 26s ✗

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3649 - Number of Perfect Pairs

LeetCode Problem 3649 Difficulty: 🟡 Medium Topics: Array, Math, Two Pointers, Sorting Solution Problem Understanding We are given an integer array nums and must count how many index pairs (i, j) with i < j are perfect . For each pair, let: a = nums[i] b = nums[j] The pair is considered perfect if both of the following conditions hold: min(|a - b|, |a + b|) <= min(|a|, |b|) max(|a...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3629 - Minimum Jumps to Reach End via Prime Teleportation

LeetCode Problem 3629 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Breadth-First Search, Number Theory Solution Problem Understanding The problem gives an integer array nums of length n , where each index represents a node in a graph. The task is to start at index 0 and reach index n - 1 in the minimum number of moves. From any index i , there are two types of moves. The...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3792 - Sum of Increasing Product Blocks

LeetCode Problem 3792 Difficulty: 🟡 Medium Topics: Math, Simulation Solution Problem Understanding The problem defines a sequence of blocks, where each block contains the product of a consecutive range of integers. The pattern works as follows: The 1st block contains only 1 The 2nd block contains 2 × 3 The 3rd block contains 4 × 5 × 6 The 4th block contains 7 × 8 × 9 × 10 Notice...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3875 - Construct Uniform Parity Array I

LeetCode Problem 3875 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to determine if it is possible to construct a new array nums2 of the same length as nums1 where all elements are either all odd or all even. For each element nums2[i] , we can either copy the corresponding element from nums1[i] directly, or we can set it as the difference between nums1[i] and...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3790 - Smallest All-Ones Multiple

LeetCode Problem 3790 Difficulty: 🟡 Medium Topics: Hash Table, Math Solution Problem Understanding This problem asks us to find the smallest positive integer composed entirely of the digit 1 that is divisible by a given integer k . The input k is guaranteed to be between 2 and 100,000. We are asked not for the number itself, but for the number of digits in this number, which simplifies the task...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3789 - Minimum Cost to Acquire Required Items

LeetCode Problem 3789 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding This problem asks us to determine the minimum cost required to acquire a set of items that satisfy two separate type requirements. We have three types of items: type 1, type 2, and type 3. Type 1 contributes only to the first requirement, type 2 contributes only to the second requirement, and type 3 contributes to both requirements...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3881 - Direction Assignments with Exactly K Visible People

LeetCode Problem 3881 Difficulty: 🟡 Medium Topics: Math, Combinatorics Solution LeetCode 3881 - Direction Assignments with Exactly K Visible People Problem Understanding We are given n people standing in a line, indexed from 0 to n - 1 . Each person independently chooses one of two directions: 'L' means the person is visible only to people on their right. 'R' means the person is visible only to people on their...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3782 - Last Remaining Integer After Alternating Deletion Operations

LeetCode Problem 3782 Difficulty: 🔴 Hard Topics: Math, Recursion Solution Before I write the full guide, I want to confirm one critical detail because the examples appear inconsistent with the stated operations. The statement says: Operation 1: Starting from the left, delete every second number Example transforms [1,2,3,4,5,6,7,8] → [1,3,5,7] This means it is deleting positions 2,4,6,8 and keeping odd positions . However, for Operation 2 on [1,3,5,7] , the...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3876 - Construct Uniform Parity Array II

LeetCode Problem 3876 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem asks us to determine whether we can construct a new array nums2 from a given array nums1 of distinct integers such that all elements in nums2 have the same parity (all even or all odd). For each index i , we have two options: we can either take nums1[i] directly, or subtract any other element nums1[j]...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3869 - Count Fancy Numbers in a Range

LeetCode Problem 3869 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution LeetCode 3869 - Count Fancy Numbers in a Range Problem Understanding We are given two integers l and r , and we must count how many integers in the inclusive range [l, r] are fancy . The definition of a fancy number is based on the concept of a good number. A number is good if its digits form...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3871 - Count Commas in Range II

LeetCode Problem 3871 Difficulty: 🟡 Medium Topics: Math Solution LeetCode 3871 - Count Commas in Range II Problem Understanding The problem asks us to count the total number of commas that appear when writing every integer from 1 through n using standard comma-separated number formatting. In standard formatting, commas are inserted every three digits from the right: 1 through 999 contain no commas. 1,000 through 999,999 contain one comma each....

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3870 - Count Commas in Range

LeetCode Problem 3870 Difficulty: 🟢 Easy Topics: Math Solution LeetCode 3870 - Count Commas in Range Problem Understanding The problem asks us to count how many commas appear when writing every integer from 1 through n using standard number formatting. In standard formatting, commas are inserted every three digits from the right side of the number. For example: 999 contains 0 commas. 1,000 contains 1 comma. 12,345 contains 1 comma....

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3867 - Sum of GCD of Formed Pairs

LeetCode Problem 3867 Difficulty: 🟡 Medium Topics: Array, Math, Two Pointers, Simulation, Number Theory Solution LeetCode 3867 - Sum of GCD of Formed Pairs Problem Understanding We are given an integer array nums of length n . For every index i , we first compute: mxi , the maximum value among nums[0...i] prefixGcd[i] = gcd(nums[i], mxi) This creates a new array called prefixGcd . After that, we sort prefixGcd in...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3857 - Minimum Cost to Split into Ones

LeetCode Problem 3857 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution LeetCode 3857 - Minimum Cost to Split into Ones Problem Understanding We are given a single integer n . Starting with this integer, we repeatedly perform split operations until every resulting piece is equal to 1 . A split operation takes some integer x and divides it into two positive integers a and b such that: $$a + b...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3855 - Sum of K-Digit Numbers in a Range

LeetCode Problem 3855 Difficulty: 🔴 Hard Topics: Math, Divide and Conquer, Combinatorics, Number Theory Solution LeetCode 3855 - Sum of K-Digit Numbers in a Range Problem Understanding We are given three integers l , r , and k . For every digit position, we may independently choose any digit from the inclusive range [l, r] . We then form all possible numbers consisting of exactly k digits. A key detail...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3850 - Count Sequences to K

LeetCode Problem 3850 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Memoization, Number Theory Solution LeetCode 3850 - Count Sequences to K Problem Understanding We start with a value val = 1 and process the array from left to right. For every element nums[i] , we must choose exactly one of three actions: Multiply the current value by nums[i] Divide the current value by nums[i] Do nothing Division is exact...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3757 - Number of Effective Subsequences

LeetCode Problem 3757 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics Solution Here’s a complete, detailed technical guide for LeetCode 3757 - Number of Effective Subsequences , following your formatting instructions exactly. Problem Understanding The problem gives us an array of integers, nums , and asks us to determine the number of effective subsequences . The strength of the array is defined as the bitwise OR of...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3848 - Check Digitorial Permutation

LeetCode Problem 3848 Difficulty: 🟡 Medium Topics: Math, Counting Solution Problem Understanding The problem asks us to determine whether any permutation of the digits of a given integer n forms a digitorial number. A digitorial number is defined as a number equal to the sum of the factorials of its digits. For instance, 145 is digitorial because $1! + 4! + 5! = 145$. The input is a single integer...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3756 - Concatenate Non-Zero Digits and Multiply by Sum II

LeetCode Problem 3756 Difficulty: 🟡 Medium Topics: Math, String, Prefix Sum Solution Please provide the official LeetCode problem statement or confirm the exact problem details for LeetCode 3756 - Concatenate Non-Zero Digits and Multiply by Sum II . I want to avoid hallucinating the intended optimal approach because this appears to be a very recent/problem-specific question, and correctness matters for the full guide, code, worked examples, and complexity analysis. The...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3754 - Concatenate Non-Zero Digits and Multiply by Sum I

LeetCode Problem 3754 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to process an integer n and construct a new number using only its non-zero digits. These digits must remain in the same order in which they originally appear. After constructing this new integer x , we calculate the sum of its digits and then return the product: $$x \times \text{sum of digits of } x$$...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3750 - Minimum Number of Flips to Reverse Binary String

LeetCode Problem 3750 Difficulty: 🟢 Easy Topics: Math, Two Pointers, String, Bit Manipulation Solution Problem Understanding The problem gives us a positive integer n , and asks us to work with its binary representation. First, we convert n into a binary string s without leading zeros. Then, we compute the reverse of that binary string. Our goal is to determine the minimum number of bit flips required so that s...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3749 - Evaluate Valid Expressions

LeetCode Problem 3749 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Divide and Conquer, Stack Solution Problem Understanding The problem presents a simplified version of evaluating nested mathematical expressions in string format. The input expression is either a single integer literal, which may be negative, or a nested operation of the form op(a,b) where op is one of the four basic arithmetic operations: add , sub , mul , or...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3828 - Final Element After Subarray Deletions

LeetCode Problem 3828 Difficulty: 🟡 Medium Topics: Array, Math, Brainteaser, Game Theory Solution Problem Understanding We are given an integer array nums . Two players, Alice and Bob, repeatedly remove a contiguous subarray from the current array. The only restriction is that the removed subarray cannot be the entire current array, so after every move at least one element remains. After a subarray is removed, the remaining elements are concatenated...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3736 - Minimum Moves to Equal Array Elements III

LeetCode Problem 3736 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to determine the minimum number of moves required to make every element in an integer array equal. A move consists of selecting one element and increasing it by exactly 1 . We are not allowed to decrease values, and we can only increment elements. In other words, we need to choose a target value...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3733 - Minimum Time to Complete All Deliveries

LeetCode Problem 3733 Difficulty: 🟡 Medium Topics: Math, Binary Search Solution This is a long, structured reference document. To make sure I target the correct problem and avoid producing an incorrect guide, I want to verify one thing first: Can you confirm the exact LeetCode problem number/title? “LeetCode 3733 - Minimum Time to Complete All Deliveries” does not appear to match a known standard problem in my current knowledge, and...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3821 - Find Nth Smallest Integer With K One Bits

LeetCode Problem 3821 Difficulty: 🔴 Hard Topics: Math, Bit Manipulation, Combinatorics Solution Problem Understanding This problem asks us to find the nth smallest positive integer whose binary representation contains exactly k ones . In other words, we are working with numbers that, when written in binary, have a specific number of bits set to 1 . The input consists of two integers: n representing the ordinal position in the sequence...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3725 - Count Ways to Choose Coprime Integers from Rows

LeetCode Problem 3725 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Matrix, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to determine how many ways we can choose exactly one number from each row of a given m x n matrix such that the greatest common divisor (GCD) of all chosen numbers is 1. In other words, we need to count all valid combinations of one element per...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3817 - Good Indices in a Digit String

LeetCode Problem 3817 Difficulty: 🟡 Medium Topics: Math, String Solution LeetCode 3817 - Good Indices in a Digit String Problem Understanding We are given a string s consisting only of decimal digits. The string length is n , and indices are zero-based. For every index i , we need to determine whether i is a good index . An index is considered good if there exists a substring ending exactly...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3704 - Count No-Zero Pairs That Sum to N

LeetCode Problem 3704 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution Problem Understanding The problem asks us to count all pairs of positive integers (a, b) such that their sum equals a given integer n and neither a nor b contains the digit 0 in their decimal representation. These integers are called no-zero integers . The input n is guaranteed to be at least 2 and can be as large...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3805 - Count Caesar Cipher Pairs

LeetCode Problem 3805 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, String, Counting Solution LeetCode 3805 - Count Caesar Cipher Pairs Problem Understanding We are given an array words containing n lowercase strings. Every string has the same length m . Two strings are considered similar if we can repeatedly apply the following operation to either string: Shift every character forward by one position in the alphabet. The alphabet wraps...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3700 - Number of ZigZag Arrays II

LeetCode Problem 3700 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution Problem Understanding The problem asks us to count the number of arrays of length n where each element is in the range [l, r] , no two consecutive elements are equal, and no three consecutive elements are strictly increasing or strictly decreasing. These arrays are termed ZigZag arrays . In other words, for an array A of length n...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3765 - Complete Prime Number

LeetCode Problem 3765 Difficulty: 🟡 Medium Topics: Math, Enumeration, Number Theory Solution LeetCode 3765 - Complete Prime Number Problem Understanding The problem gives us a positive integer num and asks whether it is a Complete Prime Number . A number qualifies as a Complete Prime Number if every prefix and every suffix of its decimal representation is prime. For a number with digits d1 d2 d3 ... dn : Prefixes...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3681 - Maximum XOR of Subsequences

LeetCode Problem 3681 Difficulty: 🔴 Hard Topics: Array, Math, Greedy, Bit Manipulation Solution LeetCode 3681 - Maximum XOR of Subsequences Problem Understanding The problem gives us an array nums of non-negative integers. We must choose two subsequences: The first subsequence has XOR value X . The second subsequence has XOR value Y . The two subsequences: May be empty. Must preserve the original order of elements, as all subsequences do....

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3569 - Maximize Count of Distinct Primes After Split

LeetCode Problem 3569 Difficulty: 🔴 Hard Topics: Array, Math, Segment Tree, Number Theory Solution Problem Understanding The task asks us to maintain an integer array that is repeatedly updated, and after each update we must determine an optimal split point that maximizes a specific score based on distinct prime values . For any split index $k$, the array is divided into a prefix $[0..k-1]$ and a suffix $[k..n-1]$. We compute...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3609 - Minimum Moves to Reach Target in Grid

LeetCode Problem 3609 Difficulty: 🔴 Hard Topics: Math Solution Problem Understanding The problem asks us to determine the minimum number of moves to reach a target point (tx, ty) from a starting point (sx, sy) on an infinite 2D grid. The movement rules are specific: from any point (x, y) , you can move either right by max(x, y) units or up by max(x, y) units. That means each move...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3550 - Smallest Index With Digit Sum Equal to Index

LeetCode Problem 3550 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem requires us to find the smallest index in an integer array nums such that the sum of the digits of the element at that index is equal to the index itself. In other words, for each index i , we calculate the sum of the digits of nums[i] and check if it equals i . If...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3558 - Number of Ways to Assign Edge Weights I

LeetCode Problem 3558 Difficulty: 🟡 Medium Topics: Math, Tree, Depth-First Search Solution LeetCode 3558 - Number of Ways to Assign Edge Weights I Problem Understanding We are given an undirected tree rooted at node 1 . Every edge initially has weight 0 , and we must assign each edge a weight of either 1 or 2 . The problem asks us to choose any node x that has the maximum...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3539 - Find Sum of Array Product of Magical Sequences

LeetCode Problem 3539 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics, Bitmask Solution Problem Understanding This problem asks us to compute the sum of array products for all magical sequences of a given length. A magical sequence is defined as a sequence of indices into the input array nums of length m , such that when you sum 2 raised to each element of the sequence, the...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3556 - Sum of Largest Prime Substrings

LeetCode Problem 3556 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Sorting, Number Theory Solution Problem Understanding The problem requires identifying prime numbers from all possible substrings of a given string of digits and summing the three largest unique primes. In simpler terms, given a string s of length up to 10, we must consider every contiguous sequence of digits, convert it to an integer (ignoring any leading zeros), and...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3519 - Count Numbers with Non-Decreasing Digits

LeetCode Problem 3519 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming Solution LeetCode 3519 - Count Numbers with Non-Decreasing Digits Problem Understanding We are given two very large integers l and r as decimal strings and a base b where 2 ≤ b ≤ 10 . For every integer x in the inclusive range [l, r] , we consider its representation in base b . We want to count how...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3506 - Find Time Required to Eliminate Bacterial Strains

LeetCode Problem 3506 Difficulty: 🔴 Hard Topics: Array, Math, Greedy, Heap (Priority Queue) Solution Problem Understanding This problem asks us to find the minimum time required to eliminate all bacterial strains given a single initial white blood cell (WBC) and the ability of WBCs to split into two after some splitTime . Each bacterial strain has a specific time requirement timeReq[i] to be eliminated by a single WBC. The WBCs...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3505 - Minimum Operations to Make Elements Within K Subarrays Equal

LeetCode Problem 3505 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue) Solution Problem Understanding You are given an integer array nums , and you want to create at least k non-overlapping subarrays. Every chosen subarray must have length exactly x , and after performing some modifications, every element inside each chosen subarray must become equal. The only allowed operation is increasing or decreasing...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3468 - Find the Number of Copy Arrays

LeetCode Problem 3468 Difficulty: 🟡 Medium Topics: Array, Math Solution LeetCode 3468 - Find the Number of Copy Arrays Problem Understanding We are given an array original and a range constraint for every position in the form of bounds[i] = [ui, vi] . We need to count how many arrays copy satisfy two conditions. The first condition states that the difference between consecutive elements in copy must be exactly the...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3464 - Maximize the Distance Between Points on a Square

LeetCode Problem 3464 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Geometry, Sorting Solution LeetCode 3464 - Maximize the Distance Between Points on a Square Problem Understanding We are given a square of side length side . Every point in the input lies somewhere on the boundary of this square. We must choose exactly k points from the given set. For any two selected points, we can compute their Manhattan...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3495 - Minimum Operations to Make Array Elements Zero

LeetCode Problem 3495 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation Solution Problem Understanding The problem presents a sequence of queries, each defining a contiguous array of integers nums from l to r inclusive. For each array, we are allowed to perform an operation repeatedly: select any two integers a and b and replace them with floor(a / 4) and floor(b / 4) . The goal is to determine the...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3770 - Largest Prime from Consecutive Prime Sum

LeetCode Problem 3770 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution LeetCode 3770 - Largest Prime from Consecutive Prime Sum Problem Understanding The problem gives us an integer n and asks us to find the largest prime number that satisfies two conditions: It is less than or equal to n . It can be written as the sum of one or more consecutive prime numbers starting from 2 ....

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3762 - Minimum Operations to Equalize Subarrays

LeetCode Problem 3762 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Segment Tree Solution Problem Understanding We are given an array nums and a fixed integer k . A single operation allows us to choose any element and either increase it by exactly k or decrease it by exactly k . We may perform as many operations as needed. For each query [l, r] , we only consider the subarray...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3751 - Total Waviness of Numbers in Range I

LeetCode Problem 3751 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Enumeration Solution LeetCode 3751 - Total Waviness of Numbers in Range I Problem Understanding This problem asks us to compute the total waviness of every integer in an inclusive range [num1, num2] . For a single number, waviness is defined as the number of digits that are either peaks or valleys. A digit is a peak if it is strictly...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3726 - Remove Zeros in Decimal Representation

LeetCode Problem 3726 Difficulty: 🟢 Easy Topics: Math, Simulation Solution LeetCode 3726 - Remove Zeros in Decimal Representation Problem Understanding The problem gives us a positive integer n and asks us to remove every digit '0' from its decimal representation. After all zero digits have been removed, we must return the resulting value as an integer. In other words, we first view the number as a sequence of decimal digits....

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3723 - Maximize Sum of Squares of Digits

LeetCode Problem 3723 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to construct a positive integer n of exactly num digits such that the sum of its digits equals sum . Among all possible integers that satisfy these conditions (called good integers ), we must return the integer that maximizes the sum of the squares of its digits , which is called the score ....

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3715 - Sum of Perfect Square Ancestors

LeetCode Problem 3715 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theory Solution Problem Understanding This problem asks us to compute a sum across all non-root nodes in a tree based on ancestor relationships and the property of perfect squares. We are given a rooted tree of n nodes, represented as an edge list. Each node has a positive integer value from the nums array....

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3697 - Compute Decimal Representation

LeetCode Problem 3697 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding This problem asks us to decompose a positive integer n into the fewest possible base-10 components , where a base-10 component is defined as a single digit (1-9) multiplied by a power of 10. Essentially, we are breaking n down into its decimal place contributions . For example, for n = 537 , the hundreds place contributes 500,...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3677 - Count Binary Palindromic Numbers

LeetCode Problem 3677 Difficulty: 🔴 Hard Topics: Math, Bit Manipulation Solution Problem Understanding We are given a non-negative integer n and asked to count how many integers k in the range [0, n] have a binary representation that is a palindrome when written without leading zeros. A binary palindrome means that if you take the binary string of a number and read it from left to right or right to...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3680 - Generate Schedule

LeetCode Problem 3680 Difficulty: 🟡 Medium Topics: Array, Math, Greedy Solution Problem Understanding The problem is asking us to generate a round-robin style schedule for n teams, where each team plays every other team exactly twice, once at home and once away. Each day in the schedule can host exactly one match, and a team is not allowed to play on consecutive days. The input is simply an integer n...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3667 - Sort Array By Absolute Value

LeetCode Problem 3667 Difficulty: 🟢 Easy Topics: Array, Math, Two Pointers, Sorting Solution Problem Understanding The problem asks us to reorder an integer array such that the elements are sorted in non-decreasing order of their absolute values . This means we are not sorting based on the actual numeric value, but rather based on how far each number is from zero on the number line, regardless of sign. In simpler...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3663 - Find The Least Frequent Digit

LeetCode Problem 3663 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Counting Solution Problem Understanding The problem asks us to find the least frequent digit in the decimal representation of a given integer n . In other words, we need to count how many times each digit from 0 to 9 appears in the number, and then return the smallest digit that occurs the fewest times. The input is a...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3658 - GCD of Odd and Even Sums

LeetCode Problem 3658 Difficulty: 🟢 Easy Topics: Math, Number Theory Solution Problem Understanding The problem asks us to calculate the greatest common divisor (GCD) of two specific sums derived from an integer input n . The first sum, sumOdd , is the sum of the first n positive odd numbers, and the second sum, sumEven , is the sum of the first n positive even numbers. The input n is...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3648 - Minimum Sensors to Cover Grid

LeetCode Problem 3648 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem gives an n × m grid where each cell is identified by coordinates (r, c) . A sensor can be placed on any cell, and its coverage is defined using Chebyshev distance. Specifically, a sensor at (r, c) covers every cell (r2, c2) such that max(|r - r2|, |c - c2|) ≤ k . This means each...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3630 - Partition Array for Maximum XOR and AND

LeetCode Problem 3630 Difficulty: 🔴 Hard Topics: Array, Math, Greedy, Bit Manipulation, Enumeration Solution Problem Understanding The problem asks us to partition an integer array nums into three subsequences A , B , and C such that every element belongs to exactly one subsequence. The goal is to maximize the sum XOR(A) + AND(B) + XOR(C) , where XOR and AND represent the bitwise XOR and AND of the elements...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3625 - Count Number of Trapezoids II

LeetCode Problem 3625 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Geometry Solution Problem Understanding The problem asks us to count the number of unique trapezoids that can be formed from a set of points on a 2D Cartesian plane. Each point is given as a pair of integers representing its x and y coordinates. A trapezoid is defined as a convex quadrilateral with at least one pair of parallel...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3622 - Check Divisibility by Digit Sum and Product

LeetCode Problem 3622 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine if a given positive integer n is divisible by the sum of two specific quantities derived from its digits: the digit sum and the digit product . The digit sum is obtained by adding all the digits of n , and the digit product is obtained by multiplying all the digits of n...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3618 - Split Array by Prime Indices

LeetCode Problem 3618 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution LeetCode 3618 - Split Array by Prime Indices Problem Understanding The problem gives us an integer array nums and asks us to divide its elements into two groups based on their indices. Array A contains all elements whose indices are prime numbers. Array B contains all remaining elements, meaning indices that are not prime. Remember that array indices...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3605 - Minimum Stability Factor of Array

LeetCode Problem 3605 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Greedy, Segment Tree, Number Theory Solution LeetCode 3605 - Minimum Stability Factor of Array Problem Understanding We are given an array nums and an integer maxC . A subarray is called stable if the greatest common divisor (HCF/GCD) of all elements in that subarray is at least 2 . The stability factor of the entire array is defined as...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3596 - Minimum Cost Path with Alternating Directions I

LeetCode Problem 3596 Difficulty: 🟡 Medium Topics: Math, Brainteaser Solution Problem Understanding This problem requires computing the minimum total cost to traverse a grid from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) while following a strict alternating movement pattern. Each cell (i, j) has a cost to enter, calculated as (i + 1) * (j + 1) . Movement is constrained by...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3591 - Check if Any Element Has Prime Frequency

LeetCode Problem 3591 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Counting, Number Theory Solution Problem Understanding This problem asks us to determine whether any number in an array appears a prime number of times. In other words, for each unique number in the input array nums , we calculate its frequency-the number of occurrences-and check if that frequency is a prime number. If at least one element has a...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3589 - Count Prime-Gap Balanced Subarrays

LeetCode Problem 3589 Difficulty: 🟡 Medium Topics: Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue Solution Count Prime-Gap Balanced Subarrays Problem Understanding We are given an integer array nums and an integer k . We must count how many contiguous subarrays satisfy two conditions: The subarray contains at least two prime numbers. Among all prime numbers inside that subarray, the difference between the largest prime and the smallest prime...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3588 - Find Maximum Area of a Triangle

LeetCode Problem 3588 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Greedy, Geometry, Enumeration Solution LeetCode 3588 - Find Maximum Area of a Triangle Problem Understanding We are given n distinct points on a 2D Cartesian plane. Each point is represented as [x, y] . We must choose any three points that form a non-degenerate triangle, meaning the area must be strictly greater than zero. Among all valid triangles, we...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3577 - Count the Number of Computer Unlocking Permutations

LeetCode Problem 3577 Difficulty: 🟡 Medium Topics: Array, Math, Brainteaser, Combinatorics Solution Problem Understanding The problem presents a set of n computers, each with a unique password complexity represented in an array complexity of length n . The computers are labeled 0 to n - 1 , and only computer 0 is initially unlocked. To unlock another computer i , you must already have unlocked at least one computer j...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3574 - Maximize Subarray GCD Score

LeetCode Problem 3574 Difficulty: 🔴 Hard Topics: Array, Math, Enumeration, Number Theory Solution Problem Understanding The problem asks us to choose a contiguous subarray from an array of positive integers after performing at most k doubling operations, where each element can be doubled at most once. After applying these optional doublings, we compute the score of a subarray as the product of its length and the greatest common divisor (GCD)...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3560 - Find Minimum Log Transportation Cost

LeetCode Problem 3560 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to transport two logs of lengths n and m using three trucks, where each truck can carry a log of length at most k . If a log is longer than k , it must be cut into smaller pieces. Cutting a log of length x into two pieces of lengths len1 and len2 incurs...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3559 - Number of Ways to Assign Edge Weights II

LeetCode Problem 3559 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search Solution Problem Understanding We are given an undirected tree with n nodes, rooted at node 1 . Every edge will eventually receive a weight of either 1 or 2 . For each query [u, v] , we only care about the unique path connecting u and v . All edges outside that path are...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3549 - Multiply Two Polynomials

LeetCode Problem 3549 Difficulty: 🔴 Hard Topics: Array, Math Solution Problem Understanding The input arrays represent polynomials in coefficient form. If: poly1 = [a0, a1, a2, ...] then it represents: A(x) = a0 + a1x + a2x² + ... Similarly: poly2 = [b0, b1, b2, ...] represents: B(x) = b0 + b1x + b2x² + ... The task is to compute the product polynomial: R(x) = A(x) × B(x) and...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3547 - Maximum Sum of Edge Values in a Graph

LeetCode Problem 3547 Difficulty: 🔴 Hard Topics: Math, Greedy, Graph Theory Solution Problem Understanding The graph is undirected, connected, and every node has degree at most 2. A connected graph where every node has degree at most 2 can only have one of two shapes: A simple path, containing exactly n - 1 edges. A simple cycle, containing exactly n edges. We must assign the numbers 1 through n to...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3535 - Unit Conversion II

LeetCode Problem 3535 Difficulty: 🟡 Medium Topics: Array, Math, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The input describes a collection of unit conversion relationships. Each conversion is given as: source -> target with factor f meaning: 1 unit of source = f units of target The important observation is that there are exactly n - 1 conversion edges among n units, and the statement guarantees that unit...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3536 - Maximum Product of Two Digits

LeetCode Problem 3536 Difficulty: 🟢 Easy Topics: Math, Sorting Solution LeetCode 3536 - Maximum Product of Two Digits Problem Understanding The problem gives us a positive integer n and asks us to find the maximum product that can be formed by multiplying any two digits that appear in the number. The input is a single integer. We must examine all of its digits and determine which pair of digits produces...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3525 - Find X Value of Array II

LeetCode Problem 3525 Difficulty: 🔴 Hard Topics: Array, Math, Segment Tree Solution Problem Understanding For each query, two things happen in order. First, we permanently update one element of nums : nums[index] = value This modification remains in effect for all future queries. Second, we conceptually remove the prefix nums[0..start-1] . After this removal, we are left with the suffix: nums[start..n-1] Now we must count how many ways we can...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3524 - Find X Value of Array I

LeetCode Problem 3524 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution LeetCode 3524 - Find X Value of Array I Problem Understanding The operation described in the problem may initially look unusual, but it is actually equivalent to choosing a non-empty contiguous subarray. When we remove a prefix and a suffix that do not overlap, the elements left behind form a contiguous segment of the original array. Conversely, every...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3518 - Smallest Palindromic Rearrangement II

LeetCode Problem 3518 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Combinatorics, Counting Solution Problem Understanding We are given a string s that is guaranteed to already be a palindrome. We may rearrange its characters, but the final rearranged string must also be a palindrome. Among all distinct palindromic permutations that can be formed from the characters of s , we must return the k -th lexicographically smallest one. If...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3514 - Number of Unique XOR Triplets II

LeetCode Problem 3514 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation, Enumeration Solution LeetCode 3514 - Number of Unique XOR Triplets II Problem Understanding We are given an integer array nums , and we must consider every triplet of indices (i, j, k) such that i <= j <= k . For each valid triplet, we compute: $$nums[i] \oplus nums[j] \oplus nums[k]$$ where ⊕ denotes the bitwise XOR operation. The...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3513 - Number of Unique XOR Triplets I

LeetCode Problem 3513 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation Solution Problem Understanding The problem asks us to determine the number of unique values that can result from taking the XOR of three elements in a given array nums , where the triplets (i, j, k) must satisfy i <= j <= k . Importantly, nums is a permutation of integers from 1 to n , meaning every integer...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3516 - Find Closest Person

LeetCode Problem 3516 Difficulty: 🟢 Easy Topics: Math Solution LeetCode 3516 - Find Closest Person Problem Understanding This problem gives us three integers, x , y , and z , representing the positions of three people on a one-dimensional number line. Person 1 starts at position x , Person 2 starts at position y , and Person 3 remains stationary at position z . Both Person 1 and Person 2...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3512 - Minimum Operations to Make Array Sum Divisible by K

LeetCode Problem 3512 Difficulty: 🟢 Easy Topics: Array, Math Solution LeetCode 3512 - Minimum Operations to Make Array Sum Divisible by K Problem Understanding The problem gives us an integer array nums and an integer k . We are allowed to repeatedly perform one operation: choose any index i and decrease nums[i] by exactly 1 . Our goal is to determine the minimum number of such operations needed so that...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3492 - Maximum Containers on a Ship

LeetCode Problem 3492 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding This problem describes a cargo ship with an n × n deck. Since each cell on the deck can hold exactly one container, the deck has a total capacity of: $$n^2$$ physical container positions. Every container has the same weight, w . The ship also has a maximum total weight limit, maxWeight . Even if the deck has enough...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3461 - Check If Digits Are Equal in String After Operations I

LeetCode Problem 3461 Difficulty: 🟢 Easy Topics: Math, String, Simulation, Combinatorics, Number Theory Solution Problem Understanding This problem asks us to repeatedly transform a string of digits by summing consecutive pairs modulo 10, until only two digits remain, and then check whether those two digits are equal. In other words, we start with a string s of length at least 3 and, at each step, generate a new string where...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3470 - Permutations IV

LeetCode Problem 3470 Difficulty: 🔴 Hard Topics: Array, Math, Combinatorics, Enumeration Solution LeetCode 3470 - Permutations IV Problem Understanding We are given two integers, n and k . We must consider all permutations of the numbers 1 through n that satisfy an alternating parity condition. In a valid permutation, every pair of adjacent elements must have different parity. In other words: Odd must be followed by even. Even must be...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3463 - Check If Digits Are Equal in String After Operations II

LeetCode Problem 3463 Difficulty: 🔴 Hard Topics: Math, String, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to repeatedly transform a string of digits until only two digits remain, and then check if those two digits are the same. The transformation involves taking each consecutive pair of digits, summing them, and taking the result modulo 10 to form a new digit. This process is applied repeatedly, replacing the...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3444 - Minimum Increments for Target Multiples in an Array

LeetCode Problem 3444 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask Solution LeetCode 3444 - Minimum Increments for Target Multiples in an Array Problem Understanding We are given two arrays: nums , the array whose elements we are allowed to increase. target , a small array containing values that must each be represented by at least one multiple somewhere in the final version of nums...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3433 - Count Mentions Per User

LeetCode Problem 3433 Difficulty: 🟡 Medium Topics: Array, Math, Sorting, Simulation Solution LeetCode 3433 - Count Mentions Per User Problem Understanding This problem asks us to simulate a sequence of user activity events and count how many times each user is mentioned across all message events. We are given: numberOfUsers , the total number of users with IDs from 0 to numberOfUsers - 1 events , where each event is...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3428 - Maximum and Minimum Sums of at Most Size K Subsequences

LeetCode Problem 3428 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Sorting, Combinatorics Solution Problem Understanding We are given an array nums and an integer k . For every subsequence whose size is at most k , we look at two values: The minimum element in that subsequence. The maximum element in that subsequence. We add minimum + maximum for every valid subsequence, then return the total modulo 10^9 +...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3422 - Minimum Operations to Make Subarray Elements Equal

LeetCode Problem 3422 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Sliding Window, Heap (Priority Queue) Solution LeetCode 3422 - Minimum Operations to Make Subarray Elements Equal Problem Understanding We are given an array nums and an integer k . In a single operation, we may increase or decrease any element by exactly 1 . Our goal is not to make the entire array equal. Instead, we only need at...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3416 - Subsequences with a Unique Middle Mode II

LeetCode Problem 3416 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Combinatorics Solution Problem Understanding We are given an array nums , and we must count how many subsequences of length exactly 5 have a very specific property. For any chosen subsequence $$[a,b,c,d,e]$$ the middle element is c , because it is the third element of a length-5 sequence. The subsequence is valid if: c is a mode of the...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3411 - Maximum Subarray With Equal Products

LeetCode Problem 3411 Difficulty: 🟢 Easy Topics: Array, Math, Sliding Window, Enumeration, Number Theory Solution LeetCode 3411 - Maximum Subarray With Equal Products Problem Understanding We are given an array nums consisting of positive integers. For any array arr , define: prod(arr) as the product of all elements. gcd(arr) as the greatest common divisor of all elements. lcm(arr) as the least common multiple of all elements. A subarray is called...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3360 - Stone Removal Game

LeetCode Problem 3360 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding In this game, Alice and Bob take turns removing stones from a pile. The rules are very strict because the number of stones removed on each turn is predetermined. Alice always goes first and must remove exactly 10 stones on her first move. After that, each move removes exactly 1 fewer stone than the previous move. This means...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3335 - Total Characters in String After Transformations I

LeetCode Problem 3335 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Dynamic Programming, Counting Solution Problem Understanding The problem gives us a string s and an integer t . We repeatedly apply a transformation exactly t times. During one transformation: Every character from 'a' to 'y' becomes the next character in the alphabet. The character 'z' becomes the string "ab" . After all transformations are complete, we must return the...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3270 - Find the Key of the Numbers

LeetCode Problem 3270 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem gives us three positive integers, num1 , num2 , and num3 . We must construct a new number called the key using the digits of these three numbers. The important detail is that every number must first be treated as a four digit number. If a number has fewer than four digits, we pad it with leading...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3260 - Find the Largest Palindrome Divisible by K

LeetCode Problem 3260 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming, Greedy, Number Theory Solution LeetCode 3260 - Find the Largest Palindrome Divisible by K Problem Understanding The problem asks us to construct the largest possible palindrome with exactly n digits such that the resulting number is divisible by k . A palindrome is a number that reads the same forward and backward. For example, 595 , 1221 , and...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2999 - Count the Number of Powerful Integers

LeetCode Problem 2999 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming Solution Problem Understanding The problem asks us to count all integers within a given range [start, finish] that satisfy two conditions. First, the integer must end with a specific string s , meaning s is a suffix of the number. Second, each digit in the integer cannot exceed a given limit . For example, if limit is 4 ,...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2527 - Find Xor-Beauty of Array

LeetCode Problem 2527 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation Solution Problem Understanding The problem defines a special value called the "effective value" for every possible triplet of indices (i, j, k) in the array: $$((nums[i] \mid nums[j]) & nums[k])$$ where: | is the bitwise OR operator & is the bitwise AND operator The xor-beauty of the array is the XOR of the effective values for all possible triplets....

Practice › Codeforces Solutions ›

Codeforces Round 261 (Div. 2)

Codeforces Round 261 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1200-1900 | Time: 8m 37s Problem Name Rating Tags Solve Time Verified A Pashmak and Garden 1200 implementation 1m 3s ✓ B Pashmak and Flowers 1300 combinatorics, implementation, sortings 1m 31s ✓ C Pashmak and Buses 1900 combinatorics, constructive-algorithms, math 1m 59s ✗ D Pashmak and Parmida's problem 1800 data-structures, divide-and-conquer, sortings 2m...

Practice › Codeforces Solutions ›

Codeforces Round 262 (Div. 2)

Codeforces Round 262 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 900-2700 | Time: 6m 14s Problem Name Rating Tags Solve Time Verified A Vasya and Socks 900 brute-force, implementation, math 1m 32s ✓ B Little Dima and Equation 1500 brute-force, implementation, math 1m 6s ✓ C Present 1700 binary-search, data-structures, greedy 1m ✓ D Little Victor and Set 2300 brute-force, constructive-algorithms, math 1m...

Practice › Codeforces Solutions › Codeforces Round 272 (Div. 2) ›

CF 476A - Dreamoon and Stairs

CF 476A - Dreamoon and Stairs Rating: 1000 Tags: implementation, math Solve time: 1m 32s Verified: yes Solution Problem Understanding Dreamoon wants to reach the top of a staircase containing n steps. Every move can cover either 1 step or 2 steps. Among all possible ways to reach exactly step n , we need the number of moves used to be divisible by m . The task is not asking...

Practice › Codeforces Solutions › Codeforces Round 270 ›

CF 472A - Design Tutorial: Learn from Math

CF 472A - Design Tutorial: Learn from Math Rating: 800 Tags: math, number theory Solve time: 1m 22s Verified: yes Solution Problem Understanding We are given a single integer n , where n ≥ 12 . The task is to find any two composite numbers whose sum is exactly n . A composite number is an integer greater than 1 that has at least one divisor other than 1 and...

Practice › Codeforces Solutions › Codeforces Round 262 (Div. 2) ›

CF 460A - Vasya and Socks

CF 460A - Vasya and Socks Rating: 900 Tags: brute force, implementation, math Solve time: 1m 32s Verified: yes Solution Problem Understanding Vasya starts with a certain number of sock pairs. Every morning he uses exactly one pair, and that pair is gone forever at the end of the day. There is one special event: after every day whose number is a multiple of m , his mother buys him...

Practice › Codeforces Solutions ›

MemSQL Start[c]UP 2.0 - Round 2

MemSQL Start[c]UP 2.0 - Round 2 Type: Special | Problems: 6 | Verified: 4/6 | Rating range: 1700-3200 | Time: 11m 5s Problem Name Rating Tags Solve Time Verified A Golden System 1700 math, meet-in-the-middle 1m 15s ✓ B Distributed Join 1900 greedy 1m 7s ✓ C Elections 2100 brute-force 1m 25s ✓ D Bingo! 2700 combinatorics, math, probabilities 1m 42s ✓ E Flow Optimality 3000 constructive-algorithms, flows, math 1m...

Practice › Codeforces Solutions › Codeforces Round 262 (Div. 2) ›

CF 460D - Little Victor and Set

CF 460D - Little Victor and Set Rating: 2300 Tags: brute force, constructive algorithms, math Solve time: 1m 21s Verified: no Solution Problem Understanding Victor wants to build a set of integers within a specified range such that the XOR of all its elements is minimized. The set can contain up to k elements, all distinct, and every element must lie between l and r inclusive. The input consists of...

Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463E - Caisa and Tree

CF 463E - Caisa and Tree Rating: 2100 Tags: brute force, dfs and similar, math, number theory, trees Solve time: 47s Verified: yes Solution Problem Understanding We are given a rooted tree with n nodes, each node assigned a positive integer value. Node 1 is the root. Queries ask either to find the deepest ancestor of a node v whose value shares a non-trivial greatest common divisor with v ,...

Practice › Codeforces Solutions ›

Codeforces Round 260 (Div. 2)

Codeforces Round 260 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1100-1200 | Time: 2m 34s Problem Name Rating Tags Solve Time Verified A Laptops 1100 sortings 1m 28s ✓ B Fedya and Maths 1200 math, number-theory 1m 6s ✓

Practice › Codeforces Solutions ›

Codeforces Round 257 (Div. 1)

Codeforces Round 257 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1700-2900 | Time: 9m 38s Problem Name Rating Tags Solve Time Verified A Jzzhu and Chocolate 1700 greedy, math 2m 1s ✓ B Jzzhu and Cities 2000 graphs, greedy, shortest-paths 1m 26s ✓ C Jzzhu and Apples 2500 constructive-algorithms, number-theory 1m 44s ✗ D Jzzhu and Numbers 2400 bitmasks, combinatorics, dp 1m 54s...

Practice › Codeforces Solutions › Codeforces Round 257 (Div. 2) ›

CF 450B - Jzzhu and Sequences

CF 450B - Jzzhu and Sequences Rating: 1300 Tags: implementation, math Solve time: 51s Verified: yes Solution Problem Understanding The problem defines a linear sequence $f_n$ with two initial values $x = f_1$ and $y = f_2$, and a recurrence that repeats every six terms: $f_{n} = f_{n-1} - f_{n-2}$. Effectively, this creates a sequence with the following cycle: $f_1 = x$ $f_2 = y$ $f_3 = y - x$...

Practice › Codeforces Solutions › Codeforces Round 273 (Div. 2) ›

CF 478B - Random Teams

CF 478B - Random Teams Rating: 1300 Tags: combinatorics, constructive algorithms, greedy, math Solve time: 1m 12s Verified: yes Solution Problem Understanding We are given a set of $n$ people who must be partitioned into exactly $m$ non-empty groups. Once the grouping is fixed, every pair of people inside the same group becomes a friendship. A group of size $k$ contributes $\frac{k(k-1)}{2}$ friendships, so the total number of friendships is...

Practice › Codeforces Solutions › Codeforces Round 272 (Div. 2) ›

CF 476C - Dreamoon and Sums

CF 476C - Dreamoon and Sums Rating: 1600 Tags: math Solve time: 1m 19s Verified: yes Solution Problem Understanding We are asked to calculate the sum of all integers $x$ that satisfy a pair of modular conditions with respect to two given integers $a$ and $b$. Specifically, a positive integer $x$ is considered nice if there exists some $k$ between 1 and $a$ such that dividing $x$ by $k$ yields...

Practice › Codeforces Solutions › Codeforces Round 268 (Div. 1) ›

CF 468A - 24 Game

CF 468A - 24 Game Rating: 1500 Tags: constructive algorithms, greedy, math Solve time: 1m 19s Verified: yes Solution Problem Understanding The problem gives you the first n positive integers, arranged as a sequence 1 through n . You are allowed to combine any two numbers from this sequence using addition, subtraction, or multiplication, replacing the pair with the result. After repeating this operation n −1 times, only a single...

Practice › Codeforces Solutions ›

Codeforces Round 258 (Div. 2)

Codeforces Round 258 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 900-2300 | Time: 8m 33s Problem Name Rating Tags Solve Time Verified A Game With Sticks 900 implementation 1m 19s ✓ B Sort the Array 1300 implementation, sortings 1m 39s ✓ C Predict Outcome of the Game 1700 brute-force, implementation, math 1m 55s ✓ D Count Good Substrings 2000 math 2m 3s ✓...

Practice › Codeforces Solutions › Codeforces Round 262 (Div. 2) ›

CF 460B - Little Dima and Equation

CF 460B - Little Dima and Equation Rating: 1500 Tags: brute force, implementation, math, number theory Solve time: 1m 6s Verified: yes Solution Problem Understanding The task asks us to find all positive integers less than one billion that satisfy the equation $$x = b \cdot s(x) \cdot a + c$$ where $a$, $b$, and $c$ are given constants, and $s(x)$ is the sum of the digits of $x$. The...

Practice › Codeforces Solutions › Codeforces Round 261 (Div. 2) ›

CF 459C - Pashmak and Buses

CF 459C - Pashmak and Buses Rating: 1900 Tags: combinatorics, constructive algorithms, math Solve time: 1m 59s Verified: no Solution Problem Understanding We need to assign each student to one of k buses on each of d days. For every student, we can think of their assignment as a sequence of length d . For example, if d = 3 , a student might ride buses (2, 1, 2) over...

Practice › Codeforces Solutions ›

Codeforces Round 257 (Div. 2)

Codeforces Round 257 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1300 | Time: 2m 25s Problem Name Rating Tags Solve Time Verified A Jzzhu and Children 1000 implementation 1m 34s ✓ B Jzzhu and Sequences 1300 implementation, math 51s ✓

Practice › Codeforces Solutions ›

Codeforces Round 272 (Div. 2)

Codeforces Round 272 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1000-2200 | Time: 12m 19s Problem Name Rating Tags Solve Time Verified A Dreamoon and Stairs 1000 implementation, math 1m 32s ✓ B Dreamoon and WiFi 1300 bitmasks, brute-force, combinatorics 1m 35s ✓ C Dreamoon and Sums 1600 math 1m 19s ✓ D Dreamoon and Sets 1900 constructive-algorithms, greedy, math 2m 8s ✓...

Practice › Codeforces Solutions › Codeforces Round 258 (Div. 2) ›

CF 451D - Count Good Substrings

CF 451D - Count Good Substrings Rating: 2000 Tags: math Solve time: 2m 3s Verified: yes Solution Problem Understanding We are given a binary string consisting only of 'a' and 'b' . For every substring, we repeatedly merge consecutive equal characters into a single character. For example: "aaaa" becomes "a" "aabbaa" becomes "aba" "abbba" becomes "aba" A substring is called good if the compressed string obtained after these merges is...

Practice › Codeforces Solutions › Codeforces Round 269 (Div. 2) ›

CF 471C - MUH and House of Cards

CF 471C - MUH and House of Cards Rating: 1700 Tags: binary search, brute force, greedy, math Solve time: 1m 42s Verified: yes Solution Problem Understanding A house of cards is built from floors. If a floor contains k rooms, then each room uses two leaning cards, so the rooms themselves consume 2k cards. Between adjacent rooms and above the outermost rooms there is a ceiling made of horizontal cards....

Practice › Codeforces Solutions ›

Codeforces Round 273 (Div. 2)

Codeforces Round 273 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1100-2900 | Time: 6m Problem Name Rating Tags Solve Time Verified A Initial Bet 1100 implementation 59s ✓ B Random Teams 1300 combinatorics, constructive-algorithms, greedy 1m 12s ✓ C Table Decorations 1800 greedy 1m 9s ✓ D Red-Green Towers 2000 dp 1m 3s ✓ E Wavy numbers 2900 brute-force, dfs-and-similar, meet-in-the-middle 1m 37s...

Practice › Codeforces Solutions › Codeforces Round 258 (Div. 2) ›

CF 451C - Predict Outcome of the Game

CF 451C - Predict Outcome of the Game Rating: 1700 Tags: brute force, implementation, math Solve time: 1m 55s Verified: yes Solution Problem Understanding We have a football tournament involving three teams. Every game produces exactly one winner, so each played game contributes exactly one win to one of the teams. After k games have already been played, we do not know the exact number of wins of the three...

Practice › Codeforces Solutions ›

Codeforces Round 270

Codeforces Round 270 Type: Special | Problems: 7 | Verified: 5/7 | Rating range: 800-2800 | Time: 12m 18s Problem Name Rating Tags Solve Time Verified A Design Tutorial: Learn from Math 800 math, number-theory 1m 22s ✓ B Design Tutorial: Learn from Life 1300 - 1m 44s ✓ C Design Tutorial: Make It Nondeterministic 1400 greedy 1m 16s ✓ D Design Tutorial: Inverse the Problem 1900 dfs-and-similar, dsu, shortest-paths...

Practice › Codeforces Solutions › Codeforces Round 271 (Div. 2) ›

CF 474F - Ant colony

CF 474F - Ant colony Rating: 2100 Tags: data structures, math, number theory Solve time: 1m 36s Verified: yes Solution Problem Understanding We are given a line of ants, each with an integer strength. Mole wants to observe fights among ants in specified contiguous segments of the line. For a given segment from position l to r , every ant fights every other ant within that segment. An ant earns...

Practice › Codeforces Solutions › Codeforces Round 270 ›

CF 472F - Design Tutorial: Change the Goal

CF 472F - Design Tutorial: Change the Goal Rating: 2700 Tags: constructive algorithms, math, matrices Solve time: 1m 27s Verified: no Solution Problem Understanding We are given two arrays of integers, x and y , each of length n . The array x is the starting state, and y is the desired target state. The only operation allowed is x[i] ^= x[j] , which replaces x[i] with the bitwise XOR...

Practice › Codeforces Solutions › Codeforces Round 262 (Div. 2) ›

CF 460E - Roland and Rose

CF 460E - Roland and Rose Rating: 2700 Tags: brute force, geometry, math, sortings Solve time: 1m 15s Verified: yes Solution Problem Understanding Roland wants to place n watch towers on a 2D integer grid around a rose at the origin so that the sum of squared distances between all pairs of towers is maximized. Each tower must lie within or on a circle of radius r centered at (0,0)....

Practice › Codeforces Solutions ›

Codeforces Round 269 (Div. 2)

Codeforces Round 269 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1100-2700 | Time: 8m 43s Problem Name Rating Tags Solve Time Verified A MUH and Sticks 1100 implementation 1m 21s ✓ B MUH and Important Things 1300 implementation, sortings 1m 41s ✗ C MUH and House of Cards 1700 binary-search, brute-force, greedy 1m 42s ✓ D MUH and Cube Walls 1800 string-suffix-structures, strings...

Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463B - Caisa and Pylons

CF 463B - Caisa and Pylons Rating: 1100 Tags: brute force, implementation, math Solve time: 59s Verified: yes Solution Problem Understanding We are given a sequence of pylons arranged in a line, starting from position 0 up to position n. The first pylon is fixed at height 0, and every other pylon has a given height. A player starts at pylon 0 with zero energy and moves strictly forward, one...

Practice › Codeforces Solutions ›

Codeforces Round 274 (Div. 2)

Codeforces Round 274 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1000-1900 | Time: 19m 33s Problem Name Rating Tags Solve Time Verified A Expression 1000 brute-force, math 5m 21s ✗ B Towers 1400 brute-force, constructive-algorithms, greedy 1m 3s ✓ C Exams 1400 greedy, sortings 10m 58s ✗ D Long Jumps 1700 binary-search, greedy, implementation 1m 9s ✓ E Riding in a Lift 1900...

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475D - CGCDSSQ

CF 475D - CGCDSSQ Rating: 2000 Tags: brute force, data structures, math Solve time: 1m 11s Verified: yes Solution Problem Understanding We are given a list of integers and a set of queries. Each query asks how many contiguous subarrays of the list have a greatest common divisor equal to the query value. In simpler terms, for each number in the queries, we want to know how many stretches of...

Practice › Codeforces Solutions › Codeforces Round 257 (Div. 1) ›

CF 449E - Jzzhu and Squares

CF 449E - Jzzhu and Squares Rating: 2900 Tags: dp, math, number theory Solve time: 2m 33s Verified: no Solution Problem Understanding We have all lattice points inside a rectangle of size $n \times m$. Any square whose four vertices are lattice points is allowed, even if it is rotated. For every such square, we look at the unit grid cells completely contained inside it. Each contained unit cell receives...

Practice › Codeforces Solutions › Codeforces Round 274 (Div. 2) ›

CF 479A - Expression

CF 479A - Expression Rating: 1000 Tags: brute force, math Solve time: 5m 21s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 268 (Div. 1) ›

CF 468E - Permanent

CF 468E - Permanent Rating: 3100 Tags: dp, graph matchings, math, meet-in-the-middle Solve time: 1m 49s Verified: no Solution Problem Understanding We are asked to compute the permanent of a large square matrix where almost every element is 1, and only a small number of entries are different. The permanent is similar to a determinant but without alternating signs: it is the sum over all permutations of the product of...

Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457D - Bingo!

CF 457D - Bingo! Rating: 2700 Tags: combinatorics, math, probabilities Solve time: 1m 42s Verified: yes Solution Problem Understanding We have an $n \times n$ bingo board. Every cell contains a distinct number chosen from $1$ to $m$, and every valid board is equally likely. After the board is generated, exactly $k$ distinct numbers are called. Every set of $k$ numbers is equally likely. A cell becomes marked if its...

Practice › Codeforces Solutions › Codeforces Round 272 (Div. 2) ›

CF 476D - Dreamoon and Sets

CF 476D - Dreamoon and Sets Rating: 1900 Tags: constructive algorithms, greedy, math Solve time: 2m 8s Verified: yes Solution Problem Understanding The task is to construct n sets of four distinct positive integers, where each set has a certain "rank" k . The rank condition requires that the greatest common divisor (GCD) of any two numbers within the set equals exactly k . We are allowed to use integers...

Practice › Codeforces Solutions › Codeforces Round 263 (Div. 1) ›

CF 461D - Appleman and Complicated Task

CF 461D - Appleman and Complicated Task Rating: 2800 Tags: dsu, math Solve time: 1m 2s Verified: yes Solution Problem Understanding We are given an $n \times n$ grid that is mostly empty, except for a small number of cells that are already fixed as either x or o . Every other cell must be filled with one of these two characters. After filling the grid, we impose a local...

Practice › Codeforces Solutions › Codeforces Round 260 (Div. 2) ›

CF 456B - Fedya and Maths

CF 456B - Fedya and Maths Rating: 1200 Tags: math, number theory Solve time: 1m 6s Verified: yes Solution Problem Understanding The task asks for the remainder when the sum of the first four multiples of a very large number n is divided by 5. In other words, you need to compute (1*n + 2*n + 3*n + 4*n) mod 5 . The input n is a single integer that...

Practice › Codeforces Solutions ›

Codeforces Round 268 (Div. 1)

Codeforces Round 268 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1500-3100 | Time: 8m 30s Problem Name Rating Tags Solve Time Verified A 24 Game 1500 constructive-algorithms, greedy, math 1m 19s ✓ B Two Sets 2000 2-sat, dfs-and-similar, dsu 2m 32s ✓ C Hack it! 2500 binary-search, constructive-algorithms, math 1m 18s ✓ D Tree 3100 graph-matchings 1m 32s ✗ E Permanent 3100 dp,...

Practice › Codeforces Solutions ›

Codeforces Round 266 (Div. 2)

Codeforces Round 266 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1200-2100 | Time: 6m 29s Problem Name Rating Tags Solve Time Verified A Cheap Travel 1200 implementation 54s ✓ B Wonder Room 2000 brute-force, math 1m 22s ✓ C Number of Ways 1700 binary-search, brute-force, data-structures 1m 18s ✓ D Increase Sequence 2100 combinatorics, dp 1m 14s ✗ E Information Graph 2100 dfs-and-similar,...

Practice › Codeforces Solutions › Codeforces Round 272 (Div. 2) ›

CF 476B - Dreamoon and WiFi

CF 476B - Dreamoon and WiFi Rating: 1300 Tags: bitmasks, brute force, combinatorics, dp, math, probabilities Solve time: 1m 35s Verified: yes Solution Problem Understanding Drazil sends a sequence of movement commands. Each '+' moves Dreamoon one step to the right and each '-' moves one step to the left. We know the original command string and also the string that Dreamoon receives. The received string may contain '?' characters,...

Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457E - Flow Optimality

CF 457E - Flow Optimality Rating: 3000 Tags: constructive algorithms, flows, math Solve time: 1m 13s Verified: no Solution Problem Understanding We are given a network of nodes connected by links, where each link can carry data in one direction at a time. Each link has a cost proportional to the square of the bandwidth multiplied by a given weight. Some links already have assigned bandwidths, representing the intern’s proposed...

Practice › Codeforces Solutions › Codeforces Round 268 (Div. 1) ›

CF 468C - Hack it!

CF 468C - Hack it! Rating: 2500 Tags: binary search, constructive algorithms, math Solve time: 1m 18s Verified: yes Solution Problem Understanding The task revolves around finding two integers, l and r , such that the sum of all digits from l to r modulo a given number a produces an edge case for a buggy implementation. The function f(x) denotes the sum of the decimal digits of x ....

Practice › Codeforces Solutions ›

Codeforces Round 264 (Div. 2)

Codeforces Round 264 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1100-2100 | Time: 4m 50s Problem Name Rating Tags Solve Time Verified A Caisa and Sugar 1200 brute-force, implementation 1m ✓ B Caisa and Pylons 1100 brute-force, implementation, math 59s ✓ C Gargari and Bishops 1900 greedy, hashing, implementation 1m 6s ✓ D Gargari and Permutations 1900 dfs-and-similar, dp, graphs 58s ✓ E...

Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452C - Magic Trick

CF 452C - Magic Trick Rating: 2100 Tags: combinatorics, math, probabilities Solve time: 1m 44s Verified: yes Solution Problem Understanding There are $m$ complete decks, each containing the same $n$ card values. After mixing all decks together, there are $mn$ physical cards in total, and every value appears exactly $m$ times. Alex randomly takes $n$ cards from this large pile and uses them as the working deck for the trick....

Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457A - Golden System

CF 457A - Golden System Rating: 1700 Tags: math, meet-in-the-middle Solve time: 1m 15s Verified: yes Solution Problem Understanding In this problem, we are asked to compare two numbers written in an unusual numeral system called the golden system. Each number is represented as a string of 0s and 1s, and the value of a number is computed by interpreting it as a sum of powers of the golden ratio...

Practice › Codeforces Solutions › Codeforces Round 257 (Div. 1) ›

CF 449A - Jzzhu and Chocolate

CF 449A - Jzzhu and Chocolate Rating: 1700 Tags: greedy, math Solve time: 2m 1s Verified: yes Solution Problem Understanding We have an $n \times m$ chocolate bar made of unit squares. A cut is either horizontal or vertical, must follow grid lines, must lie strictly inside the chocolate, and cannot duplicate a previous cut. After making exactly $k$ cuts, the chocolate is divided into several rectangular pieces. Among all...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3432 - Count Partitions with Even Sum Difference

LeetCode Problem 3432 Difficulty: 🟢 Easy Topics: Array, Math, Prefix Sum Solution Problem Understanding The problem gives us an integer array nums and asks us to count how many valid partition points produce an even difference between the sum of the left part and the sum of the right part. A partition is created by choosing an index i such that: The left subarray is nums[0:i+1] The right subarray is...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3025 - Find the Number of Ways to Place People I

LeetCode Problem 3025 Difficulty: 🟡 Medium Topics: Array, Math, Geometry, Sorting, Enumeration Solution Problem Understanding The problem gives us a list of distinct points on a 2D plane. Each point is represented as [x, y] , where x is the horizontal coordinate and y is the vertical coordinate. We must count how many ordered pairs (A, B) satisfy two conditions: Point A is on the upper-left side of point B...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3405 - Count the Number of Arrays with K Matching Adjacent Elements

LeetCode Problem 3405 Difficulty: 🔴 Hard Topics: Math, Combinatorics Solution Problem Understanding This problem asks us to count how many arrays of length n can be formed using integers between 1 and m such that exactly k adjacent pairs are equal. In other words, we are looking for sequences where the number of times arr[i] equals arr[i-1] is precisely k . The output is the total count of these arrays...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3404 - Count Special Subsequences

LeetCode Problem 3404 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Enumeration Solution Problem Understanding This problem asks us to count the number of special subsequences of length four in a given array nums of positive integers. A special subsequence (p, q, r, s) must satisfy two requirements. First, the product of the first and third elements must equal the product of the second and fourth elements: nums[p] * nums[r]...

Practice › Codeforces Solutions › Codeforces Round 137 (Div. 2) ›

CF 222C - Reducing Fractions

CF 222C - Reducing Fractions Rating: 1800 Tags: implementation, math, number theory, sortings Solve time: 34s Verified: no Solution Problem-Type Check This is a Type C - Optimization problem. The task is to determine the maximum number of intersections among perpendiculars drawn from each of five points to lines formed by the other four points. Therefore, a complete proof must establish both an upper bound on the number of intersections...

Practice › Codeforces Solutions › Codeforces Round 183 (Div. 1) ›

CF 303D - Rotatable Number

CF 303D - Rotatable Number Rating: 2600 Tags: math, number theory Solve time: 1m 56s Verified: yes Solution Problem Understanding We are looking for bases in which a very special cyclic behavior exists. Take a number with exactly n digits in base b . Leading zeroes are allowed, so 0011 in base 2 is a valid length-4 number. The number is called rotatable if multiplying it by every integer from...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2469 - Convert the Temperature

LeetCode Problem 2469 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem gives us a single floating point value named celsius , representing a temperature measured in degrees Celsius. Our task is to convert this temperature into two other temperature scales, Kelvin and Fahrenheit, and return both converted values in an array. The conversion formulas are provided directly in the statement: Kelvin = Celsius + 273.15 Fahrenheit = Celsius...

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185D - Visit of the Great

CF 185D - Visit of the Great Rating: 2600 Tags: math, number theory Solve time: 2m 22s Verified: no Solution Problem Understanding We are given many queries. In each query, we take all numbers of the form $$k^{2l}+1,\ k^{2l+1}+1,\ \dots,\ k^{2r}+1$$ and must compute their least common multiple modulo a prime $p$. The interval length can be enormous because $r$ may reach $10^{18}$. Even storing the numbers is impossible, let...

Practice › Codeforces Solutions › Codeforces Round 105 (Div. 2) ›

CF 148A - Insomnia cure

CF 148A - Insomnia cure Rating: 800 Tags: constructive algorithms, implementation, math Solve time: 1m 34s Verified: no Solution Problem Understanding The problem asks us to figure out how many dragons get affected by a princess who has a unique way of defending herself. She targets every k -th, l -th, m -th, and n -th dragon with different actions. The total number of dragons is d . The input...

Practice › Codeforces Solutions › Codeforces Round 183 (Div. 1) ›

CF 303C - Minimum Modular

CF 303C - Minimum Modular Rating: 2400 Tags: brute force, graphs, math, number theory Solve time: 4m 56s Verified: yes Solution Problem Understanding We are given a set of distinct integers. We may delete at most k of them, where k ≤ 4 . After deleting, we want all remaining numbers to produce different remainders modulo some positive integer m . Two numbers collide modulo m exactly when their difference...

Practice › Codeforces Solutions ›

Codeforces Testing Round 5

Codeforces Testing Round 5 Type: Special | Problems: 2 | Verified: 2/2 | Rating range: 900-2000 | Time: 4m 20s Problem Name Rating Tags Solve Time Verified A Subtractions 900 math, number-theory 2m 41s ✓ B Dominoes 2000 dfs-and-similar, graphs 1m 39s ✓

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3155 - Maximum Number of Upgradable Servers

LeetCode Problem 3155 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search Solution Problem Understanding The problem requires calculating the maximum number of servers that can be upgraded at each data center independently, given the number of servers, upgrade costs, potential revenue from selling servers, and available money. Each data center has its own resources, and money cannot be transferred between them. For each data center, the input arrays provide: count[i]...

Practice › Codeforces Solutions ›

Zepto Code Rush 2014

Zepto Code Rush 2014 Type: Special | Problems: 3 | Verified: 0/3 | Rating range: 1400-3000 | Time: 9m 32s Problem Name Rating Tags Solve Time Verified B Om Nom and Spiders 1400 implementation, math 3m 56s ✗ E Cardboard Box 2600 data-structures, greedy 1m 21s ✗ F Banners 3000 brute-force, data-structures, dp 4m 15s ✗

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3343 - Count Number of Balanced Permutations

LeetCode Problem 3343 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming, Combinatorics Solution Problem Understanding We are given a string num consisting only of digits. We may rearrange the digits in any possible way, but we only count distinct permutations. A permutation is considered balanced if the sum of the digits placed at even indices equals the sum of the digits placed at odd indices. The indices are zero based....

Practice › Codeforces Solutions ›

Codeforces Round 106 (Div. 2)

Codeforces Round 106 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 900-2300 | Time: 8m 2s Problem Name Rating Tags Solve Time Verified A Business trip 900 greedy, implementation, sortings 1m 33s ✓ B Martian Clock 1600 implementation 1m 25s ✓ C Division into Teams 1500 greedy, math, sortings 1m 40s ✗ D Coloring Brackets 1900 dp 2m 8s ✓ E Martian Strings 2300...

Practice › Codeforces Solutions ›

Codeforces Round 174 (Div. 1)

Codeforces Round 174 (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 2/3 | Rating range: 1600-2400 | Time: 5m 38s Problem Name Rating Tags Solve Time Verified A Cows and Sequence 1600 constructive-algorithms, data-structures, implementation 1m 35s ✓ C Coin Troubles 2100 dp 2m 22s ✗ D Cows and Cool Sequences 2400 dp, math, number-theory 1m 41s ✓

Practice › Codeforces Solutions › Codeforces Round 134 (Div. 1) ›

CF 217D - Bitonix' Patrol

CF 217D - Bitonix' Patrol Rating: 2900 Tags: bitmasks, brute force, combinatorics, dfs and similar, math Solve time: 3m 51s Verified: no Solution Problem Understanding The orbit contains n stations placed uniformly on a circle. Adjacent stations are exactly m miles apart, so the whole circumference equals n * m . A patrol is valid if Bitonix starts at some station, uses any subset of the fuel tanks in arbitrary...

Practice › Codeforces Solutions ›

Codeforces Round 127 (Div. 1)

Codeforces Round 127 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1700-2600 | Time: 7m 7s Problem Name Rating Tags Solve Time Verified A Clear Symmetry 1700 constructive-algorithms, dp, math 1m 9s ✓ B Guess That Car! 1800 math, ternary-search 1m ✓ C Fragile Bridges 2000 dp 1m 40s ✓ D Brand New Problem 2600 bitmasks, brute-force, dp 1m 39s ✓ E Thoroughly Bureaucratic...

Practice › Codeforces Solutions ›

Codeforces Round 136 (Div. 2)

Codeforces Round 136 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1300 | Time: 3m 57s Problem Name Rating Tags Solve Time Verified A Little Elephant and Function 1000 implementation, math 1m 10s ✓ B Little Elephant and Numbers 1300 implementation 2m 47s ✓

Practice › Codeforces Solutions › Codeforces Round 165 (Div. 2) ›

CF 270A - Fancy Fence

CF 270A - Fancy Fence Rating: 1100 Tags: geometry, implementation, math Solve time: 1m 12s Verified: yes Solution Problem Understanding We are asked to determine whether a robot, which can only make fence corners at a fixed angle a , can construct a regular polygon. A regular polygon is defined as a closed shape with all sides and all angles equal. The input consists of several test cases, each giving...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2614 - Prime In Diagonal

LeetCode Problem 2614 Difficulty: 🟢 Easy Topics: Array, Math, Matrix, Number Theory Solution Problem Understanding The problem gives us a square matrix nums of size n x n . We need to examine the values that appear on the two diagonals of the matrix and return the largest value among them that is prime. There are two diagonals in a square matrix: The primary diagonal contains elements where the row...

Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293D - Ksusha and Square

CF 293D - Ksusha and Square Rating: 2700 Tags: geometry, math, probabilities, two pointers Solve time: 1m 59s Verified: yes Solution Problem Understanding We are given a convex polygon with integer coordinates. Inside this polygon, including its boundary, there are finitely many lattice points. We choose two distinct lattice points uniformly at random, then construct a square whose diagonal is the segment between those two points. The task is to...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2607 - Make K-Subarray Sums Equal

LeetCode Problem 2607 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Sorting, Number Theory Solution Problem Understanding The problem asks us to transform a circular integer array so that every subarray of length k has the same sum. A circular array means the end wraps around to the beginning, so subarrays can cross the boundary of the array. The allowed operation is increasing or decreasing any element by 1, and the...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1808 - Maximize Number of Nice Divisors

LeetCode Problem 1808 Difficulty: 🔴 Hard Topics: Math, Recursion, Number Theory Solution Problem Understanding The problem gives us an integer primeFactors , representing the maximum total number of prime factors we are allowed to use when constructing some positive integer n . The goal is not to maximize n itself. Instead, we want to maximize the number of "nice divisors" of n . A divisor of n is considered nice...

Practice › Codeforces Solutions ›

Codeforces Round 192 (Div. 1)

Codeforces Round 192 (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1500-3100 | Time: 7m 40s Problem Name Rating Tags Solve Time Verified A Purification 1500 constructive-algorithms, greedy 3m 58s ✗ B Biridian Forest 1500 dfs-and-similar, shortest-paths 2m 48s ✓ E Evil 3100 math 54s ✗

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3178 - Find the Child Who Has the Ball After K Seconds

LeetCode Problem 3178 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem asks us to simulate a game in which n children, numbered from 0 to n - 1 , stand in a straight line. Child 0 starts with a ball, and every second the child holding the ball passes it to the next child in the current direction. The direction is initially to the right, and it...

Practice › Codeforces Solutions › Codeforces Round 114 (Div. 1) ›

CF 167C - Wizards and Numbers

CF 167C - Wizards and Numbers Rating: 2300 Tags: games, math Solve time: 1m 39s Verified: no Solution Problem Understanding We have a two-player game played with two numbers on a blackboard, call them a and b . Each player can, on their turn, either replace the larger number with the remainder of dividing it by the smaller number, or subtract a positive multiple of the smaller number from the...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2152 - Minimum Number of Lines to Cover Points

LeetCode Problem 2152 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Geometry, Bitmask Solution Problem Understanding This problem asks us to determine the minimum number of straight lines needed to cover a given set of points on an X-Y plane. Each point is defined by its (x, y) coordinates, and a straight line can pass through any number of points as long as they are...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2843 - Count Symmetric Integers

LeetCode Problem 2843 Difficulty: 🟢 Easy Topics: Math, Enumeration Solution Problem Understanding The problem asks us to count symmetric integers within a given range [low, high] . A symmetric integer is defined as an integer with an even number of digits , where the sum of the first half of the digits is equal to the sum of the second half. For example, 1221 is symmetric because the sum of...

Practice › Codeforces Solutions › Codeforces Round 158 (Div. 2) ›

CF 260A - Adding Digits

CF 260A - Adding Digits Rating: 1400 Tags: implementation, math Solve time: 1m 21s Verified: no Solution Problem Understanding We are given a number a and a target divisor b , along with a count n representing how many digits we want to append to a . Each operation consists of appending a single digit to the right of the current number such that the new number is divisible by...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2543 - Check if Point Is Reachable

LeetCode Problem 2543 Difficulty: 🔴 Hard Topics: Math, Number Theory Solution Problem Understanding The problem gives us an infinite two dimensional grid and asks whether we can travel from the starting point (1, 1) to a target point (targetX, targetY) using a specific set of operations. From any point (x, y) , we may perform one of four moves: Subtract x from y , producing (x, y - x) Subtract...

Practice › Codeforces Solutions › VK Cup 2012 Finals, Practice Session ›

CF 209A - Multicolored Marbles

CF 209A - Multicolored Marbles Rating: 1600 Tags: dp, math Solve time: 5m 3s Verified: yes Solution Problem Understanding Polycarpus has a row of n marbles, each either red or blue, and he wants to count how many subsequences of these marbles form a zebroid, which is a sequence where the colors strictly alternate. A zebroid can be as short as one marble. The input only gives n , the...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2928 - Distribute Candies Among Children I

LeetCode Problem 2928 Difficulty: 🟢 Easy Topics: Math, Combinatorics, Enumeration Solution Problem Understanding The problem asks us to calculate the number of ways to distribute n candies among exactly three children such that no child receives more than a specified limit of candies. In other words, we are looking for all integer triplets (a, b, c) such that a + b + c = n and each of a ,...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1878 - Get Biggest Three Rhombus Sums in a Grid

LeetCode Problem 1878 Difficulty: 🟡 Medium Topics: Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum Solution Problem Understanding The problem asks us to compute the largest three distinct rhombus sums in a given m x n integer grid. A rhombus in this context is a square rotated 45 degrees, whose corners align with grid cells. The rhombus sum includes only the border cells of this shape, not the interior....

Practice › Codeforces Solutions › Codeforces Round 183 (Div. 1) ›

CF 303B - Rectangle Puzzle II

CF 303B - Rectangle Puzzle II Rating: 1700 Tags: implementation, math Solve time: 3m 45s Verified: yes Solution Problem Understanding We have a grid-aligned rectangle of size n × m . Every valid point has integer coordinates between (0, 0) and (n, m) . We must choose another axis-aligned rectangle inside it. The rectangle is described by four integers (x1, y1, x2, y2) . The chosen rectangle must satisfy three...

Practice › Codeforces Solutions ›

Codeforces Round 240 (Div. 2)

Codeforces Round 240 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 900-1500 | Time: 2m 30s Problem Name Rating Tags Solve Time Verified A Mashmokh and Lights 900 implementation 1m 23s ✓ B Mashmokh and Tokens 1500 binary-search, greedy, implementation 1m 7s ✓

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2358 - Maximum Number of Groups Entering a Competition

LeetCode Problem 2358 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Greedy Solution Problem Understanding The problem asks us to partition a list of student grades into multiple ordered groups under two strict conditions. First, the total sum of grades in the i-th group must be less than that of the (i+1)-th group. Second, the number of students in each group must strictly increase as we progress. Essentially, both the...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2417 - Closest Fair Integer

LeetCode Problem 2417 Difficulty: 🟡 Medium Topics: Math, Enumeration Solution Problem Understanding In this problem, we are given a positive integer n , and we must find the smallest integer greater than or equal to n that is considered "fair". A number is fair when the count of even digits is exactly equal to the count of odd digits. For example: 10 is fair because it contains one even digit...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3348 - Smallest Divisible Digit Product II

LeetCode Problem 3348 Difficulty: 🔴 Hard Topics: Math, String, Backtracking, Greedy, Number Theory Solution Problem Understanding The problem asks us to find the smallest number that satisfies several constraints relative to a given number num and a target integer t . The input num is a string representing a positive integer, and the number must be zero-free , meaning none of its digits are zero. Additionally, the product of its...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2965 - Find Missing and Repeated Values

LeetCode Problem 2965 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Matrix Solution LeetCode 2965 - Find Missing and Repeated Values Problem Understanding The problem gives us an n x n matrix called grid . Every value in the matrix should normally contain all integers from 1 to n² exactly once. However, there is one mistake in the matrix: One number appears twice. One number is completely missing. Our task...

Practice › Codeforces Solutions ›

Codeforces Round #FF (Div. 1)

Codeforces Round #FF (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 0/3 | Rating range: 2400-3100 | Time: 9m 38s Problem Name Rating Tags Solve Time Verified C DZY Loves Fibonacci Numbers 2400 data-structures, math, number-theory 6m 32s ✗ D DZY Loves Games 2800 math, matrices, probabilities 1m 41s ✗ E DZY Loves Bridges 3100 math, matrices 1m 25s ✗

Practice › Codeforces Solutions › Codeforces Round 157 (Div. 1) ›

CF 258C - Little Elephant and LCM

CF 258C - Little Elephant and LCM Rating: 2000 Tags: binary search, combinatorics, dp, math Solve time: 3m 13s Verified: no Solution Problem Understanding We are given an array a of length n . From each position i , we are allowed to choose a value b_i such that 1 ≤ b_i ≤ a_i . Once we choose all values, we look at two quantities: the maximum element of the...

Practice › Codeforces Solutions › Codeforces Round 125 (Div. 1) ›

CF 198A - About Bacteria

CF 198A - About Bacteria Rating: 1700 Tags: implementation, math Solve time: 1m 28s Verified: yes Solution Problem Understanding We are asked to model the growth of bacteria under a specific rule. In the first experiment, each bacterium multiplies by a factor of k every second and then b extra bacteria appear due to some abnormal effect. Starting from a single bacterium, after n seconds there are exactly z bacteria....

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2613 - Beautiful Pairs

LeetCode Problem 2613 Difficulty: 🔴 Hard Topics: Array, Math, Divide and Conquer, Geometry, Sorting, Ordered Set Solution Problem Understanding The problem asks us to find a beautiful pair of indices (i, j) in two integer arrays nums1 and nums2 of equal length. A pair (i, j) is beautiful if it minimizes the sum of the absolute differences between the corresponding elements: |nums1[i] - nums1[j]| + |nums2[i] - nums2[j]| among all...

Practice › Codeforces Solutions ›

Croc Champ 2012 - Final

Croc Champ 2012 - Final Type: Special | Problems: 5 | Verified: 5/5 | Rating range: 1700-2900 | Time: 10m 12s Problem Name Rating Tags Solve Time Verified A Headquarters 1700 constructive-algorithms, math 1m 52s ✓ B Zoo 1700 brute-force, geometry 1m 27s ✓ C Cyclic Coloring 2200 dfs-and-similar 3m 32s ✓ D T-shirt 2700 dp, greedy, probabilities 1m 15s ✓ E Candy Shop 2900 greedy 2m 6s ✓

Practice › Codeforces Solutions ›

Codeforces Round 177 (Div. 1)

Codeforces Round 177 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1700-2400 | Time: 3m 45s Problem Name Rating Tags Solve Time Verified C Polo the Penguin and XOR operation 1700 implementation, math 1m 39s ✗ D Polo the Penguin and Trees 2400 combinatorics, dfs-and-similar, trees 2m 6s ✓

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3274 - Check if Two Chessboard Squares Have the Same Color

LeetCode Problem 3274 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem gives us two chessboard coordinates, such as "a1" or "h8" , and asks whether the two squares have the same color on a standard 8 x 8 chessboard. A chessboard alternates between black and white squares. If one square is black, all horizontally or vertically adjacent squares are white, and vice versa. This alternating pattern means...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2317 - Maximum XOR After Operations

LeetCode Problem 2317 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation Solution Problem Understanding The problem gives us an integer array nums , and we may perform a special operation any number of times. In one operation, we choose an index i and any non-negative integer x , then replace: nums[i] = nums[i] AND (nums[i] XOR x) Our goal is to maximize the bitwise XOR of all elements in the...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2400 - Number of Ways to Reach a Position After Exactly k Steps

LeetCode Problem 2400 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding This problem asks us to count the number of distinct ways to move from startPos to endPos on an infinite number line using exactly k steps . At each step, we may move either one position to the left ( -1 ) or one position to the right ( +1 ). The important detail is that...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3345 - Smallest Divisible Digit Product I

LeetCode Problem 3345 Difficulty: 🟢 Easy Topics: Math, Enumeration Solution Problem Understanding The problem gives us two integers, n and t . We must find the smallest integer greater than or equal to n whose digit product is divisible by t . The digit product of a number is obtained by multiplying all of its digits together. For example: The digit product of 16 is 1 × 6 = 6...

Practice › Codeforces Solutions › Codeforces Round 107 (Div. 2) ›

CF 151A - Soft Drinking

CF 151A - Soft Drinking Rating: 800 Tags: implementation, math Solve time: 1m 31s Verified: yes Solution Problem Understanding A group of friends wants to make identical toasts using three resources: soft drink, lime slices, and salt. Every toast consumes a fixed amount of each resource. The task is to determine how many complete toasts each friend can make before at least one resource runs out. The input gives the...

Practice › Codeforces Solutions › Codeforces Round 165 (Div. 1) ›

CF 269E - String Theory

CF 269E - String Theory Rating: 3100 Tags: geometry, math, strings Solve time: 1m 58s Verified: no Solution Problem Understanding We are given a rectangular harp represented as a grid of size n × m , where pins are placed along the edges: n pins on the left and right sides, and m pins on the top and bottom sides. Each string connects exactly two pins located on different sides...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2748 - Number of Beautiful Pairs

LeetCode Problem 2748 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Counting, Number Theory Solution LeetCode 2748 - Number of Beautiful Pairs Problem Understanding The problem gives us a 0-indexed integer array nums . We must count how many pairs of indices (i, j) satisfy 0 <= i < j < n and have the following property: Take the first digit of nums[i] . Take the last digit of nums[j]...

Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402A - Nuts

CF 402A - Nuts Rating: 1100 Tags: greedy, math Solve time: 4m 11s Verified: no Solution Problem Understanding We are asked to distribute a certain number of nuts into boxes, and we are given a limited number of divisors that can split a box into multiple sections. Each box can have at most k sections, and each section can hold at most v nuts. We have a total nuts and...

Practice › Codeforces Solutions ›

Codeforces Round 173 (Div. 2)

Codeforces Round 173 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1500-2100 | Time: 2m 26s Problem Name Rating Tags Solve Time Verified B Painting Eggs 1500 greedy, math 1m 12s ✓ D Yet Another Number Game 2100 dp, games 1m 14s ✓

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1994 - The Number of Good Subsets

LeetCode Problem 1994 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Counting, Number Theory, Bitmask Solution LeetCode 1994 - The Number of Good Subsets Problem Understanding This problem asks us to count how many subsets of the input array have a product that can be written as a multiplication of distinct prime numbers. The phrase "distinct prime numbers" is the key restriction. A product is valid...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1908 - Game of Nim

LeetCode Problem 1908 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Bit Manipulation, Brainteaser, Game Theory Solution Problem Understanding This problem is the classic mathematical game known as Nim. We are given an array piles , where each element represents the number of stones in a pile. Two players, Alice and Bob, take turns removing stones. On each turn, a player may choose any non-empty pile and remove any positive...

Practice › Codeforces Solutions ›

Codeforces Round 120 (Div. 2)

Codeforces Round 120 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 1100-1900 | Time: 6m 10s Problem Name Rating Tags Solve Time Verified A Vasya and the Bus 1100 greedy, math 1m 11s ✓ B Surrounded 1800 geometry 1m 34s ✓ C STL 1500 dfs-and-similar 1m 49s ✓ D Non-Secret Cypher 1900 two-pointers 1m 36s ✓

Practice › Codeforces Solutions › Codeforces Round 177 (Div. 1) ›

CF 288C - Polo the Penguin and XOR operation

CF 288C - Polo the Penguin and XOR operation Rating: 1700 Tags: implementation, math Solve time: 1m 39s Verified: no Solution Problem Understanding We are given all integers from 0 to n, and we must arrange them into a permutation p. Each position i contributes a value equal to i XOR p[i], and the goal is to maximize the total sum of these contributions over all positions. So we are...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2927 - Distribute Candies Among Children III

LeetCode Problem 2927 Difficulty: 🔴 Hard Topics: Math, Combinatorics Solution LeetCode 2927 - Distribute Candies Among Children III Problem Understanding We are given two integers, n and limit . There are exactly three children, and we want to distribute all n candies among them. If we let the number of candies received by the three children be: $$x_1,\ x_2,\ x_3$$ then the distribution must satisfy: $$x_1 + x_2 + x_3...

Practice › Codeforces Solutions › Codeforces Round 235 (Div. 2) ›

CF 401A - Vanya and Cards

CF 401A - Vanya and Cards Rating: 800 Tags: implementation, math Solve time: 4m 10s Verified: no Solution Problem Understanding Vanya has discovered a subset of cards from his original infinite collection, where each card carries an integer between -x and x. His goal is to balance the sum of these found cards to zero by potentially adding additional cards from the infinite supply. The task is to determine the...

Practice › Codeforces Solutions ›

Codeforces Round 238 (Div. 1)

Codeforces Round 238 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 0/2 | Rating range: 2200-2800 | Time: 6m 36s Problem Name Rating Tags Solve Time Verified D Hill Climbing 2200 dfs-and-similar, geometry, trees 2m 13s ✗ E Hamming Triples 2800 implementation, math, two-pointers 4m 23s ✗

Practice › Codeforces Solutions › Codeforces Round 183 (Div. 2) ›

CF 304A - Pythagorean Theorem II

CF 304A - Pythagorean Theorem II Rating: 1200 Tags: brute force, math Solve time: 2m Verified: yes Solution Problem Understanding We need to count how many integer-sided right triangles exist such that all three sides are at most n . A right triangle with sides (a, b, c) satisfies the Pythagorean equation: $a^2+b^2=c^2$$a$$b$$c = \sqrt{a^2 + b^2} \approx 21.21$$a^2 + b^2 = c^2 \approx 225.00 + 225.00 = 450.00$Adjusting a...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2081 - Sum of k-Mirror Numbers

LeetCode Problem 2081 Difficulty: 🔴 Hard Topics: Math, Enumeration Solution Problem Understanding The problem asks us to find the sum of the n smallest k-mirror numbers , where a k-mirror number is a positive integer that reads the same forwards and backwards both in base-10 and in base- k . The inputs are k , representing the base for the mirror property, and n , the count of the smallest...

Practice › Codeforces Solutions ›

Codeforces Round 112 (Div. 2)

Codeforces Round 112 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1000-2200 | Time: 8m 54s Problem Name Rating Tags Solve Time Verified A Supercentral Point 1000 implementation 1m 52s ✗ B Burning Midnight Oil 1500 binary-search, implementation 1m 42s ✓ C Another Problem on Strings 1600 binary-search, brute-force, dp 1m 20s ✓ D Beard Graph 2100 data-structures, dsu, trees 2m 13s ✓ E...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2979 - Most Expensive Item That Can Not Be Bought

LeetCode Problem 2979 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Number Theory Solution Problem Understanding This problem asks us to determine the largest price that cannot be formed using an unlimited number of coins of two given prime denominations. We are given two distinct prime numbers, primeOne and primeTwo . Alice has an infinite supply of coins with those exact denominations, and the market contains items of every positive integer...

Practice › Codeforces Solutions ›

Codeforces Round 163 (Div. 2)

Codeforces Round 163 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 2/4 | Rating range: 800-2500 | Time: 8m 10s Problem Name Rating Tags Solve Time Verified B Queue at the School 800 constructive-algorithms, graph-matchings, implementation 1m 21s ✓ C Below the Diagonal 2100 constructive-algorithms, greedy, math 2m 17s ✗ D BerDonalds 2400 graphs, math, shortest-paths 2m 9s ✗ E More Queries to Array... 2500 data-structures, math 2m...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3296 - Minimum Number of Seconds to Make Mountain Height Zero

LeetCode Problem 3296 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Greedy, Heap (Priority Queue) Solution Problem Understanding The problem asks us to calculate the minimum amount of time required for a team of workers to reduce the height of a mountain to zero, given that each worker has a specific time cost for performing work and the total work time grows linearly for consecutive units of height. Specifically, if...

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 2) ›

CF 197B - Limit

CF 197B - Limit Rating: 1400 Tags: math Solve time: 1m 33s Verified: yes Solution Problem Understanding We are given two polynomials, $P(x)$ and $Q(x)$, written in descending powers of $x$. The task is to compute: $$\lim_{x \to \infty} \frac{P(x)}{Q(x)}$$ The input gives the degrees of the two polynomials and all coefficients from the highest-degree term down to the constant term. The key observation is that when $x$ becomes extremely...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2128 - Remove All Ones With Row and Column Flips

LeetCode Problem 2128 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation, Matrix Solution Problem Understanding The problem gives us an m x n binary matrix named grid , where every cell contains either 0 or 1 . We are allowed to perform two kinds of operations: Flip an entire row Flip an entire column Flipping means changing every 0 into 1 and every 1 into 0 . Our goal is...

Practice › Codeforces Solutions › Codeforces Round 122 (Div. 2) ›

CF 194A - Exams

CF 194A - Exams Rating: 900 Tags: implementation, math Solve time: 1m 28s Verified: yes Solution Problem Understanding The author has to take n exams. Every exam receives an integer grade between 2 and 5 inclusive. A grade of 2 means the exam is failed and must be retaken. The total sum of all grades must equal exactly k . Among all possible assignments of grades whose sum is k...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2769 - Find the Maximum Achievable Number

LeetCode Problem 2769 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem gives us two integers, num and t . We are allowed to perform a specific operation at most t times. In one operation, we must simultaneously modify both numbers involved: Increase or decrease x by 1 At the same time, increase or decrease num by 1 The goal is to determine the maximum possible starting value of...

Practice › Codeforces Solutions ›

Codeforces Round 175 (Div. 2)

Codeforces Round 175 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1200-2600 | Time: 1m 58s Problem Name Rating Tags Solve Time Verified B Find Marble 1200 implementation 58s ✓ E Positions in Permutations 2600 combinatorics, dp, math 1m ✓

Practice › Codeforces Solutions ›

Codeforces Round 196 (Div. 1)

Codeforces Round 196 (Div. 1) Type: Div. 1 | Problems: 1 | Verified: 1/1 | Rating range: 2900-2900 | Time: 1m 33s Problem Name Rating Tags Solve Time Verified D GCD Table 2900 chinese-remainder-theorem, math, number-theory 1m 33s ✓

Practice › Codeforces Solutions ›

Surprise Language Round 6

Surprise Language Round 6 Type: Special | Problems: 4 | Verified: 4/4 | Rating range: 1300-1400 | Time: 6m 43s Problem Name Rating Tags Solve Time Verified B A + Reverse B 1300 *special, implementation 1m 55s ✓ C LCM 1400 *special, implementation, math 1m 59s ✓ E HQ9+ 1400 *special, implementation 1m 17s ✓ F Binary Notation 1400 *special, implementation 1m 32s ✓

Practice › Codeforces Solutions ›

VK Cup 2012 Finals, Practice Session

VK Cup 2012 Finals, Practice Session Type: Special | Problems: 3 | Verified: 3/3 | Rating range: 1600-2400 | Time: 11m 47s Problem Name Rating Tags Solve Time Verified A Multicolored Marbles 1600 dp, math 5m 3s ✓ B Pixels 2100 constructive-algorithms, math 1m 41s ✓ C Trails and Glades 2400 constructive-algorithms, dsu, graphs 5m 3s ✓

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2101 - Detonate the Maximum Bombs

LeetCode Problem 2101 Difficulty: 🟡 Medium Topics: Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry Solution Problem Understanding In this problem, each bomb is represented by three integers: its x-coordinate, y-coordinate, and explosion radius. If a bomb explodes, every other bomb whose center lies within or on the boundary of that radius will also explode. Those newly exploded bombs can continue triggering additional bombs, creating a chain reaction. The...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2894 - Divisible and Non-divisible Sums Difference

LeetCode Problem 2894 Difficulty: 🟢 Easy Topics: Math Solution LeetCode 2894 - Divisible and Non-divisible Sums Difference Problem Understanding This problem gives us two positive integers, n and m . We need to examine every integer in the inclusive range [1, n] and separate the numbers into two groups based on divisibility by m . The first group contains all numbers that are not divisible by m . The sum...

Practice › Codeforces Solutions › Codeforces Round 129 (Div. 1) ›

CF 204C - Little Elephant and Furik and Rubik

CF 204C - Little Elephant and Furik and Rubik Rating: 2000 Tags: math, probabilities Solve time: 1m 23s Verified: no Solution Problem Understanding We are given two strings of equal length. From each string we independently pick a substring, and both substrings must have the same length. After choosing them, we compare them character by character and count how many positions match. The selection is uniform over all possible choices...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2119 - A Number After a Double Reversal

LeetCode Problem 2119 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine whether a number remains unchanged after performing two digit reversals. A digit reversal means reading the digits of a number from right to left. However, any leading zeros that appear after reversing are removed automatically because integers do not store leading zeros. For example: Reversing 526 gives 625 Reversing 1800 gives 81 ,...

Practice › Codeforces Solutions › Codeforces Round 205 (Div. 2) ›

CF 353C - Find Maximum

CF 353C - Find Maximum Rating: 1600 Tags: implementation, math, number theory Solve time: 1m 37s Verified: yes Solution Problem Understanding We are given an array a of n non-negative integers, and a number m specified as a binary string. Each integer in a represents a weight associated with a position, and for any number x between 0 and m inclusive, we can select positions where the bits of x...

Practice › Codeforces Solutions › Codeforces Round 192 (Div. 1) ›

CF 329E - Evil

CF 329E - Evil Rating: 3100 Tags: math Solve time: 54s Verified: no Solution Problem Understanding We are given a set of $n$ cities, each represented as a point on a 2D Cartesian plane. The distance between any two cities is measured using the Manhattan metric, which is the sum of the absolute differences of their coordinates. The goal is to construct a Hamiltonian cycle that visits every city exactly...

Practice › Codeforces Solutions › Codeforces Round 237 (Div. 2) ›

CF 404B - Marathon

CF 404B - Marathon Rating: 1500 Tags: implementation, math Solve time: 2m 40s Verified: no Solution Problem Understanding We are tracking a runner moving along the perimeter of a square of side length a , starting from the bottom-left corner (0, 0) and moving counter-clockwise. After every fixed distance d , we want to know the runner’s exact coordinates on the square boundary. The motion is continuous along the border....

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2807 - Insert Greatest Common Divisors in Linked List

LeetCode Problem 2807 Difficulty: 🟡 Medium Topics: Linked List, Math, Number Theory Solution LeetCode 2807 - Insert Greatest Common Divisors in Linked List Problem Understanding This problem gives us the head of a singly linked list where every node contains a positive integer. Our task is to modify the list by inserting a new node between every pair of adjacent nodes. The value of each inserted node must be the...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2654 - Minimum Number of Operations to Make All Array Elements Equal to 1

LeetCode Problem 2654 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution Problem Understanding The problem gives us an array of positive integers, nums . In one operation, we may choose two adjacent elements, nums[i] and nums[i+1] , and replace either one of them with the greatest common divisor, gcd , of the pair. The goal is to make every element in the array equal to 1 using the minimum...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2162 - Minimum Cost to Set Cooking Time

LeetCode Problem 2162 Difficulty: 🟡 Medium Topics: Math, Enumeration Solution Problem Understanding This problem asks us to simulate the process of entering a cooking time into a microwave while minimizing the total finger movement and button pressing cost. The microwave accepts at most four digits. Internally, the microwave interprets those digits as a four digit string in the form: $$MMSS$$ The first two digits represent minutes and the last two...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3101 - Count Alternating Subarrays

LeetCode Problem 3101 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem gives us a binary array nums , meaning every element is either 0 or 1 . We need to count how many subarrays are alternating. A subarray is considered alternating if no two adjacent elements inside that subarray are equal. In other words, every neighboring pair must contain different values. For example, the subarray [0,1,0,1] is...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2083 - Substrings That Begin and End With the Same Letter

LeetCode Problem 2083 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Counting, Prefix Sum Solution Problem Understanding The problem asks us to count all substrings in a given string s that start and end with the same character. A substring is a contiguous sequence of characters, so the order and adjacency of characters matter. The input s is a non-empty string consisting of lowercase English letters only, and its length...

Practice › Codeforces Solutions › Codeforces Round 252 (Div. 2) ›

CF 441D - Valera and Swaps

CF 441D - Valera and Swaps Rating: 2100 Tags: constructive algorithms, dsu, graphs, implementation, math, string suffix structures Solve time: 1m 26s Verified: no Solution Problem Understanding We are given a permutation, which we can think of as a row of numbered positions, where each position contains a distinct value from 1 to n. A swap operation exchanges two positions, and after a sequence of swaps we obtain another permutation....

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3272 - Find the Count of Good Integers

LeetCode Problem 3272 Difficulty: 🔴 Hard Topics: Hash Table, Math, Combinatorics, Enumeration Solution Problem Understanding The problem asks us to count n-digit integers that are "good" with respect to a given integer k . A "good" integer is one whose digits can be rearranged to form a k-palindromic integer . A k-palindromic integer is defined as an integer that satisfies two properties: it is a palindrome (reads the same forwards...

Practice › Codeforces Solutions › Codeforces Round 128 (Div. 2) ›

CF 203D - Hit Ball

CF 203D - Hit Ball Rating: 1700 Tags: geometry, implementation, math Solve time: 1m 20s Verified: no Solution Problem Understanding We are asked to simulate a three-dimensional billiard-like scenario where a ball travels inside a rectangular corridor with perfectly reflecting walls, floor, and ceiling. The corridor is infinite in the y direction, and the ball is initially placed at the center of the corridor, at a distance m from the...

Practice › Codeforces Solutions ›

Codeforces Round 195 (Div. 2)

Codeforces Round 195 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 2100-2700 | Time: 6m 33s Problem Name Rating Tags Solve Time Verified D Vasily the Bear and Beautiful Strings 2100 combinatorics, math, number-theory 3m 11s ✓ E Vasily the Bear and Painting Square 2700 bitmasks, combinatorics, dp 3m 22s ✓

Practice › Codeforces Solutions › Codeforces Round 166 (Div. 2) ›

CF 271B - Prime Matrix

CF 271B - Prime Matrix Rating: 1300 Tags: binary search, brute force, math, number theory Solve time: 1m 46s Verified: yes Solution Problem Understanding We are given a rectangular grid of integers. In one operation we may pick any single cell and increase its value by exactly one. We can repeat this as many times as we want on any cells. The goal is not to make the whole matrix...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3251 - Find the Count of Monotonic Pairs II

LeetCode Problem 3251 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Combinatorics, Prefix Sum Solution Problem Understanding The problem asks us to count the number of ways we can split an array of positive integers, nums , into two arrays, arr1 and arr2 , such that they satisfy a set of monotonic conditions. Specifically, arr1 must be non-decreasing, arr2 must be non-increasing, and for each index i , their sum...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2939 - Maximum Xor Product

LeetCode Problem 2939 Difficulty: 🟡 Medium Topics: Math, Greedy, Bit Manipulation Solution That will be quite long and detailed given your required structure and depth. To ensure quality and avoid truncation, I will provide it in a carefully structured, complete editorial format. Before I begin, one important clarification: for LeetCode 2939 - Maximum Xor Product , there are two valid optimal explanations commonly used: Greedy bit construction with balancing intuition...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2584 - Split the Array to Make Coprime Products

LeetCode Problem 2584 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Number Theory Solution Problem Understanding The problem is asking us to find a valid split point in an array nums where the product of elements to the left of the split and the product of elements to the right are coprime . Formally, if we split at index i , the left product is nums[0] * nums[1] * ......

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2719 - Count of Integers

LeetCode Problem 2719 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming Solution Problem Understanding The problem asks us to count how many integers lie between two given numeric strings num1 and num2 (inclusive) such that the sum of their digits is between min_sum and max_sum . In other words, we are looking for all integers $x$ where num1 <= x <= num2 and the sum of digits of $x$ falls...

Practice › Codeforces Solutions › Codeforces Round 136 (Div. 2) ›

CF 221A - Little Elephant and Function

CF 221A - Little Elephant and Function Rating: 1000 Tags: implementation, math Solve time: 1m 10s Verified: yes Solution Problem Understanding We are given a recursive procedure that operates on a permutation of numbers from 1 to n . The function behaves like this: For f(x) , it first recursively processes the first x - 1 elements, then swaps positions x - 1 and x . If we call f(n)...

Practice › Codeforces Solutions ›

Codeforces Round 184 (Div. 2)

Codeforces Round 184 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1600-2300 | Time: 7m 58s Problem Name Rating Tags Solve Time Verified A Strange Addition 1600 brute-force, constructive-algorithms, implementation 1m 22s ✓ B Continued Fractions 1700 brute-force, implementation, math 1m 25s ✓ C Ivan and Powers of Two 1600 greedy, implementation 1m 48s ✓ D Olya and Graph 2200 combinatorics, math 1m 36s...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2739 - Total Distance Traveled

LeetCode Problem 2739 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding This problem asks us to compute the maximum total distance a truck can travel given fuel stored in two tanks: mainTank , the truck's primary fuel tank. additionalTank , a reserve tank that can transfer fuel into the main tank under specific conditions. The truck consumes fuel at a fixed mileage of 10 kilometers per liter . The...

Practice › Codeforces Solutions › Codeforces Round 204 (Div. 1) ›

CF 351A - Jeff and Rounding

CF 351A - Jeff and Rounding Rating: 1800 Tags: dp, greedy, implementation, math Solve time: 1m 37s Verified: no Solution Problem Understanding We are given 2 n real numbers representing Jeff's birthday gifts. Jeff dislikes fractional numbers, so he performs n pairwise operations to "adjust" the numbers. In each operation, he selects two distinct numbers that have not been used before, rounds one down to the nearest integer, and rounds...

Practice › Codeforces Solutions › VK Cup 2012 Finals (unofficial online-version) ›

CF 212C - Cowboys

CF 212C - Cowboys Rating: 2100 Tags: combinatorics, dp, math Solve time: 1m 28s Verified: no Solution Problem Understanding We are given a circular arrangement of cows, each cow facing exactly one of its two neighbors. Represent the circle as a binary string where each character describes direction: one symbol means “point to clockwise neighbor” and the other means “point to counterclockwise neighbor”. At each second, we look at every...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3235 - Check if the Rectangle Corner Is Reachable

LeetCode Problem 3235 Difficulty: 🔴 Hard Topics: Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry Solution Problem Understanding The problem asks whether there is a clear, unobstructed path from the bottom-left corner (0, 0) to the top-right corner (xCorner, yCorner) of a rectangle, such that the path does not touch or go inside any given circles. Each circle is represented by its center (xi, yi) and radius ri . The...

Practice › Codeforces Solutions › Codeforces Round 235 (Div. 2) ›

CF 401B - Sereja and Contests

CF 401B - Sereja and Contests Rating: 1200 Tags: greedy, implementation, math Solve time: 1m 24s Verified: yes Solution Problem Understanding The contest platform numbers every round consecutively by start time. A round can either be a standalone Div2 round, or a pair of simultaneous rounds where Div2 gets identifier i and Div1 gets identifier i + 1 . Sereja only participates in Div2 rounds. Right now he is participating...

Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402E - Strictly Positive Matrix

CF 402E - Strictly Positive Matrix Rating: 2200 Tags: graphs, math Solve time: 3m 37s Verified: no Solution Problem Understanding We are given a square matrix with non-negative integer entries. You can think of it as a weighted directed graph with n nodes where the entry a[i][j] tells you how strongly node i influences node j . The key operation in the problem is matrix multiplication, so a^k[i][j] represents the...

Practice › Codeforces Solutions ›

Codeforces Round 118 (Div. 1)

Codeforces Round 118 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1300-2600 | Time: 6m 44s Problem Name Rating Tags Solve Time Verified A Plant 1300 math 1m 38s ✓ B Mushroom Scientists 1800 math, ternary-search 1m 19s ✓ C Clever Fat Rat 2500 dp 1m 25s ✓ D Visit of the Great 2600 math, number-theory 2m 22s ✗

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3190 - Find Minimum Operations to Make All Elements Divisible by Three

LeetCode Problem 3190 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem gives us an integer array nums . In one operation, we are allowed to either increase or decrease any single element by exactly 1. Our goal is to make every number in the array divisible by 3, while using the smallest possible number of operations. In other words, for each number, we want to determine how...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2698 - Find the Punishment Number of an Integer

LeetCode Problem 2698 Difficulty: 🟡 Medium Topics: Math, Backtracking Solution Problem Understanding The problem asks us to compute a special value called the punishment number for a given integer n . For every integer i in the range [1, n] , we square the number and examine the decimal representation of i * i . The key question is whether we can split this decimal string into contiguous pieces such...

Practice › Codeforces Solutions ›

Codeforces Round 152 (Div. 1)

Codeforces Round 152 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 0/2 | Rating range: 2600-2700 | Time: 5m 24s Problem Name Rating Tags Solve Time Verified D Donkey and Stars 2700 data-structures, dp, geometry 1m 56s ✗ E Endless Matrix 2600 math 3m 28s ✗

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2177 - Find Three Consecutive Integers That Sum to a Given Number

LeetCode Problem 2177 Difficulty: 🟡 Medium Topics: Math, Simulation Solution LeetCode 2177 - Find Three Consecutive Integers That Sum to a Given Number Problem Understanding This problem asks us to determine whether a given integer num can be represented as the sum of three consecutive integers. If such a representation exists, we must return those three integers in sorted order. Otherwise, we return an empty array. Three consecutive integers always...

Practice › Codeforces Solutions › Codeforces Round 240 (Div. 2) ›

CF 415B - Mashmokh and Tokens

CF 415B - Mashmokh and Tokens Rating: 1500 Tags: binary search, greedy, implementation, math Solve time: 1m 7s Verified: yes Solution Problem Understanding Each day Mashmokh receives a pile of tokens, and at the end of that day he can exchange some of them for money using a fixed conversion rule. If he returns $w$ tokens, the money he gets depends only on how many full “blocks” of size $a$...

Practice › Codeforces Solutions ›

Codeforces Round 178 (Div. 2)

Codeforces Round 178 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 800-2500 | Time: 6m 7s Problem Name Rating Tags Solve Time Verified A Shaass and Oskols 800 implementation, math 1m 38s ✓ C Shaass and Lights 1900 combinatorics, number-theory 1m 10s ✓ D Shaass and Painter Robot 2500 brute-force, implementation, number-theory 1m 47s ✗ E Shaass the Great 2300 dp, trees 1m 32s...

Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413C - Jeopardy!

CF 413C - Jeopardy! Rating: 1400 Tags: greedy, math Solve time: 2m 23s Verified: yes Solution Problem Understanding The game consists of n questions, each with some base value a[i] . Some questions are marked as auctions. Team R2 starts by choosing the first question. After that, whoever answered the previous question correctly gets to choose the next question. R2 is unbelievably lucky in this scenario. Whenever they attempt a...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3264 - Final Array State After K Multiplication Operations I

LeetCode Problem 3264 Difficulty: 🟢 Easy Topics: Array, Math, Heap (Priority Queue), Simulation Solution LeetCode 3264 - Final Array State After K Multiplication Operations I Problem Understanding This problem asks us to repeatedly modify an array according to a very specific rule. We are given: An integer array nums An integer k , representing how many operations to perform An integer multiplier For each of the k operations, we must...

Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188C - LCM

CF 188C - LCM Rating: 1400 Tags: *special, implementation, math Solve time: 1m 59s Verified: yes Solution Problem Understanding We are given two positive integers and need to compute their least common multiple. The least common multiple, usually abbreviated as LCM, is the smallest positive integer that both numbers divide evenly. For example, if the numbers are 10 and 42, the answer is 210 because 210 is divisible by both...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2455 - Average Value of Even Numbers That Are Divisible by Three

LeetCode Problem 2455 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to calculate the average of all integers in an array nums that satisfy two conditions simultaneously: they must be even and divisible by 3 . In other words, we only consider numbers that are multiples of 6, because a number divisible by both 2 and 3 is divisible by 6. The input is a...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2539 - Count the Number of Good Subsequences

LeetCode Problem 2539 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Combinatorics, Counting Solution

Practice › Codeforces Solutions ›

Codeforces Round 201 (Div. 2)

Codeforces Round 201 (Div. 2) Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 1100-1100 | Time: 1m 42s Problem Name Rating Tags Solve Time Verified B Fixed Points 1100 brute-force, implementation, math 1m 42s ✓

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2344 - Minimum Deletions to Make Array Divisible

LeetCode Problem 2344 Difficulty: 🔴 Hard Topics: Array, Math, Sorting, Heap (Priority Queue), Number Theory Solution Problem Understanding The problem gives us two arrays of positive integers, nums and numsDivide . We are allowed to delete any number of elements from nums , and our goal is to make the smallest remaining element in nums divide every number in numsDivide . The key phrase here is smallest remaining element ....

Practice › Codeforces Solutions ›

Codeforces Round 183 (Div. 1)

Codeforces Round 183 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1300-3000 | Time: 15m 59s Problem Name Rating Tags Solve Time Verified A Lucky Permutation Triple 1300 constructive-algorithms, implementation, math 2m 15s ✗ B Rectangle Puzzle II 1700 implementation, math 3m 45s ✓ C Minimum Modular 2400 brute-force, graphs, math 4m 56s ✓ D Rotatable Number 2600 math, number-theory 1m 56s ✓ E...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1872 - Stone Game VIII

LeetCode Problem 1872 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Prefix Sum, Game Theory Solution Problem Understanding The problem describes a two-player turn-based game between Alice and Bob with a row of stones, each having an integer value. The key rules are that on a turn, a player removes more than one stone from the left , sums their values to their score, and then places a new stone...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2806 - Account Balance After Rounded Purchase

LeetCode Problem 2806 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem is asking us to simulate a simple bank account deduction after making a purchase. You start with an initial balance of 100 dollars. The purchase amount is given as an integer, purchaseAmount , representing the cost of an item in dollars. However, before deducting the amount, the bank rounds the purchaseAmount to the nearest multiple of 10....

Practice › Codeforces Solutions › Codeforces Round 181 (Div. 2) ›

CF 300E - Empire Strikes Back

CF 300E - Empire Strikes Back Rating: 2300 Tags: binary search, math, number theory Solve time: 1m 17s Verified: yes Solution Problem Understanding The problem asks us to determine the minimum positive integer $n$ such that the factorial of $n$, divided by the sum of the factorials of $n - a_i$ for a given sequence of integers $a_1, a_2, \dots, a_k$, results in a positive integer. Conceptually, we are looking...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2844 - Minimum Operations to Make a Special Number

LeetCode Problem 2844 Difficulty: 🟡 Medium Topics: Math, String, Greedy, Enumeration Solution Problem Understanding The problem asks us to transform a string num representing a non-negative integer into a special number by deleting as few digits as possible. A special number is defined as an integer divisible by 25. In decimal notation, a number is divisible by 25 if its last two digits are one of 00 , 25 ,...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3317 - Find the Number of Possible Ways for an Event

LeetCode Problem 3317 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics Solution LeetCode 3317 - Find the Number of Possible Ways for an Event Problem Understanding The problem describes an event with n performers and x available stages. Each performer must be assigned to exactly one stage. Multiple performers may share the same stage, which means they form a band together. Some stages may remain unused. After the performers are...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2790 - Maximum Number of Groups With Increasing Length

LeetCode Problem 2790 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Greedy, Sorting Solution LeetCode 2790 - Maximum Number of Groups With Increasing Length Problem Understanding We are given an array usageLimits where usageLimits[i] tells us how many times the number i can be used across all groups. The numbers available are exactly 0 through n - 1 , where n is the length of the array. We want to...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2217 - Find Palindrome With Fixed Length

LeetCode Problem 2217 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem asks us to find the k-th smallest positive palindrome of a fixed length for multiple queries. Specifically, we are given an array queries where each element indicates the position of a palindrome we need to find, and an integer intLength which specifies the number of digits in the palindromes we are interested in. A palindrome is...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2366 - Minimum Replacements to Sort the Array

LeetCode Problem 2366 Difficulty: 🔴 Hard Topics: Array, Math, Greedy Solution Problem Understanding The problem asks us to transform a given integer array nums into a non-decreasing array by performing a sequence of operations. In each operation, we are allowed to replace any single element with any two elements that sum to it . The goal is to compute the minimum number of such operations required to achieve a non-decreasing...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2165 - Smallest Value of the Rearranged Number

LeetCode Problem 2165 Difficulty: 🟡 Medium Topics: Math, Sorting Solution Problem Understanding In this problem, we are given an integer num , which may be positive, negative, or zero. Our goal is to rearrange its digits so that the resulting number is as small as possible while preserving the original sign. The important detail is that the sign cannot change. If the number is positive, the rearranged number must also...

Practice › Codeforces Solutions › Codeforces Round 148 (Div. 1) ›

CF 238A - Not Wool Sequences

CF 238A - Not Wool Sequences Rating: 1300 Tags: constructive algorithms, math Solve time: 5m 18s Verified: yes Solution Problem Understanding We work with arrays of length n , where every element is an integer from 0 to 2^m - 1 . A sequence is called "wool" if there exists some contiguous subarray whose xor is 0 . We are asked to count how many sequences are not wool, meaning...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2750 - Ways to Split Array Into Good Subarrays

LeetCode Problem 2750 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution Problem Understanding The problem asks us to count the number of ways we can split a given binary array nums into contiguous subarrays such that each subarray contains exactly one 1 . The input is a binary array, meaning it only contains 0 s and 1 s. The output is a single integer representing the number of valid...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2867 - Count Valid Paths in a Tree

LeetCode Problem 2867 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Tree, Depth-First Search, Number Theory Solution That is a long, structured reference document with multiple required sections, detailed prose, two full implementations, worked examples, test cases, and edge-case analysis. To keep quality high and avoid truncation, I will provide it in a complete guide format. Before I start, do you want the full guide in a single response , or...

Practice › Codeforces Solutions › Codeforces Round 133 (Div. 2) ›

CF 216A - Tiling with Hexagons

CF 216A - Tiling with Hexagons Rating: 1200 Tags: implementation, math Solve time: 56s Verified: yes Solution Problem Understanding The floor is made from unit hexagonal tiles, and the whole hall itself forms a larger hexagon. The six sides of the hall contain a, b, c, a, b, c tiles respectively as we walk around the boundary. The task is to compute how many unit hexagonal tiles fit inside this...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2912 - Number of Ways to Reach Destination in the Grid

LeetCode Problem 2912 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics Solution LeetCode 2912 - Number of Ways to Reach Destination in the Grid Problem Understanding We are given an n × m grid and two cells: source = [sx, sy] dest = [dx, dy] A move consists of jumping from one cell to another cell that shares either the same row or the same column. The destination cell must...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2566 - Maximum Difference by Remapping a Digit

LeetCode Problem 2566 Difficulty: 🟢 Easy Topics: Math, Greedy Solution Problem Understanding The problem asks us to maximize the difference between two numbers that can be created from a given integer num through a specific remapping operation. We are allowed to choose exactly one digit d1 from 0 through 9 , and replace all occurrences of that digit in num with another digit d2 , which can also be any...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2842 - Count K-Subsequences of a String With Maximum Beauty

LeetCode Problem 2842 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Greedy, Sorting, Combinatorics Solution Problem Understanding The problem requires us to count k-subsequences of a string s that have the maximum beauty , where beauty is defined as the sum of the frequency of each character in the subsequence. A k-subsequence is a subsequence of length k where all characters are unique. The input string can be up to...

Practice › Codeforces Solutions ›

Codeforces Round 122 (Div. 1)

Codeforces Round 122 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1700-2900 | Time: 8m 3s Problem Name Rating Tags Solve Time Verified A Cutting Figure 1700 constructive-algorithms, graphs, trees 1m 41s ✓ B Xor 2000 brute-force 1m 53s ✓ C Hamming Distance 2400 constructive-algorithms, greedy, math 2m 31s ✗ D Two Segments 2900 data-structures 1m 58s ✓

Practice › Codeforces Solutions ›

Codeforces Round 144 (Div. 2)

Codeforces Round 144 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1400 | Time: 2m 15s Problem Name Rating Tags Solve Time Verified A Perfect Permutation 800 implementation, math 1m 26s ✓ B Non-square Equation 1400 binary-search, brute-force, math 49s ✗

Practice › Codeforces Solutions › Codeforces Round 120 (Div. 2) ›

CF 190A - Vasya and the Bus

CF 190A - Vasya and the Bus Rating: 1100 Tags: greedy, math Solve time: 1m 11s Verified: yes Solution Problem Understanding We are asked to compute the minimum and maximum bus fare that a group of passengers could pay under specific rules. There are two groups of passengers: grown-ups and children. Every grown-up pays one ruble for themselves, and they can each bring at most one child for free. A...

Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150C - Smart Cheater

CF 150C - Smart Cheater Rating: 2200 Tags: data structures, math, probabilities Solve time: 2m 11s Verified: yes Solution Problem Understanding We have a straight bus route with fixed stop coordinates. A passenger normally pays the full distance between their boarding and exit stops. The conductor is allowed to "hide" at most one continuous segment of that trip from the ticket. If a passenger travels from stop a to stop...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2376 - Count Special Integers

LeetCode Problem 2376 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution LeetCode 2376 - Count Special Integers Problem Understanding The problem asks us to count how many integers in the range [1, n] contain only distinct digits. A number is considered special if no digit appears more than once in its decimal representation. For example, the number 135 is special because the digits 1 , 3 , and 5 are...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3250 - Find the Count of Monotonic Pairs I

LeetCode Problem 3250 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Combinatorics, Prefix Sum Solution Problem Understanding The problem asks us to count the number of valid pairs of arrays (arr1, arr2) derived from a given array nums . Both arr1 and arr2 have the same length as nums . The constraints on these arrays are: arr1 is non-decreasing . arr2 is non-increasing . At each index i , the...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2440 - Create Components With Same Value

LeetCode Problem 2440 Difficulty: 🔴 Hard Topics: Array, Math, Tree, Depth-First Search, Enumeration Solution Problem Understanding This problem is asking us to take an undirected tree where each node has a numerical value and determine how many edges we can remove such that every resulting connected component has the same total value. The tree is represented by a list of node values nums and a list of edges edges that...

Practice › Codeforces Solutions › Codeforces Round 109 (Div. 1) ›

CF 154B - Colliders

CF 154B - Colliders Rating: 1600 Tags: math, number theory Solve time: 2m 4s Verified: yes Solution Problem Understanding We maintain a set of currently active colliders. Each collider is identified by an integer from 1 to n . The system is safe only if every pair of active colliders is coprime. In other words, no prime factor may appear in two different active numbers at the same time. Each...

Practice › Codeforces Solutions › Codeforces Round 198 (Div. 2) ›

CF 340C - Tourist Problem

CF 340C - Tourist Problem Rating: 1600 Tags: combinatorics, implementation, math Solve time: 4m 39s Verified: yes Solution Problem Understanding We are asked to compute the average distance a tourist would walk if they visited all destinations on a straight road in every possible order, starting from kilometer zero. Each destination is at a distinct, positive integer distance from the starting point. The input is a list of these distances,...

Practice › Codeforces Solutions ›

Codeforces Round 205 (Div. 2)

Codeforces Round 205 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1200-1600 | Time: 5m 32s Problem Name Rating Tags Solve Time Verified A Domino 1200 implementation, math 3m 55s ✓ C Find Maximum 1600 implementation, math, number-theory 1m 37s ✓

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2514 - Count Anagrams

LeetCode Problem 2514 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Combinatorics, Counting Solution Problem Understanding The problem asks us to count how many distinct anagram sentences can be formed from a given string s . The input string contains one or more words separated by single spaces. An anagram sentence must preserve the structure of the original sentence. Specifically, the i-th word in the new sentence must be a...

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201B - Guess That Car!

CF 201B - Guess That Car! Rating: 1800 Tags: math, ternary search Solve time: 1m Verified: yes Solution Problem Understanding The problem places us in a grid-like parking lot of size 4·n by 4·m meters, divided into squares of 4 by 4 meters, each containing a car with a known "rarity" value. Yura, the player, must choose a starting point at one of the intersections of these dividing lines and...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2364 - Count Number of Bad Pairs

LeetCode Problem 2364 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Counting Solution Problem Understanding The problem asks us to count the number of bad pairs in an array. We are given a 0-indexed integer array nums , and a pair of indices (i, j) is considered bad if: i < j j - i != nums[j] - nums[i] In other words, for every pair of indices where the first...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1866 - Number of Ways to Rearrange Sticks With K Sticks Visible

LeetCode Problem 1866 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem gives us n sticks with unique lengths from 1 to n . We must arrange these sticks in some order so that exactly k sticks are visible when looking from the left side. A stick is visible if every stick before it is shorter. In other words, a stick is visible if it creates...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2269 - Find the K-Beauty of a Number

LeetCode Problem 2269 Difficulty: 🟢 Easy Topics: Math, String, Sliding Window Solution Problem Understanding The problem asks us to calculate the k-beauty of a given integer num . To do this, we treat num as a string and examine every possible contiguous substring of length k . For each substring, we interpret it as an integer and check whether it divides the original number num evenly. The final answer is...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3154 - Find Number of Ways to Reach the K-th Stair

LeetCode Problem 3154 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Bit Manipulation, Memoization, Combinatorics Solution Let's dive into a comprehensive solution guide for LeetCode 3154 - Find Number of Ways to Reach the K-th Stair . Problem Understanding This problem involves Alice navigating a staircase starting at stair 1, aiming to reach stair k . The staircase is theoretically infinite, starting at stair 0, and Alice has two operations available:...

Practice › Codeforces Solutions ›

Codeforces Round 153 (Div. 1)

Codeforces Round 153 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 2/5 | Rating range: 1300-3000 | Time: 26m 57s Problem Name Rating Tags Solve Time Verified A Points on Line 1300 binary-search, combinatorics, two-pointers 1m 9s ✓ B Playing with Permutations 1800 implementation, math 8m 15s ✗ C Number Transformation 2000 dp, greedy, number-theory 14m 23s ✗ D Two Sets 2700 bitmasks, math 1m 13s ✓ E...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3304 - Find the K-th Character in String Game I

LeetCode Problem 3304 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation, Recursion, Simulation Solution Problem Understanding The problem defines an infinite string-building process that starts with the string "a" . At every operation, we take the current string and create a transformed version where every character is replaced by the next character in the alphabet. Then we append this transformed string to the original string. For example: "a" becomes "ab" "ab"...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2575 - Find the Divisibility Array of a String

LeetCode Problem 2575 Difficulty: 🟡 Medium Topics: Array, Math, String Solution Problem Understanding The problem gives us a numeric string word and an integer m . For every prefix of the string, we must determine whether that prefix represents a number divisible by m . A prefix word[0...i] means the substring starting at index 0 and ending at index i , inclusive. Since the string contains only digits, every prefix...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2818 - Apply Operations to Maximize Score

LeetCode Problem 2818 Difficulty: 🔴 Hard Topics: Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory Solution Problem Understanding The problem gives us an array nums and an integer k . We begin with a score of 1 , and we are allowed to perform at most k operations. In each operation, we choose a subarray that has not been chosen before. From that subarray, we select the element with...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2110 - Number of Smooth Descent Periods of a Stock

LeetCode Problem 2110 Difficulty: 🟡 Medium Topics: Array, Math, Two Pointers, Dynamic Programming, Sliding Window Solution Problem Understanding This problem is asking us to count all "smooth descent periods" in a stock price array. A smooth descent period is defined as a contiguous sequence of days where the stock price decreases by exactly 1 each day , except the first day which is always counted as a valid period of...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2941 - Maximum GCD-Sum of a Subarray

LeetCode Problem 2941 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Number Theory Solution Problem Understanding The problem asks us to find the maximum gcd-sum of a subarray of a given integer array nums with the constraint that the subarray has at least k elements. The gcd-sum of a subarray is defined as the product of the sum of its elements and the greatest common divisor (GCD) of its elements....

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2178 - Maximum Split of Positive Even Integers

LeetCode Problem 2178 Difficulty: 🟡 Medium Topics: Math, Backtracking, Greedy Solution Problem Understanding The problem is asking us to take an input integer finalSum and split it into the maximum number of unique positive even integers such that their sum equals finalSum . A unique positive even integer means each number in the split must be even, greater than zero, and cannot be repeated. If no valid split exists (for...

Practice › Codeforces Solutions › Codeforces Round 179 (Div. 2) ›

CF 296A - Yaroslav and Permutations

CF 296A - Yaroslav and Permutations Rating: 1100 Tags: greedy, math Solve time: 57s Verified: yes Solution Problem Understanding We are given a sequence of integers, and we are allowed to repeatedly swap adjacent elements. Because adjacent swaps can generate any permutation of the array, the real freedom we have is complete reordering of the elements. The target condition is not about a specific arrangement, but about whether we can...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2591 - Distribute Money to Maximum Children

LeetCode Problem 2591 Difficulty: 🟢 Easy Topics: Math, Greedy Solution Problem Understanding

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2180 - Count Integers With Even Digit Sum

LeetCode Problem 2180 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem asks us to count all positive integers less than or equal to a given number num such that the sum of their digits is even. In other words, we are asked to evaluate each integer 1 through num , compute the sum of its digits, and check whether that sum is divisible by 2. If it...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3012 - Minimize Length of Array Using Operations

LeetCode Problem 3012 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Number Theory Solution Problem Understanding The problem gives us a 0-indexed array of positive integers and asks us to repeatedly perform a specific operation to reduce the array's length as much as possible. The operation involves selecting two distinct indices i and j with positive numbers, inserting nums[i] % nums[j] at the end, and removing the original two elements. The...

Practice › Codeforces Solutions › ABBYY Cup 3.0 ›

CF 316D3 - PE Lesson

CF 316D3 - PE Lesson Rating: 2400 Tags: dp, math Solve time: 3m 11s Verified: yes Solution Problem Understanding We start with a line of students, each holding a uniquely numbered ball from 1 to n in order. The system evolves through operations where a teacher selects two students and swaps the balls they currently hold. This swap does not move students, only the labels of the balls they carry....

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2864 - Maximum Odd Binary Number

LeetCode Problem 2864 Difficulty: 🟢 Easy Topics: Math, String, Greedy Solution LeetCode 2864 - Maximum Odd Binary Number Problem Understanding The problem gives us a binary string s , containing only '0' and '1' characters. We are allowed to rearrange the bits in any order we want, but we must use exactly the same bits that appear in the original string. Our goal is to create the largest possible binary...

Practice › Codeforces Solutions › Codeforces Round 184 (Div. 2) ›

CF 305B - Continued Fractions

CF 305B - Continued Fractions Rating: 1700 Tags: brute force, implementation, math Solve time: 1m 25s Verified: yes Solution Problem Understanding We are given a rational number written as a normal fraction p / q , and another number written as a finite continued fraction. The continued fraction has the form: $$a_1 + \frac{1}{a_2 + \frac{1}{a_3 + \dots}}$$ We must determine whether both representations describe the same rational number. The...

Practice › Codeforces Solutions ›

Codeforces Round 109 (Div. 1)

Codeforces Round 109 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 4/4 | Rating range: 1600-2400 | Time: 6m 30s Problem Name Rating Tags Solve Time Verified A Hometask 1600 greedy 1m 15s ✓ B Colliders 1600 math, number-theory 2m 4s ✓ C Double Profiles 2300 graphs, hashing, sortings 1m 37s ✓ D Flatland Fencing 2400 games, math 1m 34s ✓

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2183 - Count Array Pairs Divisible by K

LeetCode Problem 2183 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Counting, Number Theory Solution Problem Understanding The problem gives us an integer array nums and an integer k . We must count how many index pairs (i, j) satisfy two conditions: i < j nums[i] * nums[j] is divisible by k In other words, for every pair of distinct elements in the array, we check whether their product contains...

Practice › Codeforces Solutions ›

Codeforces Round 125 (Div. 1)

Codeforces Round 125 (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1700-2700 | Time: 6m 48s Problem Name Rating Tags Solve Time Verified A About Bacteria 1700 implementation, math 1m 28s ✓ D Cube Snake 2700 constructive-algorithms 2m 13s ✗ E Gripping Story 2400 binary-search, data-structures, sortings 3m 7s ✗

Practice › Codeforces Solutions › Codeforces Round 112 (Div. 2) ›

CF 165C - Another Problem on Strings

CF 165C - Another Problem on Strings Rating: 1600 Tags: binary search, brute force, dp, math, strings, two pointers Solve time: 1m 20s Verified: yes Solution Problem Understanding We are asked to count substrings of a binary string that contain exactly k ones. A substring is any contiguous sequence of characters within the string, and different occurrences at different positions count separately. For instance, in the string "1010", the substring...

Practice › Codeforces Solutions › Codeforces Round 253 (Div. 1) ›

CF 442B - Andrey and Problem

CF 442B - Andrey and Problem Rating: 1800 Tags: greedy, math, probabilities Solve time: 1m 14s Verified: yes Solution Problem Understanding We are given a set of friends, where each friend independently succeeds in producing a contest problem with a known probability. Andrey will invite some subset of these friends. Once invited, each friend either contributes a problem or does not, independently of the others. The outcome we care about...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1860 - Incremental Memory Leak

LeetCode Problem 1860 Difficulty: 🟡 Medium Topics: Math, Simulation Solution Problem Understanding The problem models a faulty program that continuously consumes memory over time. There are two memory sticks, represented by the integers memory1 and memory2 . At each second, the program allocates an increasing number of bits: At second 1 , it allocates 1 bit. At second 2 , it allocates 2 bits. At second 3 , it allocates...

Practice › Codeforces Solutions › Codeforces Round 102 (Div. 2) ›

CF 143A - Help Vasilisa the Wise 2

CF 143A - Help Vasilisa the Wise 2 Rating: 1000 Tags: brute force, math Solve time: 2m 19s Verified: yes Solution Problem Understanding We need to fill a 2 x 2 grid with four distinct digits from 1 to 9 . The grid looks like this: $$\begin{matrix} a & b \ c & d \end{matrix}$$ The input gives us six sums. The first line contains the required sums of the...

Practice › Codeforces Solutions › Codeforces Round 111 (Div. 2) ›

CF 160C - Find Pair

CF 160C - Find Pair Rating: 1700 Tags: implementation, math, sortings Solve time: 1m 47s Verified: yes Solution Problem Understanding We are given an array of n integers. From this array, we form every ordered pair (a[i], a[j]) , including pairs where i = j . Since both positions are chosen independently, there are exactly n² pairs. All these pairs are sorted lexicographically. That means pairs are ordered first by...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3380 - Maximum Area Rectangle With Point Constraints I

LeetCode Problem 3380 Difficulty: 🟡 Medium Topics: Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration Solution LeetCode 3380 - Maximum Area Rectangle With Point Constraints I Problem Understanding The problem gives us a set of unique points on a 2D plane. We need to determine the largest possible axis-aligned rectangle that can be formed using exactly four of those points as its corners. An axis-aligned rectangle means: The...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3247 - Number of Subsequences with Odd Sum

LeetCode Problem 3247 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem asks us to count how many subsequences of the given array have an odd sum. A subsequence is formed by choosing any subset of elements while preserving their original order. Unlike subarrays, subsequences do not need to be contiguous. For an array of length n , there are 2^n total subsequences, including the...

Practice › Codeforces Solutions › Codeforces Round 144 (Div. 1) ›

CF 232B - Table

CF 232B - Table Rating: 1900 Tags: bitmasks, combinatorics, dp, math Solve time: 8m 46s Verified: no Solution Problem Understanding We are given a table with n rows and m columns. We can place a single point in any cell, and the goal is to fill the table so that every contiguous square subtable of size n × n contains exactly k points. The output is the total number of...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2063 - Vowels of All Substrings

LeetCode Problem 2063 Difficulty: 🟡 Medium Topics: Math, String, Dynamic Programming, Combinatorics Solution Problem Understanding The problem asks us to compute the total number of vowels that appear across every possible substring of a given string. A substring is any contiguous sequence of characters. For a string of length n , there are n * (n + 1) / 2 total substrings. For each substring, we count how many vowels...

Practice › Codeforces Solutions › Codeforces Round 136 (Div. 1) ›

CF 220D - Little Elephant and Triangle

CF 220D - Little Elephant and Triangle Rating: 2500 Tags: geometry, math Solve time: 2m 25s Verified: no Solution Problem Understanding We work on the integer lattice inside a rectangle. Every point $(x,y)$ with $0 \le x \le w$ and $0 \le y \le h$ is available. We must count ordered triples of distinct lattice points that form a nondegenerate triangle whose area is an integer. The word "ordered" changes...

Practice › Codeforces Solutions ›

Codeforces Round 136 (Div. 1)

Codeforces Round 136 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1300-2500 | Time: 8m 14s Problem Name Rating Tags Solve Time Verified A Little Elephant and Problem 1300 implementation, sortings 2m 48s ✓ B Little Elephant and Array 1800 constructive-algorithms, data-structures 1m 7s ✓ C Little Elephant and Shifts 2100 data-structures 1m 54s ✓ D Little Elephant and Triangle 2500 geometry, math 2m...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2579 - Count Total Number of Colored Cells

LeetCode Problem 2579 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem describes a process of coloring cells on an infinite two-dimensional grid over n minutes. At minute 1 , we start by coloring exactly one arbitrary cell blue. For every minute after that, every uncolored cell that shares a side with an already blue cell also becomes blue. In simpler terms, the colored region expands outward one layer...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1952 - Three Divisors

LeetCode Problem 1952 Difficulty: 🟢 Easy Topics: Math, Enumeration, Number Theory Solution Problem Understanding The problem asks us to determine whether a given integer n has exactly three positive divisors . In other words, we want to check if there are precisely three distinct integers d such that n % d == 0 and d > 0 . For example, the number 4 has divisors 1, 2, and 4, which...

Practice › Codeforces Solutions ›

Codeforces Round 142 (Div. 2)

Codeforces Round 142 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1300 | Time: 4m 23s Problem Name Rating Tags Solve Time Verified A Dragons 1000 greedy, sortings 3m 28s ✓ B T-primes 1300 binary-search, implementation, math 55s ✓

Practice › Codeforces Solutions ›

Codeforces Round 253 (Div. 1)

Codeforces Round 253 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1800-3100 | Time: 3m 6s Problem Name Rating Tags Solve Time Verified B Andrey and Problem 1800 greedy, math, probabilities 1m 14s ✓ E Gena and Second Distance 3100 geometry 1m 52s ✗

Practice › Codeforces Solutions › Codeforces Round 184 (Div. 2) ›

CF 305D - Olya and Graph

CF 305D - Olya and Graph Rating: 2200 Tags: combinatorics, math Solve time: 1m 36s Verified: yes Solution Problem Understanding We are given a directed acyclic graph with vertices numbered from 1 to n , where every edge goes from a smaller-numbered vertex to a larger-numbered vertex. Some edges already exist, and we are allowed to add more edges under certain constraints. The main constraints ensure that each vertex i...

Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309A - Morning run

CF 309A - Morning run Rating: 2000 Tags: binary search, math, two pointers Solve time: 4m 7s Verified: yes Solution Problem Understanding We have a circular running track of length l . Each runner starts at a fixed position on the circle, and independently chooses one of two directions with equal probability. Everyone runs at speed 1 . Whenever two runners occupy the same point at the same moment, they...

Practice › Codeforces Solutions › Codeforces Round 175 (Div. 2) ›

CF 285E - Positions in Permutations

CF 285E - Positions in Permutations Rating: 2600 Tags: combinatorics, dp, math Solve time: 1m Verified: yes Solution Problem Understanding We are asked to count permutations of length n where exactly k positions are "good." A position is good if the value at that position differs from the index by exactly 1. For example, in a permutation of length 3, the permutation (2, 1, 3) has good positions at indices...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3280 - Convert Date to Binary

LeetCode Problem 3280 Difficulty: 🟢 Easy Topics: Math, String Solution LeetCode 3280, Convert Date to Binary Problem Understanding The problem gives us a date string in the format yyyy-mm-dd . The year always has four digits, while the month and day always have two digits because of zero padding. We need to convert each of the three components, year, month, and day, into their binary representations. The important detail is...

Practice › Codeforces Solutions ›

Codeforces Round 158 (Div. 2)

Codeforces Round 158 (Div. 2) Type: Div. 2 | Problems: 3 | Verified: 0/3 | Rating range: 1400-2100 | Time: 5m 48s Problem Name Rating Tags Solve Time Verified A Adding Digits 1400 implementation, math 1m 21s ✗ C Balls and Boxes 1700 constructive-algorithms, greedy, implementation 1m 20s ✗ D Black and White Tree 2100 constructive-algorithms, dsu, graphs 3m 7s ✗

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185A - Plant

CF 185A - Plant Rating: 1300 Tags: math Solve time: 1m 38s Verified: yes Solution Problem Understanding We start with exactly one upward-pointing triangle. Every year, each triangle splits into four smaller triangles. Three of them keep the same orientation as the parent, while one flips direction. The input gives the number of years n . After those n years of growth, we must compute how many triangles point upward....

Practice › Codeforces Solutions ›

Codeforces Round 165 (Div. 2)

Codeforces Round 165 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1100-1400 | Time: 3m 31s Problem Name Rating Tags Solve Time Verified A Fancy Fence 1100 geometry, implementation, math 1m 12s ✓ B Multithreading 1400 data-structures, greedy, implementation 2m 19s ✓

Practice › Codeforces Solutions ›

Codeforces Round 204 (Div. 2)

Codeforces Round 204 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1300 | Time: 3m 51s Problem Name Rating Tags Solve Time Verified A Jeff and Digits 1000 brute-force, implementation, math 2m 26s ✓ B Jeff and Periods 1300 implementation, sortings 1m 25s ✓

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2169 - Count Operations to Obtain Zero

LeetCode Problem 2169 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem asks us to count the number of operations required to reduce either of two non-negative integers num1 or num2 to zero. An operation is defined as subtracting the smaller number from the larger one (or subtracting either if they are equal). We continue performing operations until at least one of the numbers becomes zero. The input...

Practice › Codeforces Solutions › Codeforces Round 172 (Div. 1) ›

CF 280E - Sequence Transformation

CF 280E - Sequence Transformation Rating: 3000 Tags: brute force, data structures, dp, implementation, math Solve time: 2m 3s Verified: no Solution Problem Understanding We are given a sorted sequence $x_1, x_2, \dots, x_n$. We want to construct another sequence $y_1, y_2, \dots, y_n$ such that every adjacent difference stays inside a fixed interval: $$a \le y_{i+1} - y_i \le b$$ and every value remains inside $[1, q]$. The cost...

Practice › Codeforces Solutions › Codeforces Round 204 (Div. 2) ›

CF 352A - Jeff and Digits

CF 352A - Jeff and Digits Rating: 1000 Tags: brute force, implementation, math Solve time: 2m 26s Verified: yes Solution Problem Understanding We are given a multiset of cards, each card showing either the digit 0 or the digit 5. From these cards we may choose any subset and arrange the chosen digits into a number written in a single line. Our goal is to build the largest possible number...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2513 - Minimize the Maximum of Two Arrays

LeetCode Problem 2513 Difficulty: 🟡 Medium Topics: Math, Binary Search, Number Theory Solution LeetCode 2513 - Minimize the Maximum of Two Arrays Problem Understanding The problem gives us two empty arrays, arr1 and arr2 , and asks us to fill them with positive integers under several constraints. The first array, arr1 , must contain exactly uniqueCnt1 distinct positive integers, and none of those integers can be divisible by divisor1 ....

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3307 - Find the K-th Character in String Game II

LeetCode Problem 3307 Difficulty: 🔴 Hard Topics: Math, Bit Manipulation, Recursion Solution Problem Understanding The problem describes a string manipulation game between Alice and Bob. Initially, Alice starts with a string word = "a" . Bob provides a list of operations, represented by the integer array operations . Each operation transforms word in a specific way: If operations[i] == 0 , Alice duplicates the current string by appending a copy...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1916 - Count Ways to Build Rooms in an Ant Colony

LeetCode Problem 1916 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatorics Solution Problem Understanding The problem asks us to count the number of valid ways to sequentially build all rooms in an ant colony, given a dependency tree that dictates which rooms must be built before others. Each room i has a predecessor prevRoom[i] that must be built before i . Room...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2195 - Append K Integers With Minimal Sum

LeetCode Problem 2195 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Sorting Solution Problem Understanding The problem asks us to append k unique positive integers to an existing array nums such that none of the integers we add are already in nums , and the sum of the numbers we append is minimized. In other words, we want to pick the smallest k positive integers that are missing from nums ....

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3227 - Vowels Game in a String

LeetCode Problem 3227 Difficulty: 🟡 Medium Topics: Math, String, Brainteaser, Game Theory Solution Problem Understanding The problem describes a two-player game between Alice and Bob played on a string s . Alice always moves first. The rules for each player are based on vowel counts in substrings: Alice can remove any non-empty substring containing an odd number of vowels , while Bob can remove any non-empty substring containing an even...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2470 - Number of Subarrays With LCM Equal to K

LeetCode Problem 2470 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution LeetCode 2470, Number of Subarrays With LCM Equal to K Problem Understanding The problem gives us an integer array nums and an integer k . We must count how many contiguous subarrays have a least common multiple, LCM, exactly equal to k . A subarray is any continuous segment of the array. For every possible subarray, we compute...

Practice › Codeforces Solutions › Codeforces Round 167 (Div. 2) ›

CF 272B - Dima and Sequence

CF 272B - Dima and Sequence Rating: 1400 Tags: implementation, math Solve time: 1m 30s Verified: yes Solution Problem Understanding We are given an array of positive integers. For every number x , a recursive function f(x) is defined as: $f(0)=0,\quad f(2x)=f(x),\quad f(2x+1)=f(x)+1$ The task is to count how many index pairs (i, j) with i < j satisfy f(ai) = f(aj) . The recursive definition looks unusual at first,...

Practice › Codeforces Solutions › Croc Champ 2012 - Round 1 ›

CF 173A - Rock-Paper-Scissors

CF 173A - Rock-Paper-Scissors Rating: 1300 Tags: implementation, math Solve time: 1m 40s Verified: yes Solution Problem Understanding In this problem, two players, Nikephoros and Polycarpus, play multiple rounds of rock-paper-scissors. Each player has a fixed sequence of moves that they cycle through as the rounds progress. The sequences can have different lengths, so after reaching the end of a sequence, a player wraps back to the beginning. A round...

Practice › Codeforces Solutions › VK Cup 2012 Finals, Practice Session ›

CF 209B - Pixels

CF 209B - Pixels Rating: 2100 Tags: constructive algorithms, math Solve time: 1m 41s Verified: yes Solution Problem Understanding We start with three piles of pixels, one red, one green, and one blue. A fight can only happen between two different colors. When that happens, one pixel survives and immediately changes into the third color. For example, if a red and a green pixel fight, the survivor becomes blue. A...

Practice › Codeforces Solutions › VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) ›

CF 174A - Problem About Equation

CF 174A - Problem About Equation Rating: 1100 Tags: math Solve time: 1m 33s Verified: yes Solution Problem Understanding We have several mugs that already contain different amounts of Ber-Cola. There is also some drink left in the bottle. We must pour the entire remaining amount into the mugs so that every mug ends up with exactly the same volume. If the initial amounts are a1, a2, ..., an and...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2954 - Count the Number of Infection Sequences

LeetCode Problem 2954 Difficulty: 🔴 Hard Topics: Array, Math, Combinatorics Solution Problem Understanding This problem asks us to compute the number of valid infection sequences in a line of n people, where some people are initially infected. The array sick represents the indices of people who are already infected at the start. At each step, only an uninfected person adjacent to an infected person can become infected. The goal is...

Practice › Codeforces Solutions › Codeforces Round 132 (Div. 2) ›

CF 215B - Olympic Medal

CF 215B - Olympic Medal Rating: 1300 Tags: greedy, math Solve time: 1m 43s Verified: yes Solution Problem Understanding We are designing a two-part medal. The outer part is a ring with outer radius $r_1$ and inner radius $r_2$. The inner part is a solid disk of radius $r_2$. Both parts have the same thickness, so their masses depend only on area and density. The outer ring uses density $p_1$,...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2197 - Replace Non-Coprime Numbers in Array

LeetCode Problem 2197 Difficulty: 🔴 Hard Topics: Array, Math, Stack, Number Theory Solution Problem Understanding The problem asks us to repeatedly replace adjacent non-coprime numbers in an array with their Least Common Multiple (LCM) until no more adjacent non-coprime pairs exist. Two numbers are non-coprime if their greatest common divisor (GCD) is greater than 1. The final array should be returned after all possible replacements. In other words, given an...

Practice › Codeforces Solutions ›

Codeforces Round 101 (Div. 2)

Codeforces Round 101 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 800-2300 | Time: 10m 27s Problem Name Rating Tags Solve Time Verified A Amusing Joke 800 implementation, sortings, strings 1m 31s ✓ B Hopscotch 1400 geometry, math 1m 26s ✓ C Queue 1800 constructive-algorithms, greedy, sortings 2m 24s ✗ D Take-off Ramps 2300 graphs, shortest-paths 2m 15s ✓ E Clearing Up 2300 constructive-algorithms,...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3115 - Maximum Prime Difference

LeetCode Problem 3115 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution Problem Understanding The problem gives us an integer array nums , and we need to find the maximum distance between the indices of any two prime numbers in the array. More specifically, we are interested in indices i and j such that both nums[i] and nums[j] are prime numbers. Among all such pairs, we want the maximum possible...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2549 - Count Distinct Numbers on Board

LeetCode Problem 2549 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Simulation Solution Problem Understanding The problem starts with a single integer n written on a board. Every day, we examine every number currently on the board. For each number x , we look for all integers i such that: 1 <= i <= n x % i == 1 Whenever such an integer i exists, we add it to...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3099 - Harshad Number

LeetCode Problem 3099 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine whether a given integer is a Harshad number. A Harshad number is an integer that is divisible by the sum of its digits. We are given a single integer x , and we must perform two operations: Compute the sum of all digits in x Check whether x is divisible by that digit...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2550 - Count Collisions of Monkeys on a Polygon

LeetCode Problem 2550 Difficulty: 🟡 Medium Topics: Math, Recursion Solution Problem Understanding In this problem, we have a regular polygon with n vertices, and each vertex initially contains exactly one monkey. Every monkey must move simultaneously to one of its two neighboring vertices. Since each monkey has only two choices, clockwise or counterclockwise, the total number of possible movement configurations is 2^n . A collision occurs in two situations. The...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3128 - Right Triangles

LeetCode Problem 3128 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Combinatorics, Counting Solution Problem Understanding The problem gives us a binary matrix grid , where each cell contains either 0 or 1 . We need to count how many valid right triangles can be formed using cells whose value is 1 . A valid right triangle in this problem is defined by selecting exactly three cells containing 1 such...

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417E - Square Table

CF 417E - Square Table Rating: 2400 Tags: constructive algorithms, math, probabilities Solve time: 1m 48s Verified: yes Solution Problem Understanding We are asked to fill an $n \times m$ grid with positive integers not exceeding $10^8$. The constraint is not about individual cells but about structure: for every row and every column, if we square all numbers in that line and sum them, the result must itself be a...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3378 - Count Connected Components in LCM Graph

LeetCode Problem 3378 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Union-Find, Number Theory Solution Problem Understanding We are given an array nums , where each element represents the value assigned to a node in a graph. The graph contains exactly n nodes, one node for each array element. Two nodes are connected by an undirected edge if the least common multiple of their values is less than or equal...

Practice › Codeforces Solutions › Codeforces Round 142 (Div. 1) ›

CF 229E - Gifts

CF 229E - Gifts Rating: 2600 Tags: combinatorics, dp, math, probabilities Solve time: 2m 48s Verified: yes Solution Problem Understanding We are given a collection of gifts, each with a name and a set of distinct prices. Some names may appear multiple times, each with different prices. The old man can request exactly n gifts, specifying only names. If he requests multiple gifts with the same name, the fish selects...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2847 - Smallest Number With Given Digit Product

LeetCode Problem 2847 Difficulty: 🟡 Medium Topics: Math, Greedy Solution LeetCode 2847 - Smallest Number With Given Digit Product Problem Understanding The problem gives us a positive integer n and asks us to construct the smallest positive integer whose digits multiply together to exactly n . For example, if n = 105 , we need to find some integer whose digits have product 105 . One valid choice is 357...

Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444A - DZY Loves Physics

CF 444A - DZY Loves Physics Rating: 1600 Tags: greedy, math Solve time: 1m 32s Verified: yes Solution Problem Understanding We are given an undirected graph where each vertex carries a positive weight and each edge also carries a positive weight. From this graph we are allowed to pick a subset of vertices, but we are not free to pick them arbitrarily: the chosen vertices must form a connected induced...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2485 - Find the Pivot Integer

LeetCode Problem 2485 Difficulty: 🟢 Easy Topics: Math, Prefix Sum Solution LeetCode 2485 - Find the Pivot Integer Problem Understanding The problem gives us a positive integer n and asks us to find a special integer x , called the pivot integer, such that: The sum of all integers from 1 to x is equal to The sum of all integers from x to n The important detail is that...

Practice › Codeforces Solutions › Codeforces Round 140 (Div. 1) ›

CF 226A - Flying Saucer Segments

CF 226A - Flying Saucer Segments Rating: 1400 Tags: math Solve time: 5m 43s Verified: yes Solution Problem Understanding We are asked to calculate the minimum time required for a group of n aliens to move from the third section of a three-section spacecraft to the first section. The sections are linked linearly: section 1 connects to section 2, section 2 connects to both 1 and 3, and section 3...

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 1) ›

CF 249D - Donkey and Stars

CF 249D - Donkey and Stars Rating: 2700 Tags: data structures, dp, geometry, math, sortings Solve time: 1m 56s Verified: no Solution Problem Understanding We are asked to find the longest chain of stars the Donkey can select under a geometric rule. The stars are points on a plane, and we begin at the origin. From any star, we imagine two rays at fixed angles relative to the horizontal axis....

Practice › Codeforces Solutions ›

Codeforces Round 128 (Div. 2)

Codeforces Round 128 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1200-2300 | Time: 6m 39s Problem Name Rating Tags Solve Time Verified A Two Problems 1200 brute-force, implementation 1m 6s ✓ B Game on Paper 1300 brute-force, implementation 1m 41s ✓ C Photographer 1400 greedy, sortings 1m 5s ✓ D Hit Ball 1700 geometry, implementation, math 1m 20s ✗ E Transportation 2300 greedy,...

Practice › Codeforces Solutions › Codeforces Round 104 (Div. 1) ›

CF 145C - Lucky Subsequence

CF 145C - Lucky Subsequence Rating: 2100 Tags: combinatorics, dp, math Solve time: 2m 5s Verified: yes Solution Problem Understanding We are given an array of integers and must count how many subsequences of length exactly k satisfy a special restriction on lucky numbers. A number is lucky if every decimal digit is either 4 or 7 . Examples are 4 , 47 , and 744 . Numbers like 5...

Practice › Codeforces Solutions › Codeforces Round #FF (Div. 1) ›

CF 446C - DZY Loves Fibonacci Numbers

CF 446C - DZY Loves Fibonacci Numbers Rating: 2400 Tags: data structures, math, number theory Solve time: 6m 32s Verified: no Solution Problem Understanding We are given an array of integers and need to support two types of queries efficiently. The first type requires adding Fibonacci numbers to a contiguous subarray: for indices from l to r , we add F₁ to the element at l , F₂ to the...

Practice › Codeforces Solutions ›

Codeforces Round 237 (Div. 2)

Codeforces Round 237 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 1000-1900 | Time: 12m 42s Problem Name Rating Tags Solve Time Verified A Valera and X 1000 implementation 4m 55s ✗ B Marathon 1500 implementation, math 2m 40s ✗ C Restore Graph 1800 dfs-and-similar, graphs, sortings 3m 31s ✗ D Minesweeper 1D 1900 dp, implementation 1m 36s ✗

Practice › Codeforces Solutions › Codeforces Round 114 (Div. 1) ›

CF 167B - Wizards and Huge Prize

CF 167B - Wizards and Huge Prize Rating: 1800 Tags: dp, math, probabilities Solve time: 1m 38s Verified: no Solution Problem Understanding We are asked to calculate the probability of performing well in a sequence of wizard contests, given both your chances of winning each contest and the types of prizes you may receive. There are n contests, and for each contest, you know your probability of winning and whether...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2505 - Bitwise OR of All Subsequence Sums

LeetCode Problem 2505 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation, Brainteaser, Prefix Sum Solution LeetCode 2505 - Bitwise OR of All Subsequence Sums Problem Understanding This problem asks us to compute the bitwise OR of every possible subsequence sum of a given array. A subsequence is formed by choosing any subset of elements while preserving their original order. Since every element can either be included or excluded, an array...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2600 - K Items With the Maximum Sum

LeetCode Problem 2600 Difficulty: 🟢 Easy Topics: Math, Greedy Solution Problem Understanding The problem asks us to determine the maximum possible sum when picking exactly k items from a bag containing items labeled 1 , 0 , or -1 . The bag's composition is given by three non-negative integers: numOnes for the number of 1 s, numZeros for the number of 0 s, and numNegOnes for the number of -1...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2523 - Closest Prime Numbers in Range

LeetCode Problem 2523 Difficulty: 🟡 Medium Topics: Math, Number Theory Solution Problem Understanding The problem asks us to find two prime numbers inside a given inclusive range [left, right] such that the difference between them is as small as possible. More formally, we need to return two integers [num1, num2] where: left <= num1 < num2 <= right Both numbers are prime The gap num2 - num1 is minimized among...

Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257D - Sum

CF 257D - Sum Rating: 1900 Tags: greedy, math Solve time: 1m 3s Verified: yes Solution Problem Understanding We are given a list of integers representing a sequence where each element is at least as large as the previous one but no more than double the previous one. Our task is to assign either a plus or minus sign to each element so that the resulting sum lies between zero...

Practice › Codeforces Solutions ›

Codeforces Round 206 (Div. 1)

Codeforces Round 206 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 2/5 | Rating range: 1500-2900 | Time: 15m 26s Problem Name Rating Tags Solve Time Verified A Vasya and Robot 1500 brute-force, greedy, math 2m 39s ✓ B Game with Strings 2400 bitmasks, dp, games 2m 1s ✗ C Vasya and Beautiful Arrays 2100 brute-force, dp, number-theory 2m 47s ✓ D Transferring Pyramid 2900 dp 2m 46s...

Practice › Codeforces Solutions › Codeforces Round 117 (Div. 2) ›

CF 182D - Common Divisors

CF 182D - Common Divisors Rating: 1400 Tags: brute force, hashing, implementation, math, strings Solve time: 1m 36s Verified: yes Solution Problem Understanding We are given two lowercase strings. A string d is called a divisor of another string s if s can be formed by concatenating d several times in a row. For example, "ab" divides "ababab" because repeating "ab" three times gives the full string. On the other...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2849 - Determine if a Cell Is Reachable at a Given Time

LeetCode Problem 2849 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding This problem asks whether it is possible to reach a specific target cell (fx, fy) from a starting cell (sx, sy) in an infinite 2D grid in exactly t seconds. Each second, movement must occur to one of the eight adjacent cells, including diagonals. The grid is effectively unbounded, so we do not have to worry about borders. The...

Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348A - Mafia

CF 348A - Mafia Rating: 1600 Tags: binary search, math, sortings Solve time: 4m 1s Verified: yes Solution Problem Understanding We are given a group of n friends who want to play multiple rounds of Mafia, but in each round only one person acts as the supervisor while the remaining n −1 players participate as regular players. Each friend specifies the number of rounds they wish to play as a...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1925 - Count Square Sum Triples

LeetCode Problem 1925 Difficulty: 🟢 Easy Topics: Math, Enumeration Solution Problem Understanding This problem asks us to count all ordered triples (a, b, c) such that: 1 <= a, b, c <= n a² + b² = c² This is the classic Pythagorean theorem relationship. Any triple satisfying this condition is called a square triple in the problem statement. The important detail is that the triples are ordered. This means...

Practice › Codeforces Solutions ›

Codeforces Round 132 (Div. 2)

Codeforces Round 132 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 900-2100 | Time: 8m 51s Problem Name Rating Tags Solve Time Verified A Bicycle Chain 900 brute-force, implementation 1m 25s ✓ B Olympic Medal 1300 greedy, math 1m 43s ✓ C Crosses 2100 brute-force, implementation 1m 39s ✓ D Hot Days 1900 greedy 1m 6s ✓ E Periodical Numbers 2100 combinatorics, dp, number-theory...

Practice › Codeforces Solutions › Codeforces Round 252 (Div. 2) ›

CF 441E - Valera and Number

CF 441E - Valera and Number Rating: 2400 Tags: bitmasks, dp, math, probabilities Solve time: 1m 40s Verified: no Solution Problem Understanding We are asked to model a simple randomized iterative process. We start with a number $x$ and perform $k$ steps. In each step, a random number between 1 and 100 is drawn. With probability $p/100$, the current number is doubled; otherwise, it is incremented by 1. After performing...

Practice › Codeforces Solutions › Codeforces Round #FF (Div. 1) ›

CF 446E - DZY Loves Bridges

CF 446E - DZY Loves Bridges Rating: 3100 Tags: math, matrices Solve time: 1m 25s Verified: no Solution Problem Understanding We are dealing with a very large directed walk-counting problem on a graph that is heavily structured but too large to ever build explicitly. There are $2m$ islands, and DZY starts from a home node. From home, he can move to island $i$ in $a_i$ different ways. After that first...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3377 - Digit Operations to Make Two Integers Equal

LeetCode Problem 3377 Difficulty: 🟡 Medium Topics: Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path Solution Problem Understanding The problem asks us to transform one integer n into another integer m by repeatedly modifying individual digits of n . At each step, we can increase a digit that is not 9 or decrease a digit that is not 0. However, there is a strict constraint: n cannot ever...

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201A - Clear Symmetry

CF 201A - Clear Symmetry Rating: 1700 Tags: constructive algorithms, dp, math Solve time: 1m 9s Verified: yes Solution Problem Understanding We are asked to construct a square matrix of size n × n , filled with zeros and ones, that satisfies two properties: it must be clear, meaning that no two ones are adjacent horizontally or vertically, and it must be symmetrical along both the horizontal and vertical axes....

Practice › Codeforces Solutions › Codeforces Round 122 (Div. 2) ›

CF 194B - Square

CF 194B - Square Rating: 1200 Tags: math Solve time: 1m 31s Verified: yes Solution Problem Understanding We have a person walking around the border of a square whose side length is n . He starts at the lower-left corner and places a cross there immediately. After that, he keeps moving clockwise along the perimeter, placing another cross every n + 1 meters. The walk continues until he reaches the...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3233 - Find the Count of Numbers Which Are Not Special

LeetCode Problem 3233 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution Problem Understanding The problem asks us to count how many integers in the inclusive range [l, r] are not special . A number is considered special if it has exactly two proper divisors. A proper divisor of a number x is any positive divisor of x other than x itself. For example: Proper divisors of 4 are 1...

Practice › Codeforces Solutions ›

Codeforces Round 238 (Div. 2)

Codeforces Round 238 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 900-2300 | Time: 15m 46s Problem Name Rating Tags Solve Time Verified A Gravity Flip 900 greedy, implementation, sortings 6m 21s ✗ B Domino Effect 1100 - 1m 23s ✗ C Unusual Product 1600 implementation, math 1m 27s ✗ E Graph Cutting 2300 dfs-and-similar, graphs 6m 35s ✗

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3014 - Minimum Number of Pushes to Type Word I

LeetCode Problem 3014 Difficulty: 🟢 Easy Topics: Math, String, Greedy Solution LeetCode 3014 - Minimum Number of Pushes to Type Word I Problem Understanding We are given a word consisting of distinct lowercase English letters. We are allowed to completely redesign the mapping of letters onto the telephone keypad keys 2 through 9 . There are 8 available keys ( 2 to 9 ). Each letter must be assigned to...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1884 - Egg Drop With 2 Eggs and N Floors

LeetCode Problem 1884 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution LeetCode 1884 - Egg Drop With 2 Eggs and N Floors Problem Understanding This problem asks us to determine the minimum number of moves required to identify a critical floor f in a building with n floors, using exactly two eggs. The critical floor f has the following meaning: Any egg dropped from a floor higher than f will...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3382 - Maximum Area Rectangle With Point Constraints II

LeetCode Problem 3382 Difficulty: 🔴 Hard Topics: Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting Solution Problem Understanding The problem asks us to find the maximum area rectangle that can be formed from a given set of points on a 2D plane, under strict constraints. Each rectangle must have its edges parallel to the x and y axes, must use exactly four points from the input as corners, and...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1927 - Sum Game

LeetCode Problem 1927 Difficulty: 🟡 Medium Topics: Math, String, Greedy, Game Theory Solution Problem Understanding The problem describes a two player game played on a numeric string of even length. The string contains digits and possibly some '?' characters. Alice and Bob alternate turns replacing one '?' with a digit from '0' to '9' . Alice moves first. At the end of the game, every '?' has been replaced. The...

Practice › Codeforces Solutions ›

Codeforces Round 129 (Div. 1)

Codeforces Round 129 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1500-2800 | Time: 5m 54s Problem Name Rating Tags Solve Time Verified A Little Elephant and Interval 1500 binary-search, combinatorics, dp 1m 39s ✓ B Little Elephant and Cards 1500 binary-search, data-structures 1m 8s ✓ C Little Elephant and Furik and Rubik 2000 math, probabilities 1m 23s ✗ D Little Elephant and Retro...

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436B - Om Nom and Spiders

CF 436B - Om Nom and Spiders Rating: 1400 Tags: implementation, math Solve time: 3m 56s Verified: no Solution Problem Understanding We have a rectangular grid representing the park. Some cells initially contain spiders, and each spider permanently moves in one fixed direction: left, right, up, or down. Every second, a spider moves to the adjacent cell in that direction. If it steps outside the grid, it disappears. Om Nom...

Practice › Codeforces Solutions › Codeforces Round 102 (Div. 1) ›

CF 142A - Help Farmer

CF 142A - Help Farmer Rating: 1600 Tags: brute force, math Solve time: 1m 53s Verified: yes Solution Problem Understanding After the theft, the barn contains a smaller rectangular box of hay blocks. If the original dimensions were $A \times B \times C$, then the remaining pile has dimensions $(A-1) \times (B-2) \times (C-2)$. We are given only the number of remaining blocks: $$n = (A-1)(B-2)(C-2)$$ The task is to...

Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255E - Furlo and Rublo and Game

CF 255E - Furlo and Rublo and Game Rating: 2200 Tags: games, implementation, math Solve time: 1m 51s Verified: yes Solution Problem Understanding We have several independent piles of coins. A move picks one pile with size x and replaces it with some smaller value y such that $$x^{1/4} \le y \le x^{1/2}$$ and y < x . The player who cannot make a move loses. Since moves affect only...

Practice › Codeforces Solutions ›

Codeforces Round 239 (Div. 1)

Codeforces Round 239 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1600-3100 | Time: 10m 34s Problem Name Rating Tags Solve Time Verified B Long Path 1600 dp, implementation 1m 3s ✗ C Curious Array 2500 brute-force, combinatorics, implementation 34s ✗ D Largest Submatrix 3 2700 dp, hashing 4m 21s ✗ E k-d-sequence 3100 data-structures 4m 36s ✗

Practice › Codeforces Solutions ›

Codeforces Round 156 (Div. 2)

Codeforces Round 156 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2200 | Time: 10m 7s Problem Name Rating Tags Solve Time Verified A Greg's Workout 800 implementation 2m 19s ✓ B Code Parsing 1200 implementation 2m 19s ✓ C Almost Arithmetical Progression 1500 brute-force, dp 2m 19s ✓ D Mr. Bender and Square 1800 binary-search, implementation, math 1m 19s ✓ E Furlo and...

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 1) ›

CF 249E - Endless Matrix

CF 249E - Endless Matrix Rating: 2600 Tags: math Solve time: 3m 28s Verified: no Solution Problem Understanding We are asked to work with an infinite matrix that is filled in a very specific order. Each cell contains a positive integer, starting from 1, and the ordering rule is based on the maximum of the row and column indices. Specifically, if you look at the cells in order of increasing...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2139 - Minimum Moves to Reach Target Score

LeetCode Problem 2139 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to transform the integer 1 into the integer target using the minimum number of moves. At every move, we are allowed to perform one of two operations: Increment the current number by 1 Double the current number The important restriction is that the doubling operation can only be used at most maxDoubles times. Increment...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2868 - The Wording Game

LeetCode Problem 2868 Difficulty: 🔴 Hard Topics: Array, Math, Two Pointers, String, Greedy, Game Theory Solution Problem Understanding The problem describes a turn-based game between Alice and Bob, where both players have a lexicographically sorted list of words. Alice always starts by playing her lexicographically smallest word , and the players then alternate turns. On each turn, the current player must select a word from their list that is closely...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3001 - Minimum Moves to Capture The Queen

LeetCode Problem 3001 Difficulty: 🟡 Medium Topics: Math, Enumeration Solution LeetCode 3001 - Minimum Moves to Capture The Queen Problem Understanding This problem gives us the positions of three chess pieces on a standard 8 x 8 chessboard: A white rook at (a, b) A white bishop at (c, d) A black queen at (e, f) We are allowed to move only the white pieces. The queen remains stationary. Our...

Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255D - Mr. Bender and Square

CF 255D - Mr. Bender and Square Rating: 1800 Tags: binary search, implementation, math Solve time: 1m 19s Verified: yes Solution Problem Understanding We are asked to simulate the spread of a signal across an n × n grid. Initially, a single cell at row x and column y is turned on, and in each second, any cell that is side-adjacent to a turned-on cell also turns on. The goal...

Practice › Codeforces Solutions ›

RCC 2014 Warmup (Div. 2)

RCC 2014 Warmup (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1400-2400 | Time: 7m 19s Problem Name Rating Tags Solve Time Verified A Elimination 1500 dp, implementation, math 1m 39s ✓ B Crash 1400 implementation 1m 29s ✓ C Football 1400 constructive-algorithms, graphs, implementation 1m 49s ✓ D Cunning Gena 1900 bitmasks, dp, greedy 34s ✗ E Square Table 2400 constructive-algorithms, math, probabilities...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2310 - Sum of Numbers With Units Digit K

LeetCode Problem 2310 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Greedy, Enumeration Solution Problem Understanding This problem asks us to construct a set of positive integers such that: Every number in the set has a units digit equal to k . The sum of all numbers equals num . We want the smallest possible number of integers in the set. If it is impossible to create such a set, we...

Practice › Codeforces Solutions ›

Croc Champ 2013 - Finals (online version, Div. 1)

Croc Champ 2013 - Finals (online version, Div. 1) Type: Div. 1 | Problems: 4 | Verified: 4/4 | Rating range: 1900-2900 | Time: 12m 12s Problem Name Rating Tags Solve Time Verified A Morning run 2000 binary-search, math, two-pointers 4m 7s ✓ C Memory for Arrays 1900 binary-search, bitmasks, greedy 3m 39s ✓ D Tennis Rackets 2700 brute-force, geometry 1m 52s ✓ E Sheep 2900 binary-search, greedy 2m 34s...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1954 - Minimum Garden Perimeter to Collect Enough Apples

LeetCode Problem 1954 Difficulty: 🟡 Medium Topics: Math, Binary Search Solution Problem Understanding The problem describes an infinite two dimensional grid where every integer coordinate (i, j) contains an apple tree. The number of apples on a tree is determined by the Manhattan distance from the origin: $$|i| + |j|$$ We want to buy a square plot of land that is centered at (0, 0) and whose sides are parallel...

Practice › Codeforces Solutions ›

Codeforces Round 148 (Div. 1)

Codeforces Round 148 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1300-2900 | Time: 16m 8s Problem Name Rating Tags Solve Time Verified A Not Wool Sequences 1300 constructive-algorithms, math 5m 18s ✓ B Boring Partition 1800 constructive-algorithms 3m 56s ✓ C World Eater Brothers 2100 dfs-and-similar, dp, greedy 2m 5s ✓ D Tape Programming 2900 data-structures, implementation 1m 30s ✓ E Meeting Her...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3009 - Maximum Number of Intersections on the Chart

LeetCode Problem 3009 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Binary Indexed Tree, Geometry, Sweep Line, Sorting Solution I can provide the full guide, but I want to avoid giving you a technically incorrect reference document. For LeetCode 3009 , there are two subtly different interpretations that materially change the optimal algorithm and correctness proof: whether intersections at a chart vertex (k, y[k]) count once or twice when both...

Practice › Codeforces Solutions › Codeforces Round 244 (Div. 2) ›

CF 427E - Police Patrol

CF 427E - Police Patrol Rating: 2000 Tags: greedy, implementation, math, ternary search Solve time: 1m 54s Verified: yes Solution Problem Understanding All criminals stand on the x-axis, and we must choose one integer coordinate for the police station. The patrol car starts from the station, visits some criminals, brings them back to the station, then repeats until everyone is arrested. Each trip can carry at most m criminals. The...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2413 - Smallest Even Multiple

LeetCode Problem 2413 Difficulty: 🟢 Easy Topics: Math, Number Theory Solution Problem Understanding The problem asks us to find the smallest positive integer that is a multiple of both 2 and a given positive integer n . In other words, we are looking for the least common multiple (LCM) of 2 and n . The input n is guaranteed to be between 1 and 150 , which is a very...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2521 - Distinct Prime Factors of Product of Array

LeetCode Problem 2521 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Number Theory Solution Problem Understanding The problem asks us to compute the number of distinct prime factors in the product of an array of positive integers, nums . In simpler terms, we are given a list of numbers, and we want to know how many unique prime numbers appear if we were to multiply all the numbers together and...

Practice › Codeforces Solutions ›

Codeforces Round 176 (Div. 1)

Codeforces Round 176 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 2/2 | Rating range: 2200-2800 | Time: 2m 31s Problem Name Rating Tags Solve Time Verified B Shifting 2200 implementation 1m 1s ✓ E Ladies' Shop 2800 constructive-algorithms, fft, math 1m 30s ✓

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2816 - Double a Number Represented as a Linked List

LeetCode Problem 2816 Difficulty: 🟡 Medium Topics: Linked List, Math, Stack Solution Problem Understanding This problem asks us to double a number represented as a singly linked list. Each node of the list contains a single digit, and the digits are stored in the order from most significant to least significant. For example, the list [1,8,9] represents the number 189. The task is to compute 2 * number and return...

Practice › Codeforces Solutions ›

Codeforces Round 114 (Div. 1)

Codeforces Round 114 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1600-3000 | Time: 10m 57s Problem Name Rating Tags Solve Time Verified A Wizards and Trolleybuses 1600 implementation, math 1m 40s ✓ B Wizards and Huge Prize 1800 dp, math, probabilities 1m 38s ✗ C Wizards and Numbers 2300 games, math 1m 39s ✗ D Wizards and Roads 3000 data-structures, divide-and-conquer, graph-matchings 2m...

Practice › Codeforces Solutions › Codeforces Round 178 (Div. 2) ›

CF 294A - Shaass and Oskols

CF 294A - Shaass and Oskols Rating: 800 Tags: implementation, math Solve time: 1m 38s Verified: yes Solution Problem Understanding We have several wires stacked vertically. Each wire contains some birds sitting in a row from left to right. Every shot targets exactly one bird on one wire. When a bird on wire x is shot at position y , three things happen immediately: The bird itself disappears. Every bird...

Practice › Codeforces Solutions ›

Codeforces Round 204 (Div. 1)

Codeforces Round 204 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1800-2700 | Time: 4m 1s Problem Name Rating Tags Solve Time Verified A Jeff and Rounding 1800 dp, greedy, implementation 1m 37s ✗ D Jeff and Removing Periods 2700 data-structures 2m 24s ✓

Practice › Codeforces Solutions › Codeforces Round 123 (Div. 2) ›

CF 195D - Analyzing Polyline

CF 195D - Analyzing Polyline Rating: 1900 Tags: geometry, math, sortings Solve time: 1m 28s Verified: no Solution Problem Understanding We are asked to consider a set of linear functions, each defined by a slope $k_i$ and intercept $b_i$, and to analyze their sum. If we take the sum of $n$ such functions, the resulting graph is piecewise-linear, meaning it is composed of straight line segments joined at certain x-coordinates....

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3091 - Apply Operations to Make Sum of Array Greater Than or Equal to k

LeetCode Problem 3091 Difficulty: 🟡 Medium Topics: Math, Greedy, Enumeration Solution Problem Understanding The problem gives us a single positive integer k . We start with an array containing exactly one element: nums = [1] We are allowed to perform two kinds of operations any number of times: Increase the value of any existing element by 1 Duplicate any existing element and append the duplicate to the array Our goal...

Practice › Codeforces Solutions › Codeforces Round 157 (Div. 1) ›

CF 258D - Little Elephant and Broken Sorting

CF 258D - Little Elephant and Broken Sorting Rating: 2600 Tags: dp, math, probabilities Solve time: 3m 30s Verified: yes Solution Problem Understanding We are given a permutation of the numbers from 1 to n, and a sequence of m operations. Each operation targets two positions in the array. When the program runs, each operation is uncertain: independently, it either does nothing or swaps the two elements at those positions,...

Practice › Codeforces Solutions › Croc Champ 2012 - Final ›

CF 183A - Headquarters

CF 183A - Headquarters Rating: 1700 Tags: constructive algorithms, math Solve time: 1m 52s Verified: yes Solution Problem Understanding The car started somewhere on the infinite 2D grid and eventually reached the ice-cream stall at (0, 0) . We know the number of moves and the order of the GPS records, but each record only tells us a set of possible directions for that step. For example, "UR" means the...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2442 - Count Number of Distinct Integers After Reverse Operations

LeetCode Problem 2442 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Counting Solution Problem Understanding The problem asks us to compute the number of distinct integers in an array after performing a specific operation on each element: reversing its digits and adding it to the array. In other words, for every integer in nums , we generate its reverse and append it. After processing all original elements, we count how...

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251D - Two Sets

CF 251D - Two Sets Rating: 2700 Tags: bitmasks, math Solve time: 1m 13s Verified: yes Solution Problem Understanding We are given a sequence of non-negative integers and must split it into two groups. One group remains with Petya and the other is given to Masha. For each group we compute the XOR of all numbers assigned to it, and we call these values x1 and x2. The objective is...

Practice › Codeforces Solutions ›

Codeforces Round 164 (Div. 2)

Codeforces Round 164 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 800-2300 | Time: 7m 8s Problem Name Rating Tags Solve Time Verified A Games 800 brute-force 1m 29s ✓ C Beautiful Sets of Points 1500 constructive-algorithms, implementation 1m 33s ✗ D Wall Bars 2300 dp 2m 21s ✓ E Playlist 2100 math, probabilities, sortings 1m 45s ✓

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3312 - Sorted GCD Pair Queries

LeetCode Problem 3312 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sum Solution === 1996-G1 === IMO 1996 Shortlist G1 Origin: GBR Problem Let triangle $ABC$ have orthocenter $H$, and let $P$ be a point on its circumcircle, distinct from $A$, $B$, $C$. Let $E$ be the foot of the altitude $BH$, let $PAQB$ and $PARC$ be parallelograms, and let $AQ$ meet $HR$...

Practice › Codeforces Solutions ›

Codeforces Round 138 (Div. 2)

Codeforces Round 138 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1100-1500 | Time: 2m 3s Problem Name Rating Tags Solve Time Verified A Parallelepiped 1100 brute-force, geometry, math 1m 1s ✓ B Array 1500 bitmasks, implementation, two-pointers 1m 2s ✓

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2489 - Number of Substrings With Fixed Ratio

LeetCode Problem 2489 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Prefix Sum Solution Problem Understanding The problem gives us a binary string s , along with two coprime integers num1 and num2 . We need to count how many non-empty substrings contain 0 s and 1 s in the exact ratio num1 : num2 . If a substring contains: zeroCount zeros oneCount ones then it is valid only if:...

Practice › Codeforces Solutions ›

Codeforces Round 157 (Div. 1)

Codeforces Round 157 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 2000-2600 | Time: 6m 43s Problem Name Rating Tags Solve Time Verified C Little Elephant and LCM 2000 binary-search, combinatorics, dp 3m 13s ✗ D Little Elephant and Broken Sorting 2600 dp, math, probabilities 3m 30s ✓

Practice › Codeforces Solutions ›

Codeforces Round 124 (Div. 2)

Codeforces Round 124 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1400-1600 | Time: 2m 55s Problem Name Rating Tags Solve Time Verified A Plate Game 1600 constructive-algorithms, games, math 1m 22s ✓ B Limit 1400 math 1m 33s ✓

Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335E - Counting Skyscrapers

CF 335E - Counting Skyscrapers Rating: 2800 Tags: dp, math, probabilities Solve time: 2m 50s Verified: no Solution Problem Understanding We have a sequence of skyscrapers, each with a height chosen randomly and independently according to a geometric distribution where floor i exists with probability 2⁻ⁱ. The number of skyscrapers is unknown, but uniformly distributed between 2 and 314!. We are asked to relate two counting strategies across these skyscrapers....

Practice › Codeforces Solutions › Codeforces Round 126 (Div. 2) ›

CF 200E - Tractor College

CF 200E - Tractor College Rating: 2400 Tags: implementation, math, number theory, ternary search Solve time: 1m 46s Verified: yes Solution Problem Understanding We are given the final exam results of a college where every student receives exactly one of three grades: 3, 4, or 5. Every student with the same grade must receive the same scholarship amount. If we denote these amounts as k3 , k4 , and k5...

Practice › Codeforces Solutions ›

Codeforces Round 202 (Div. 1)

Codeforces Round 202 (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1600-2800 | Time: 8m 10s Problem Name Rating Tags Solve Time Verified A Mafia 1600 binary-search, math, sortings 4m 1s ✓ D Turtles 2500 dp, matrices 2m 37s ✗ E Pilgrims 2800 dfs-and-similar, dp, trees 1m 32s ✗

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1924 - Erect the Fence II

LeetCode Problem 1924 Difficulty: 🔴 Hard Topics: Array, Math, Geometry Solution Here is a fully detailed technical solution guide for LeetCode 1924 - Erect the Fence II , following your formatting instructions: Problem Understanding The problem asks us to compute the minimum enclosing circle for a set of points in 2D space, where each point represents a tree. We are given a list of trees as coordinates trees[i] = [xi,...

Practice › Codeforces Solutions ›

Codeforces Round 122 (Div. 2)

Codeforces Round 122 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 900-1200 | Time: 2m 59s Problem Name Rating Tags Solve Time Verified A Exams 900 implementation, math 1m 28s ✓ B Square 1200 math 1m 31s ✓

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 1) ›

CF 406E - Hamming Triples

CF 406E - Hamming Triples Rating: 2800 Tags: implementation, math, two pointers Solve time: 4m 23s Verified: no Solution Problem Understanding The problem presents a collection of binary strings of a fixed length, but rather than giving the strings explicitly, each string is described compactly: the first $f_i$ bits are the same, $s_i$, and the remaining $n-f_i$ bits are the opposite of $s_i$. Each string is therefore strictly increasing or...

Practice › Codeforces Solutions ›

Codeforces Round 126 (Div. 2)

Codeforces Round 126 (Div. 2) Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 800-2400 | Time: 7m 2s Problem Name Rating Tags Solve Time Verified B Drinks 800 implementation, math 1m 33s ✓ C Football Championship 1800 brute-force, implementation 3m 43s ✓ E Tractor College 2400 implementation, math, number-theory 1m 46s ✓

Practice › Codeforces Solutions › Codeforces Round 123 (Div. 2) ›

CF 195A - Let's Watch Football

CF 195A - Let's Watch Football Rating: 1000 Tags: binary search, brute force, math Solve time: 1m 24s Verified: yes Solution Problem Understanding The video consumes a units of data every second while being watched. The internet connection downloads only b units per second, and a > b , so if the users start immediately, the buffer will eventually run out. They can wait for some integer number of seconds...

Practice › Codeforces Solutions ›

Codeforces Round 133 (Div. 2)

Codeforces Round 133 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1200-2000 | Time: 7m 31s Problem Name Rating Tags Solve Time Verified A Tiling with Hexagons 1200 implementation, math 56s ✓ B Forming Teams 1700 dfs-and-similar, implementation 1m 27s ✓ C Hiring Staff 1800 greedy 2m 5s ✗ D Spider's Web 1700 binary-search, sortings, two-pointers 1m 26s ✗ E Martian Luck 2000 math,...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2447 - Number of Subarrays With GCD Equal to K

LeetCode Problem 2447 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution LeetCode 2447 - Number of Subarrays With GCD Equal to K Problem Understanding The problem gives us an integer array nums and an integer k . We need to count how many contiguous subarrays have a greatest common divisor (GCD) exactly equal to k . A subarray is any non-empty contiguous segment of the array. For every possible...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3044 - Most Frequent Prime

LeetCode Problem 3044 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Matrix, Counting, Enumeration, Number Theory Solution Problem Understanding The problem asks us to traverse a m x n integer matrix and generate numbers by moving in straight lines along eight possible directions: east, south-east, south, south-west, west, north-west, north, and north-east. Starting from any cell, we can append the digits along a chosen path to form numbers. Importantly, numbers...

Practice › Codeforces Solutions › Codeforces Round 109 (Div. 1) ›

CF 154D - Flatland Fencing

CF 154D - Flatland Fencing Rating: 2400 Tags: games, math Solve time: 1m 34s Verified: yes Solution Problem Understanding Two players stand on integer points of a number line. On each turn, the current player chooses a new integer coordinate inside a fixed interval relative to their current position. If the first player is at position x , he may move to any integer point in [x + a, x...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2651 - Calculate Delayed Arrival Time

LeetCode Problem 2651 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to calculate the arrival time of a train given its scheduled arrivalTime and the amount of delayedTime . Both times are expressed in hours using the 24-hour clock format. The goal is to determine the new arrival time after accounting for the delay. For example, if a train was scheduled to arrive at 15:00 and...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3283 - Maximum Number of Moves to Kill All Pawns

LeetCode Problem 3283 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmask Solution Problem Understanding The problem gives us a 50 x 50 chessboard containing exactly one knight and up to 15 pawns. The knight starts at position (kx, ky) , and every pawn is placed at one of the coordinates in positions . Two players, Alice and Bob, alternate turns. Alice moves first. During a...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1969 - Minimum Non-Zero Product of the Array Elements

LeetCode Problem 1969 Difficulty: 🟡 Medium Topics: Math, Greedy, Recursion Solution LeetCode 1969, Minimum Non-Zero Product of the Array Elements Problem Understanding The problem gives us an integer p and defines an array containing every number from 1 to 2^p - 1 . Each number is represented in binary using exactly p bits. We are allowed to repeatedly perform a special operation. In one operation, we choose two numbers and...

Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150A - Win or Freeze

CF 150A - Win or Freeze Rating: 1400 Tags: games, math, number theory Solve time: 2m 2s Verified: no Solution Problem Understanding We start with a number q written on paper. On each turn, a player must replace the current number with one of its non-trivial divisors, meaning a divisor strictly between 1 and the number itself. If a player cannot make a move, that player wins immediately. This is...

Practice › Codeforces Solutions › Codeforces Testing Round 5 ›

CF 267A - Subtractions

CF 267A - Subtractions Rating: 900 Tags: math, number theory Solve time: 2m 41s Verified: yes Solution Problem Understanding We repeatedly apply the same operation to two positive integers. At every step, we subtract the smaller value from the larger one. The process stops as soon as one number becomes zero. The task is to count how many subtraction operations are performed for each pair. For example, starting from (4,...

Practice › Codeforces Solutions › Codeforces Round 144 (Div. 2) ›

CF 233A - Perfect Permutation

CF 233A - Perfect Permutation Rating: 800 Tags: implementation, math Solve time: 1m 26s Verified: yes Solution Problem Understanding We need to construct a permutation of numbers from 1 to n with two conditions. The first condition is p[p[i]] = i for every position i . Applying the permutation twice must return us to the original index. This means every element points back to its partner. The second condition is...

Practice › Codeforces Solutions › Codeforces Round 142 (Div. 2) ›

CF 230B - T-primes

CF 230B - T-primes Rating: 1300 Tags: binary search, implementation, math, number theory Solve time: 55s Verified: yes Solution Problem Understanding We are asked to identify T-primes in a list of positive integers. A T-prime is defined as a number that has exactly three distinct positive divisors. Thinking about divisors, the only way a number can have exactly three is if it is the square of a prime number. For...

Practice › Codeforces Solutions › Codeforces Round 166 (Div. 2) ›

CF 271E - Three Horses

CF 271E - Three Horses Rating: 2200 Tags: constructive algorithms, math, number theory Solve time: 2m 10s Verified: yes Solution Problem Understanding We start with exactly one card (x, y) where 1 ≤ x < y ≤ m . Three operations are available. The gray horse increases both numbers by one: (a, b) → (a + 1, b + 1) . The white horse works only when both numbers are...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2525 - Categorize Box According to Criteria

LeetCode Problem 2525 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem requires categorizing a box based on its dimensions and mass according to given criteria. We are given four integers: length , width , height , and mass . The output is a string that represents the category of the box: "Bulky" , "Heavy" , "Both" , or "Neither" . A box is "Bulky" if any dimension is...

Practice › Codeforces Solutions › Codeforces Round 101 (Div. 2) ›

CF 141B - Hopscotch

CF 141B - Hopscotch Rating: 1400 Tags: geometry, math Solve time: 1m 26s Verified: yes Solution Problem Understanding We are asked to determine whether a stone thrown onto a hopscotch court lands strictly inside a square, and if so, to identify which square. The court is constructed from squares of side length a , arranged in rows with a repeating 1-1-2-1-2 pattern. Each square is numbered sequentially starting from the...

Practice › Codeforces Solutions ›

Croc Champ 2013 - Round 2

Croc Champ 2013 - Round 2 Type: Special | Problems: 4 | Verified: 4/4 | Rating range: 1500-2700 | Time: 8m 33s Problem Name Rating Tags Solve Time Verified A Weird Game 1500 games, greedy 53s ✓ C Cube Problem 2400 brute-force, math, number-theory 1m 36s ✓ D Ksusha and Square 2700 geometry, math, probabilities 1m 59s ✓ E Close Vertices 2700 data-structures, divide-and-conquer, trees 4m 5s ✓

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3032 - Count Numbers With Unique Digits II

LeetCode Problem 3032 Difficulty: 🟢 Easy Topics: Hash Table, Math, Dynamic Programming Solution Problem Understanding The problem asks us to count how many integers in the inclusive range [a, b] contain only unique digits . A number has unique digits if no digit appears more than once within that number. For example, the number 123 has unique digits because 1 , 2 , and 3 each appear exactly once. However,...

Practice › Codeforces Solutions › Codeforces Round 164 (Div. 2) ›

CF 268E - Playlist

CF 268E - Playlist Rating: 2100 Tags: math, probabilities, sortings Solve time: 1m 45s Verified: yes Solution Problem Understanding We are asked to determine the maximum expected total listening time for Manao's playlist, given that each song has a certain probability of being liked and a fixed length. The playlist is dynamic: every time Manao encounters a song he dislikes, he replays all previously liked songs before moving on. The...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2946 - Matrix Similarity After Cyclic Shifts

LeetCode Problem 2946 Difficulty: 🟢 Easy Topics: Array, Math, Matrix, Simulation Solution Problem Understanding This problem asks us to determine whether a matrix remains identical to its original form after applying a specific cyclic shifting operation exactly k times. We are given an m x n integer matrix mat , where m is the number of rows and n is the number of columns. Each row is processed differently depending...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2862 - Maximum Element-Sum of a Complete Subset of Indices

LeetCode Problem 2862 Difficulty: 🔴 Hard Topics: Array, Math, Number Theory Solution LeetCode 2862 - Maximum Element-Sum of a Complete Subset of Indices Problem Understanding The array nums is 1-indexed , meaning the first element corresponds to index 1 , the second element corresponds to index 2 , and so on. We want to select a subset of indices such that for every pair of selected indices i and j...

Practice › Codeforces Solutions › Codeforces Round 139 (Div. 2) ›

CF 225E - Unsolvable

CF 225E - Unsolvable Rating: 2100 Tags: math, number theory Solve time: 3m 28s Verified: yes Solution Problem Understanding The equation in the statement is $$\left\lfloor \frac{x}{y} \right\rfloor + \left\lfloor \frac{y}{x} \right\rfloor = z$$ and we want all positive integers $z$ for which this equation has no solution in positive integers $x,y$. The sequence of such numbers is increasing: $$z_1, z_2, z_3, \dots$$ Given $n$, we must output $z_n \bmod...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2947 - Count Beautiful Substrings I

LeetCode Problem 2947 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Enumeration, Number Theory, Prefix Sum Solution LeetCode 2947 - Count Beautiful Substrings I Problem Understanding We are given a lowercase English string s and a positive integer k . We must count how many non-empty substrings satisfy the definition of a beautiful substring. For a substring, let: vowels be the number of vowel characters ( a , e ,...

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248E - Piglet's Birthday

CF 248E - Piglet's Birthday Rating: 2600 Tags: dp, math, probabilities Solve time: 2m 17s Verified: no Solution Problem Understanding We are asked to compute the expected number of shelves that have no untasted honey pots after a series of actions. Each shelf starts with some number of honey pots. Winnie moves a small number of pots from one shelf to another, tasting them in the process. Every pot on...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3021 - Alice and Bob Playing Flower Game

LeetCode Problem 3021 Difficulty: 🟡 Medium Topics: Math Solution LeetCode 3021 - Alice and Bob Playing Flower Game Problem Understanding The game consists of two flower lanes containing x and y flowers respectively. Alice moves first, and on every turn a player removes exactly one flower from either lane. A very important observation is that the players do not have any meaningful strategic choice. Regardless of which lane a flower...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2457 - Minimum Addition to Make Integer Beautiful

LeetCode Problem 2457 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to transform a given integer n into a beautiful integer by adding the smallest non-negative integer x . An integer is defined as beautiful if the sum of its digits is less than or equal to a given target . The input consists of two numbers: n (the original number) and target (the maximum...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2038 - Remove Colored Pieces if Both Neighbors are the Same Color

LeetCode Problem 2038 Difficulty: 🟡 Medium Topics: Math, String, Greedy, Game Theory Solution Problem Understanding This problem describes a two-player game played on a line of colored pieces. The input colors is a string representing these pieces, where each character is either 'A' or 'B' . Alice always moves first and can only remove 'A' pieces that are surrounded on both sides by 'A' . Bob moves second and can...

Practice › Codeforces Solutions › Codeforces Round 163 (Div. 2) ›

CF 266E - More Queries to Array...

CF 266E - More Queries to Array... Rating: 2500 Tags: data structures, math Solve time: 2m 23s Verified: yes Solution Problem Understanding We maintain an array under two operations. The first operation assigns a constant value to an entire subarray. If we receive = l r x , every position from l through r becomes x . The second operation asks for a weighted sum over a subarray. For a...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2249 - Count Lattice Points Inside a Circle

LeetCode Problem 2249 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Geometry, Enumeration Solution Problem Understanding The problem asks us to determine how many lattice points lie inside at least one of a set of circles on a 2D grid. Each circle is represented by a triplet [xi, yi, ri] , where (xi, yi) is the circle's center and ri is its radius. A lattice point is any point on...

Practice › Codeforces Solutions › Codeforces Round 106 (Div. 2) ›

CF 149C - Division into Teams

CF 149C - Division into Teams Rating: 1500 Tags: greedy, math, sortings Solve time: 1m 40s Verified: no Solution Problem Understanding We have a group of boys, each with a skill level in football. The task is to split them into two teams such that the teams are nearly equal in size and the total skill levels of the teams are roughly balanced. Formally, if there are n boys, we...

Practice › Codeforces Solutions › Codeforces Round 142 (Div. 1) ›

CF 229C - Triangles

CF 229C - Triangles Rating: 1900 Tags: combinatorics, graphs, math Solve time: 2m 5s Verified: yes Solution Problem Understanding We start with a complete undirected graph on n vertices. Every pair of vertices has exactly one edge between them. Alice keeps m of those edges, and Bob receives all remaining edges. The task is to count how many triangles exist in Alice's graph plus how many triangles exist in Bob's...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3300 - Minimum Element After Replacement With Digit Sum

LeetCode Problem 3300 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to transform an array of integers nums by replacing each element with the sum of its digits . After this transformation, we need to determine the minimum element in the resulting array. The input array nums consists of 1 to 100 elements, and each element ranges from 1 to 10,000. The constraints ensure that...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2507 - Smallest Value After Replacing With Sum of Prime Factors

LeetCode Problem 2507 Difficulty: 🟡 Medium Topics: Math, Simulation, Number Theory Solution Problem Understanding The problem asks us to repeatedly replace a number n with the sum of its prime factors until it reaches the smallest value it can take. Prime factors should be counted with multiplicity, meaning that if a prime factor divides n multiple times, it is added to the sum as many times as it divides n...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3352 - Count K-Reducible Numbers Less Than N

LeetCode Problem 3352 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming, Combinatorics Solution Problem Understanding The problem asks us to count the number of positive integers less than n (where n is given in binary as a string s ) that are k-reducible . An integer x is k-reducible if applying the operation "replace x with the count of set bits in its binary representation" at most k times eventually...

Practice › Codeforces Solutions › Codeforces Round 201 (Div. 1) ›

CF 346A - Alice and Bob

CF 346A - Alice and Bob Rating: 1600 Tags: games, math, number theory Solve time: 3m 49s Verified: yes Solution Problem Understanding We start with a collection of distinct integers. On each move, the current player picks any two numbers from the set and inserts their absolute difference, but only if that difference is not already present. The set grows over time, and the game ends when a player cannot...

Practice › Codeforces Solutions › Codeforces Round 163 (Div. 2) ›

CF 266C - Below the Diagonal

CF 266C - Below the Diagonal Rating: 2100 Tags: constructive algorithms, greedy, math Solve time: 2m 17s Verified: no Solution Problem Understanding We are given an $n \times n$ binary matrix with exactly $n-1$ ones. We may swap any two rows or any two columns. The goal is to rearrange the matrix so that every one ends up strictly below the main diagonal. In other words, if a one is...

Practice › Codeforces Solutions ›

Codeforces Round 137 (Div. 2)

Codeforces Round 137 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 1200-1900 | Time: 6m 42s Problem Name Rating Tags Solve Time Verified A Shooshuns and Sequence 1200 brute-force, implementation 1m 25s ✓ B Cosmic Tables 1300 data-structures, implementation 1m 33s ✓ C Reducing Fractions 1800 implementation, math, number-theory 34s ✗ E Decoding Genome 1900 dp, matrices 3m 10s ✓

Practice › Codeforces Solutions ›

Codeforces Round 102 (Div. 1)

Codeforces Round 102 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1600-3000 | Time: 13m 21s Problem Name Rating Tags Solve Time Verified A Help Farmer 1600 brute-force, math 1m 53s ✓ B Help General 1800 constructive-algorithms, greedy, implementation 1m 38s ✓ C Help Caretaker 2300 brute-force, dp 1m 30s ✓ D Help Shrek and Donkey 2 2600 games 2m 34s ✓ E Help...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1999 - Smallest Greater Multiple Made of Two Digits

LeetCode Problem 1999 Difficulty: 🟡 Medium Topics: Math, Enumeration Solution Problem Understanding The problem asks us to find the smallest integer that satisfies three specific conditions. Given an integer k and two digits digit1 and digit2 , we need an integer that is strictly larger than k , is a multiple of k , and consists only of the two given digits . The integer must also fit within the...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2436 - Minimum Split Into Subarrays With GCD Greater Than One

LeetCode Problem 2436 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Greedy, Number Theory Solution Problem Understanding The problem requires splitting a given array of positive integers into contiguous subarrays such that the greatest common divisor (GCD) of each subarray is strictly greater than 1. The goal is to minimize the number of subarrays after splitting. In simpler terms, we need to partition the array into the fewest contiguous segments...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2992 - Number of Self-Divisible Permutations

LeetCode Problem 2992 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask Solution Problem Understanding The problem asks us to count how many permutations of the numbers 1 through n satisfy a special condition called self-divisible. We start with the array: [1, 2, 3, ..., n] We must rearrange these numbers into every possible permutation, then determine whether the permutation is valid. A permutation a...

Practice › Codeforces Solutions › Codeforces Round 140 (Div. 1) ›

CF 226C - Anniversary

CF 226C - Anniversary Rating: 2400 Tags: data structures, implementation, math, matrices, number theory Solve time: 2m 19s Verified: yes Solution Problem Understanding We are asked to work with a contiguous range of integers from l to r , and for every possible subset of size k within this range, we consider the Fibonacci numbers at positions given by the subset elements. Among all subsets, we must find the maximum...

Practice › Codeforces Solutions › Codeforces Round 206 (Div. 1) ›

CF 354A - Vasya and Robot

CF 354A - Vasya and Robot Rating: 1500 Tags: brute force, greedy, math Solve time: 2m 39s Verified: yes Solution Problem Understanding Vasya has a line of items, each with a specific weight, and he wants a robot to pick all of them using its two arms. The left arm can take the leftmost item and the right arm can take the rightmost item. Each pick costs energy proportional to...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3047 - Find the Largest Area of Square Inside Two Rectangles

LeetCode Problem 3047 Difficulty: 🟡 Medium Topics: Array, Math, Geometry Solution Problem Understanding The problem asks us to find the largest square that can fit inside the overlapping region of at least two rectangles on a 2D plane. Each rectangle is axis-aligned, meaning its sides are parallel to the x-axis and y-axis. The rectangles are defined by their bottom-left and top-right coordinates, which are given as integer pairs in two...

Practice › Codeforces Solutions ›

Codeforces Round 236 (Div. 2)

Codeforces Round 236 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 1/4 | Rating range: 1100-2200 | Time: 11m 10s Problem Name Rating Tags Solve Time Verified A Nuts 1100 greedy, math 4m 11s ✗ B Trees in a Row 1400 brute-force, implementation 2m 19s ✗ D Upgrading Array 1800 dp, greedy, math 1m 3s ✓ E Strictly Positive Matrix 2200 graphs, math 3m 37s ✗

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185B - Mushroom Scientists

CF 185B - Mushroom Scientists Rating: 1800 Tags: math, ternary search Solve time: 1m 19s Verified: yes Solution Problem Understanding We are asked to find a point in three-dimensional space, with non-negative coordinates, such that the sum of the coordinates does not exceed a given value $S$. The “distance” of this point is defined not by the usual Euclidean metric, but by the mushroom scientists’ metric: $x^a \cdot y^b \cdot...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1998 - GCD Sort of an Array

LeetCode Problem 1998 Difficulty: 🔴 Hard Topics: Array, Math, Union-Find, Sorting, Number Theory Solution Problem Understanding The problem asks whether it is possible to sort an integer array nums into non-decreasing order using a very specific type of swap. You can swap any two elements nums[i] and nums[j] if and only if their greatest common divisor (GCD) is greater than 1. The input is an array of integers ranging from...

Practice › Codeforces Solutions › Codeforces Round 196 (Div. 1) ›

CF 338D - GCD Table

CF 338D - GCD Table Rating: 2900 Tags: chinese remainder theorem, math, number theory Solve time: 1m 33s Verified: yes Solution Problem Understanding We are asked to determine whether a given sequence of numbers appears as consecutive elements in some row of a hypothetical GCD table. The table has n rows and m columns, where each element at row i and column j is the greatest common divisor of i...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2761 - Prime Pairs With Target Sum

LeetCode Problem 2761 Difficulty: 🟡 Medium Topics: Array, Math, Enumeration, Number Theory Solution Problem Understanding The problem asks us to find all pairs of prime numbers (x, y) such that both numbers are between 1 and n inclusive, their sum equals n , and x <= y . The input is a single integer n , and the output is a sorted list of pairs [x, y] meeting these conditions,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 99 (Div. 2)

Codeforces Beta Round 99 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1600 | Time: 2m 53s Problem Name Rating Tags Solve Time Verified A Petr and Book 1000 implementation 1m 26s ✓ B Wallpaper 1600 implementation, math 1m 27s ✓

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3153 - Sum of Digit Differences of All Pairs

LeetCode Problem 3153 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Counting Solution Problem Understanding The problem asks us to compute the total digit difference across every pair of numbers in the array. All numbers have the same number of digits. For any two numbers, their digit difference is defined as the number of positions where the digits are different. For example: 13 and 23 differ only at the first...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3027 - Find the Number of Ways to Place People II

LeetCode Problem 3027 Difficulty: 🔴 Hard Topics: Array, Math, Geometry, Sorting, Enumeration Solution Problem Understanding The problem asks us to determine how many valid placements of Alice and Bob exist on a 2D grid of points such that Alice can build a rectangular fence with her position as the upper left corner and Bob’s position as the lower right corner . A placement is only valid if no other person...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3179 - Find the N-th Value After K Seconds

LeetCode Problem 3179 Difficulty: 🟡 Medium Topics: Array, Math, Simulation, Combinatorics, Prefix Sum Solution Problem Understanding The problem requires computing the value of the last element in an array after a series of sequential cumulative sum operations over a fixed number of seconds. You start with an array a of length n where all elements are initialized to 1. Every second, each element at index i becomes the sum of...

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 2) ›

CF 405C - Unusual Product

CF 405C - Unusual Product Rating: 1600 Tags: implementation, math Solve time: 1m 27s Verified: no Solution

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2443 - Sum of Number and Its Reverse

LeetCode Problem 2443 Difficulty: 🟡 Medium Topics: Math, Enumeration Solution Here’s a complete, detailed solution guide for LeetCode 2443 - Sum of Number and Its Reverse , fully following your formatting rules. Problem Understanding The problem asks whether a given non-negative integer num can be expressed as the sum of a non-negative integer x and its reversed version reverse(x) . In other words, we are asked to find whether there...

Practice › Codeforces Solutions › Codeforces Round 160 (Div. 1) ›

CF 261B - Maxim and Restaurant

CF 261B - Maxim and Restaurant Rating: 1900 Tags: dp, math, probabilities Solve time: 2m 19s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 119 (Div. 2)

Codeforces Round 119 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1300-1300 | Time: 4m 24s Problem Name Rating Tags Solve Time Verified A Cut Ribbon 1300 brute-force, dp 1m 31s ✓ B Counting Rhombi 1300 brute-force, math 2m 53s ✓

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417A - Elimination

CF 417A - Elimination Rating: 1500 Tags: dp, implementation, math Solve time: 1m 39s Verified: yes Solution Problem Understanding We are organizing a programming competition where the goal is to select at least $n \cdot m$ finalists. Participants can qualify in three ways: first, by winning one of the main elimination rounds, which has $c$ problems and produces $n$ winners; second, by winning one of the additional elimination rounds, which...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2572 - Count the Number of Square-Free Subsets

LeetCode Problem 2572 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask Solution Problem Understanding The problem asks us to count all non-empty subsets of a given array nums such that the product of the elements in each subset is square-free . A square-free integer is an integer not divisible by the square of any prime greater than 1. In other words, in its prime factorization,...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2235 - Add Two Integers

LeetCode Problem 2235 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem is asking for the sum of two integers num1 and num2 . In simpler terms, you are given two numbers, and you need to calculate their total. The input integers can be negative, zero, or positive, and the output should be a single integer representing the sum. The constraints specify that both num1 and num2 are within...

Practice › Codeforces Solutions › Codeforces Round 160 (Div. 1) ›

CF 261C - Maxim and Matrix

CF 261C - Maxim and Matrix Rating: 2000 Tags: constructive algorithms, dp, math Solve time: 1m 11s Verified: yes Solution Problem Understanding We are given a very large range of possible values for a parameter m, and for each such value a deterministic procedure produces a matrix filled using bitwise XOR rules. The matrix has size (m + 1) by (m + 1), and the filling follows a fixed recursive...

Practice › Codeforces Solutions ›

Codeforces Round 201 (Div. 1)

Codeforces Round 201 (Div. 1) Type: Div. 1 | Problems: 1 | Verified: 1/1 | Rating range: 1600-1600 | Time: 3m 49s Problem Name Rating Tags Solve Time Verified A Alice and Bob 1600 games, math, number-theory 3m 49s ✓

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1922 - Count Good Numbers

LeetCode Problem 1922 Difficulty: 🟡 Medium Topics: Math, Recursion Solution LeetCode 1922, Count Good Numbers Problem Understanding The problem asks us to count how many digit strings of length n satisfy a specific positional rule. A digit string is considered "good" when: Every digit placed at an even index, meaning indices 0, 2, 4, ... , must itself be an even digit. Every digit placed at an odd index, meaning...

Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257C - View Angle

CF 257C - View Angle Rating: 1800 Tags: brute force, geometry, math Solve time: 2m 43s Verified: yes Solution Problem Understanding We are asked to find the smallest angle with its vertex at the origin that contains all given points (mannequins) on a 2D plane. Each point is defined by integer coordinates, and no mannequin is located at the origin itself. The goal is to compute this angle in degrees...

Practice › Codeforces Solutions › Codeforces Round 247 (Div. 2) ›

CF 431D - Random Task

CF 431D - Random Task Rating: 2100 Tags: binary search, bitmasks, combinatorics, dp, math Solve time: 2m 1s Verified: yes Solution Problem Understanding We need to find a positive integer n such that inside the interval (n, 2n] , exactly m numbers have exactly k ones in their binary representation. Another way to phrase the condition is this: If f(x) denotes the number of integers in [0, x] whose binary...

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 2) ›

CF 139B - Wallpaper

CF 139B - Wallpaper Rating: 1600 Tags: implementation, math Solve time: 1m 27s Verified: yes Solution Problem Understanding We are asked to compute the minimum cost to paper all walls in an apartment where each room is a rectangular prism. For each room, the length, width, and height are given. The perimeter of a room determines how many strips of wallpaper are needed. Each type of wallpaper comes in rolls...

Practice › Codeforces Solutions › Codeforces Round 163 (Div. 2) ›

CF 266D - BerDonalds

CF 266D - BerDonalds Rating: 2400 Tags: graphs, math, shortest paths Solve time: 2m 9s Verified: no Solution Problem Understanding We are given a connected weighted undirected graph representing a road network. Junctions are graph vertices, roads are weighted edges, and the restaurant may be placed anywhere, not only at vertices but also at any point along an edge. For a chosen location, its quality is determined by the distance...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2048 - Next Greater Numerically Balanced Number

LeetCode Problem 2048 Difficulty: 🟡 Medium Topics: Hash Table, Math, Backtracking, Counting, Enumeration Solution Problem Understanding The problem asks us to find the smallest integer strictly greater than n such that the number is numerically balanced. A number is numerically balanced when every digit that appears in the number appears exactly as many times as its value. For example: 22 is balanced because digit 2 appears exactly 2 times. 1333...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2544 - Alternating Digit Sum

LeetCode Problem 2544 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to compute an alternating sum of the digits of a positive integer. The alternation starts from the most significant digit, which always has a positive sign. Every following digit flips the sign from the previous one. For example, if the number is 521 , the calculation becomes: +5 -2 +1 The final answer is 4...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2709 - Greatest Common Divisor Traversal

LeetCode Problem 2709 Difficulty: 🔴 Hard Topics: Array, Math, Union-Find, Number Theory Solution Understood. I will provide the complete, detailed reference guide for LeetCode 2702 - Minimum Operations to Make Numbers Non-positive , following your formatting rules exactly. Problem Understanding The problem provides a 0-indexed integer array nums and two integers x and y . You are allowed to perform the following operation any number of times: choose an index...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3326 - Minimum Division Operations to Make Array Non Decreasing

LeetCode Problem 3326 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Number Theory Solution Problem Understanding The problem asks us to make a given integer array nums non-decreasing by performing a specific type of operation any number of times. Each operation consists of selecting an element and dividing it by its greatest proper divisor . A proper divisor of a number x is a positive integer less than x that divides...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3100 - Water Bottles II

LeetCode Problem 3100 Difficulty: 🟡 Medium Topics: Math, Simulation Solution Problem Understanding This problem models a bottle exchange process where the exchange rate increases after every successful trade. You start with numBottles full water bottles. Every time you drink a full bottle, it becomes an empty bottle. Empty bottles can then be exchanged for new full bottles, but there is an important rule: after each exchange, the required number of...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2601 - Prime Subtraction Operation

LeetCode Problem 2601 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Greedy, Number Theory Solution Problem Understanding The problem gives us an integer array nums and asks whether it is possible to transform the array into a strictly increasing sequence by performing a special operation. For any index i , we may choose that index at most once and subtract a prime number p from nums[i] , where p must...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3222 - Find the Winning Player in Coin Game

LeetCode Problem 3222 Difficulty: 🟢 Easy Topics: Math, Simulation, Game Theory Solution Problem Understanding The game gives us two types of coins: x coins worth 75 y coins worth 10 Two players, Alice and Bob, take turns. Alice always moves first. On every turn, the current player must select coins whose total value is exactly 115 . If a player cannot make such a move, that player loses immediately. We...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3007 - Maximum Number That Sum of the Prices Is Less Than or Equal to K

LeetCode Problem 3007 Difficulty: 🟡 Medium Topics: Math, Binary Search, Dynamic Programming, Bit Manipulation Solution Problem Understanding The problem asks us to find the largest integer num such that the accumulated price of all numbers from 1 to num does not exceed a given threshold k . The price of a single number is determined by the number of set bits (1s) at specific positions in its binary representation, specifically...

Practice › Codeforces Solutions ›

Codeforces Round 104 (Div. 1)

Codeforces Round 104 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1200-2900 | Time: 10m 29s Problem Name Rating Tags Solve Time Verified A Lucky Conversion 1200 greedy, implementation 2m 2s ✓ B Lucky Number 2 1800 constructive-algorithms 2m 22s ✓ C Lucky Subsequence 2100 combinatorics, dp, math 2m 5s ✓ D Lucky Pair 2900 combinatorics, data-structures, implementation 1m 48s ✗ E Lucky Queries...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2019 - The Score of Students Solving Math Expression

LeetCode Problem 2019 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, String, Dynamic Programming, Stack, Memoization Solution LeetCode 2019, The Score of Students Solving Math Expression Problem Understanding The problem gives us a mathematical expression string s containing only: Single digit numbers 0-9 Addition operators + Multiplication operators * The expression is guaranteed to be valid. For example: 3+5*2 7+3*1*2 Students were supposed to evaluate the expression using the correct...

Practice › Codeforces Solutions ›

Codeforces Round 242 (Div. 2)

Codeforces Round 242 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: 900-2500 | Time: 20m 42s Problem Name Rating Tags Solve Time Verified A Squats 900 implementation 57s ✗ B Megacity 1200 binary-search, greedy, implementation 5m 55s ✗ C Magic Formulas 1600 math 6m ✗ D Biathlon Track 2300 binary-search, brute-force, constructive-algorithms 1m 21s ✗ E Colored Jenga 2500 dfs-and-similar, dp, probabilities 6m 29s...

Practice › Codeforces Solutions › Codeforces Round 138 (Div. 2) ›

CF 224A - Parallelepiped

CF 224A - Parallelepiped Rating: 1100 Tags: brute force, geometry, math Solve time: 1m 1s Verified: yes Solution Problem Understanding We are given three positive integers representing the areas of three faces of a rectangular parallelepiped that meet at a single vertex. Each area corresponds to the product of two edge lengths: one face is the product of edges $a$ and $b$, another $b$ and $c$, and the third $a$...

Practice › Codeforces Solutions ›

Codeforces Round 254 (Div. 1)

Codeforces Round 254 (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 2/3 | Rating range: 1600-2700 | Time: 4m 8s Problem Name Rating Tags Solve Time Verified A DZY Loves Physics 1600 greedy, math 1m 32s ✓ D DZY Loves Strings 2500 binary-search, hashing, strings 1m 6s ✓ E DZY Loves Planting 2700 binary-search, dsu, trees 1m 30s ✗

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2929 - Distribute Candies Among Children II

LeetCode Problem 2929 Difficulty: 🟡 Medium Topics: Math, Combinatorics, Enumeration Solution Problem Understanding The problem asks us to calculate the total number of ways to distribute n candies among exactly three children, with the constraint that no child can receive more than limit candies. Essentially, we are asked to enumerate all possible triplets (a, b, c) of non-negative integers that satisfy two conditions: a + b + c = n...

Practice › Codeforces Solutions › Codeforces Round #FF (Div. 1) ›

CF 446D - DZY Loves Games

CF 446D - DZY Loves Games Rating: 2800 Tags: math, matrices, probabilities Solve time: 1m 41s Verified: no Solution Problem Understanding We are given an undirected connected graph representing a maze of rooms. DZY starts at room 1 with a fixed number of lives. Each time he is in a room, he randomly chooses one of its outgoing corridors uniformly and moves to the adjacent room. Every time he enters...

Practice › Codeforces Solutions › Codeforces Round 114 (Div. 1) ›

CF 167E - Wizards and Bets

CF 167E - Wizards and Bets Rating: 2900 Tags: dfs and similar, graphs, math, matrices Solve time: 3m 52s Verified: yes Solution Problem Understanding We are given a directed acyclic graph. Some vertices are sources, meaning no edge enters them. Some vertices are sinks, meaning no edge leaves them. The number of sources and sinks is guaranteed to be equal. A valid configuration consists of vertex-disjoint directed paths such that...

Practice › Codeforces Solutions › Codeforces Round 115 ›

CF 175D - Plane of Tanks: Duel

CF 175D - Plane of Tanks: Duel Rating: 2400 Tags: brute force, dp, math, probabilities Solve time: 2m 32s Verified: yes Solution Problem Understanding Two tanks fight each other. Each tank has hit points, a reload time, a damage interval, and a probability that its shot fails to penetrate armor. Whenever a tank fires, one of two things happens. Either the shell does not penetrate, in which case the target...

Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150B - Quantity of Strings

CF 150B - Quantity of Strings Rating: 1600 Tags: combinatorics, dfs and similar, graphs, math Solve time: 1m 40s Verified: yes Solution Problem Understanding We want to count strings of length n built from an alphabet of size m , under one strong restriction: every substring of length k must be a palindrome. A substring of length k starting at position i contains characters $$s_i, s_{i+1}, \dots, s_{i+k-1}$$ and being...

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 2) ›

CF 197A - Plate Game

CF 197A - Plate Game Rating: 1600 Tags: constructive algorithms, games, math Solve time: 1m 22s Verified: yes Solution Problem Understanding We have a rectangular table with dimensions a × b and an unlimited supply of identical circular plates with radius r . Two players alternate placing plates on the table. Every plate must lie completely inside the rectangle, and plates may touch but cannot overlap. The game ends when...

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166E - Tetrahedron

CF 166E - Tetrahedron Rating: 1500 Tags: dp, math, matrices Solve time: 3m Verified: yes Solution Problem Understanding We are asked to count the number of ways an ant can start at vertex D of a tetrahedron and return to D after exactly n steps, moving along edges at every step. The tetrahedron has four vertices labeled A, B, C, D, and each vertex is connected to the other three....

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2125 - Number of Laser Beams in a Bank

LeetCode Problem 2125 Difficulty: 🟡 Medium Topics: Array, Math, String, Matrix Solution LeetCode 2125 - Number of Laser Beams in a Bank Problem Understanding The problem describes a bank floor plan as a binary matrix, represented by an array of strings. Each row corresponds to one row in the bank, and each character in the string represents a cell. A '1' means there is a security device installed in that...

Practice › Codeforces Solutions › Codeforces Round 195 (Div. 2) ›

CF 336D - Vasily the Bear and Beautiful Strings

CF 336D - Vasily the Bear and Beautiful Strings Rating: 2100 Tags: combinatorics, math, number theory Solve time: 3m 11s Verified: yes Solution Problem Understanding We are asked to count the number of binary strings containing exactly n zeros and m ones that can be reduced, through a sequence of specific operations, to a single character g . The operation allowed is to take the last two characters of a...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2745 - Construct the Longest New String

LeetCode Problem 2745 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Greedy, Brainteaser Solution LeetCode 2745 - Construct the Longest New String Problem Understanding The problem gives us three types of fixed two-character strings: "AA" appears x times "BB" appears y times "AB" appears z times We may choose any subset of these strings and concatenate them in any order. The goal is to build the longest possible resulting string while...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2541 - Minimum Operations to Make Array Equal II

LeetCode Problem 2541 Difficulty: 🟡 Medium Topics: Array, Math, Greedy Solution

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1863 - Sum of All Subset XOR Totals

LeetCode Problem 1863 Difficulty: 🟢 Easy Topics: Array, Math, Backtracking, Bit Manipulation, Combinatorics, Enumeration Solution LeetCode 1863 - Sum of All Subset XOR Totals Problem Understanding This problem asks us to compute the sum of the XOR values of every possible subset of a given array. A subset is formed by choosing any combination of elements from the array, including the empty subset and the full array itself. Since an...

Practice › Codeforces Solutions ›

Codeforces Round 166 (Div. 2)

Codeforces Round 166 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 1300-2200 | Time: 7m 9s Problem Name Rating Tags Solve Time Verified B Prime Matrix 1300 binary-search, brute-force, math 1m 46s ✓ C Secret 1500 constructive-algorithms, implementation 1m 31s ✗ D Good Substrings 1800 data-structures, strings 1m 42s ✓ E Three Horses 2200 constructive-algorithms, math, number-theory 2m 10s ✓

Practice › Codeforces Solutions ›

Codeforces Round 100

Codeforces Round 100 Type: Special | Problems: 6 | Verified: 3/6 | Rating range: 1700-2600 | Time: 12m 15s Problem Name Rating Tags Solve Time Verified A New Year Table 1700 geometry, math 1m 45s ✓ B New Year Cards 1800 brute-force, greedy, implementation 2m 41s ✗ C New Year Snowmen 1800 binary-search, data-structures, greedy 2m ✗ D New Year Contest 1800 greedy, sortings 1m 55s ✓ E New Year...

Practice › Codeforces Solutions › Codeforces Round 148 (Div. 2) ›

CF 239A - Two Bags of Potatoes

CF 239A - Two Bags of Potatoes Rating: 1200 Tags: greedy, implementation, math Solve time: 1m 23s Verified: yes Solution Problem Understanding We know the second bag contains y potatoes. The first bag originally contained some positive number x , but that value was lost. The only remaining information is that the total number of potatoes, x + y , was divisible by k and did not exceed n ....

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2949 - Count Beautiful Substrings II

LeetCode Problem 2949 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Number Theory, Prefix Sum Solution Problem Understanding The problem asks us to find the number of non-empty substrings in a given string s that satisfy two conditions simultaneously. First, the substring must have an equal number of vowels and consonants. Second, the product of the number of vowels and consonants must be divisible by a given integer k ....

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2851 - String Transformation

LeetCode Problem 2851 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming, String Matching Solution Problem Understanding The problem asks us to transform a string s into a target string t using a very specific operation: choosing a non-empty suffix of s (not the whole string) and moving it to the front. The operation can be repeated exactly k times, and we are asked to count the number of distinct sequences...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3102 - Minimize Manhattan Distances

LeetCode Problem 3102 Difficulty: 🔴 Hard Topics: Array, Math, Geometry, Sorting, Ordered Set Solution Problem Understanding The problem asks us to minimize the maximum Manhattan distance between any two points on a 2D plane after removing exactly one point from the input list. The input points is an array of integer coordinates [[x1, y1], [x2, y2], ..., [xn, yn]] . The Manhattan distance between two points (x1, y1) and (x2,...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2427 - Number of Common Factors

LeetCode Problem 2427 Difficulty: 🟢 Easy Topics: Math, Enumeration, Number Theory Solution Problem Understanding The problem gives us two positive integers, a and b , and asks us to count how many integers divide both numbers evenly. A number x is considered a common factor if: a % x == 0 b % x == 0 This means x divides both integers without leaving a remainder. For example, if a...

Practice › Codeforces Solutions › Codeforces Round 183 (Div. 1) ›

CF 303A - Lucky Permutation Triple

CF 303A - Lucky Permutation Triple Rating: 1300 Tags: constructive algorithms, implementation, math Solve time: 2m 15s Verified: no Solution Problem Understanding We are asked to construct three permutations $a$, $b$, and $c$ of length $n$ such that for every index $i$ the sum of $a[i]$ and $b[i]$ modulo $n$ equals $c[i]$ modulo $n$. Each permutation contains exactly the numbers from 0 to $n-1$ once, and the output must either...

Practice › Codeforces Solutions ›

Codeforces Round 105 (Div. 2)

Codeforces Round 105 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-1900 | Time: 9m 21s Problem Name Rating Tags Solve Time Verified A Insomnia cure 800 constructive-algorithms, implementation, math 1m 34s ✗ B Escape 1500 implementation, math 1m 12s ✓ C Terse princess 1700 constructive-algorithms, greedy 2m 14s ✗ D Bag of mice 1800 dp, games, math 1m 55s ✓ E Porcelain 1900...

Practice › Codeforces Solutions › Codeforces Round 242 (Div. 2) ›

CF 424C - Magic Formulas

CF 424C - Magic Formulas Rating: 1600 Tags: math Solve time: 6m Verified: no Solution

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1862 - Sum of Floored Pairs

LeetCode Problem 1862 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Counting, Enumeration, Prefix Sum Solution Problem Understanding The problem asks us to calculate the sum of the integer division results, floor(nums[i] / nums[j]) , for every pair of elements (i, j) in a given array nums . Here, floor() represents the largest integer less than or equal to the division result. The array nums can have up to 10^5...

Practice › Codeforces Solutions ›

Codeforces Round 152 (Div. 2)

Codeforces Round 152 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-2600 | Time: 11m 52s Problem Name Rating Tags Solve Time Verified A Cupboards 800 implementation 1m 34s ✓ B Chilly Willy 1400 math, number-theory 2m 53s ✓ C Robo-Footballer 2000 binary-search, geometry 2m ✗ D Sweets for Everyone! 2300 binary-search, greedy, implementation 3m 8s ✓ E Piglet's Birthday 2600 dp, math, probabilities...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2464 - Minimum Subarrays in a Valid Split

LeetCode Problem 2464 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Number Theory Solution Problem Understanding The problem asks us to split an array of integers nums into contiguous subarrays such that each subarray satisfies a validity condition : the greatest common divisor (GCD) of the first and last elements of the subarray must be strictly greater than 1. Each element in nums must belong to exactly one subarray. Our...

Practice › Codeforces Solutions › Codeforces Round 133 (Div. 2) ›

CF 216E - Martian Luck

CF 216E - Martian Luck Rating: 2000 Tags: math, number theory Solve time: 1m 37s Verified: yes Solution Problem Understanding We are given a sequence of digits written in base k . Every digit is between 0 and k - 1 , and one special digit b is called lucky. For every substring of the digit sequence, we interpret that substring as a base- k number, allowing leading zeroes. A...

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180F - Mathematical Analysis Rocks!

CF 180F - Mathematical Analysis Rocks! Rating: 1200 Tags: constructive algorithms, implementation, math Solve time: 1m 28s Verified: yes Solution Problem Understanding Every student points to exactly one best friend, and every student is pointed to by exactly one other student. That means the friendship relation forms a permutation p . On day 1, notebook i stays with student i . On every following day, notebooks move according to p...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3337 - Total Characters in String After Transformations II

LeetCode Problem 3337 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Dynamic Programming, Counting Solution Problem Understanding The problem defines a repeated string transformation process over lowercase English letters. Every character does not simply become one new character, instead it expands into multiple characters depending on the value stored in nums . For a character c , let its alphabet index be: 'a' -> 0 'b' -> 1 ... 'z'...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3334 - Find the Maximum Factor Score of Array

LeetCode Problem 3334 Difficulty: 🟡 Medium Topics: Array, Math, Number Theory Solution Problem Understanding The problem asks us to compute the maximum factor score of an array of integers, where the factor score is defined as the product of the GCD (greatest common divisor) and LCM (least common multiple) of all elements in the array. We are allowed to remove at most one element to maximize this score. The input...

Practice › Codeforces Solutions ›

Codeforces Round 102 (Div. 2)

Codeforces Round 102 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1200 | Time: 4m 38s Problem Name Rating Tags Solve Time Verified A Help Vasilisa the Wise 2 1000 brute-force, math 2m 19s ✓ B Help Kingdom of Far Far Away 2 1200 implementation, strings 2m 19s ✓

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2827 - Number of Beautiful Integers in the Range

LeetCode Problem 2827 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution Problem Understanding The problem asks us to count how many integers within the inclusive range [low, high] satisfy two independent conditions. The first condition is based on the digits of the number. A number is considered beautiful only if it contains an equal number of even digits and odd digits. For example, 12 is valid because it has one...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2961 - Double Modular Exponentiation

LeetCode Problem 2961 Difficulty: 🟡 Medium Topics: Array, Math, Simulation Solution Problem Understanding The problem gives us a 0-indexed 2D array called variables , where each element contains four integers: ai bi ci mi For each index i , we must evaluate the following mathematical expression: $$((a_i^{b_i} \bmod 10)^{c_i}) \bmod m_i$$ If the result equals the given integer target , then index i is considered a good index . Our...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2409 - Count Days Spent Together

LeetCode Problem 2409 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to calculate the number of days Alice and Bob spend together in Rome based on their respective arrival and departure dates. Each date is represented as a string in the format "MM-DD" . The input consists of four strings: arriveAlice , leaveAlice , arriveBob , and leaveBob . The output should be the total...

Practice › Codeforces Solutions › Codeforces Round 239 (Div. 1) ›

CF 407C - Curious Array

CF 407C - Curious Array Rating: 2500 Tags: brute force, combinatorics, implementation, math Solve time: 34s Verified: no Solution

Practice › Codeforces Solutions ›

Codeforces Round 183 (Div. 2)

Codeforces Round 183 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1200-1300 | Time: 5m 19s Problem Name Rating Tags Solve Time Verified A Pythagorean Theorem II 1200 brute-force, math 2m ✓ B Calendar 1300 brute-force, implementation 3m 19s ✓

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2597 - The Number of Beautiful Subsets

LeetCode Problem 2597 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatorics Solution Problem Understanding The problem asks us to count how many non-empty subsets of the array nums are considered "beautiful". A subset is beautiful if there are no two numbers inside the subset whose absolute difference equals k . For example, if k = 2 , then the subset cannot contain both 2 and...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2729 - Check if The Number is Fascinating

LeetCode Problem 2729 Difficulty: 🟢 Easy Topics: Hash Table, Math Solution Problem Understanding The problem gives us a three digit integer n . We must determine whether n is a fascinating number. A number is considered fascinating when we concatenate three values together: n 2 * n 3 * n After concatenation, the resulting number must contain every digit from 1 through 9 exactly once. The digit 0 must not...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2638 - Count the Number of K-Free Subsets

LeetCode Problem 2638 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Sorting, Combinatorics Solution That is a detailed, long-form solution guide request. Before I generate it, I need one missing detail: do you want the solution centered on the optimal DP + graph/component approach (grouping numbers by modulo k and solving independent chains with house-robber style DP), or should I also include an alternative bitmask/backtracking approach for educational comparison? I...

Practice › Codeforces Solutions ›

Coder-Strike 2014 - Round 2

Coder-Strike 2014 - Round 2 Type: Special | Problems: 5 | Verified: 4/5 | Rating range: 1200-2200 | Time: 9m 37s Problem Name Rating Tags Solve Time Verified A Data Recovery 1200 implementation 1m 42s ✓ B Spyke Chatting 1300 implementation 1m 48s ✗ C Jeopardy! 1400 greedy, math 2m 23s ✓ D 2048 2000 bitmasks, dp 2m 23s ✓ E Maze 2D 2200 data-structures, divide-and-conquer 1m 21s ✓

Practice › Codeforces Solutions › Codeforces Round 151 (Div. 2) ›

CF 246B - Increase and Decrease

CF 246B - Increase and Decrease Rating: 1300 Tags: greedy, math Solve time: 58s Verified: yes Solution Problem Understanding We have an array of integers, and we are allowed to pick two different elements and simultaneously increase one by 1 and decrease the other by 1. We can perform this operation as many times as we like. The task is to determine the largest number of array elements that can...

Practice › Codeforces Solutions ›

Codeforces Round 160 (Div. 1)

Codeforces Round 160 (Div. 1) Type: Div. 1 | Problems: 3 | Verified: 3/3 | Rating range: 1400-2800 | Time: 6m 1s Problem Name Rating Tags Solve Time Verified A Maxim and Discounts 1400 greedy, sortings 3m 10s ✓ C Maxim and Matrix 2000 constructive-algorithms, dp, math 1m 11s ✓ E Maxim and Calculator 2800 brute-force, dp, two-pointers 1m 40s ✓

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166C - Median

CF 166C - Median Rating: 1500 Tags: greedy, math, sortings Solve time: 1m 37s Verified: yes Solution Problem Understanding We start with an array of integers and a target value x . We may append any number of extra integers to the array, and we want the median of the final array to become exactly x . The task is to compute the smallest number of added elements needed to...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2338 - Count the Number of Ideal Arrays

LeetCode Problem 2338 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to count how many arrays of length n satisfy a divisibility condition while keeping every value within the range [1, maxValue] . An array arr is considered ideal if: Every element is between 1 and maxValue . For every adjacent pair, the later element is divisible by the earlier one....

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3336 - Find the Number of Subsequences With Equal GCD

LeetCode Problem 3336 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Number Theory Solution Problem Understanding The problem asks us to count the number of pairs of non-empty disjoint subsequences from a given array nums such that the GCD of the elements in each subsequence of the pair is equal. A subsequence is a sequence that can be derived from the array by deleting zero or more elements without changing...

Practice › Codeforces Solutions › Codeforces Round 105 (Div. 2) ›

CF 148D - Bag of mice

CF 148D - Bag of mice Rating: 1800 Tags: dp, games, math, probabilities Solve time: 1m 55s Verified: yes Solution Problem Understanding We have a bag containing white and black mice. The princess moves first, then the dragon, then the princess again, and so on. Whoever draws a white mouse immediately wins. If someone draws a black mouse, the game continues. There is one extra rule during the dragon’s turn....

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2147 - Number of Ways to Divide a Long Corridor

LeetCode Problem 2147 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming Solution Problem Understanding The problem presents a long corridor represented as a string, where 'S' denotes a seat and 'P' denotes a plant. The goal is to partition this corridor into sections , such that each section contains exactly two seats and any number of plants. There are already two dividers in place: one before the first character and...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2396 - Strictly Palindromic Number

LeetCode Problem 2396 Difficulty: 🟡 Medium Topics: Math, Two Pointers, Brainteaser Solution Problem Understanding The problem asks whether a given integer n is strictly palindromic . A number is strictly palindromic if, for every base b between 2 and n - 2 (inclusive), its representation in base b reads the same forwards and backwards. In simpler terms, you need to check all number systems from base 2 up to base...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2240 - Number of Ways to Buy Pens and Pencils

LeetCode Problem 2240 Difficulty: 🟡 Medium Topics: Math, Enumeration Solution Problem Understanding The problem asks us to determine the number of distinct ways to spend a given amount of money, total , on pens and pencils, each with fixed costs, cost1 for pens and cost2 for pencils. You can buy any non-negative number of each item, including zero, as long as the total cost does not exceed your budget. The...

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180B - Divisibility Rules

CF 180B - Divisibility Rules Rating: 2300 Tags: math, number theory Solve time: 1m 50s Verified: yes Solution Problem Understanding We work in a positional numeral system with base b . For a divisor d , we must determine which kind of divisibility rule exists in this base. The problem defines several categories. A divisor belongs to the 2-type category if divisibility depends only on a fixed number of last...

Practice › Codeforces Solutions › Codeforces Round 176 (Div. 1) ›

CF 286E - Ladies' Shop

CF 286E - Ladies' Shop Rating: 2800 Tags: constructive algorithms, fft, math Solve time: 1m 30s Verified: yes Solution Problem Understanding We are given a collection of “bag capacities” $a_1 < a_2 < \dots < a_n$, each capacity describing a special requirement: the bag can exactly accommodate some multiset of item weights whose sum is exactly that capacity, but it is forbidden to use a configuration whose total weight is...

Practice › Codeforces Solutions ›

Codeforces Round 113 (Div. 2)

Codeforces Round 113 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1100-2500 | Time: 11m 49s Problem Name Rating Tags Solve Time Verified A Rank List 1100 binary-search, implementation, sortings 1m 31s ✓ B Polygons 2100 geometry, sortings 3m 7s ✓ C Median 1500 greedy, math, sortings 1m 37s ✓ D Shoe Store 2500 dp, graph-matchings, greedy 2m 34s ✓ E Tetrahedron 1500 dp,...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2524 - Maximum Frequency Score of a Subarray

LeetCode Problem 2524 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Stack, Sliding Window Solution Problem Understanding The problem asks us to compute the maximum frequency score among all contiguous subarrays of length k from a given integer array nums . A frequency score is defined as the sum of each distinct element raised to the power of its frequency within the subarray, taken modulo 10^9 + 7 . For...

Practice › Codeforces Solutions ›

Codeforces Round 123 (Div. 2)

Codeforces Round 123 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 1000-2000 | Time: 5m 40s Problem Name Rating Tags Solve Time Verified A Let's Watch Football 1000 binary-search, brute-force, math 1m 24s ✓ C Try and Catch 1800 expression-parsing, implementation 1m 8s ✓ D Analyzing Polyline 1900 geometry, math, sortings 1m 28s ✗ E Building Forest 2000 data-structures, dsu, graphs 1m 40s ✓

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3370 - Smallest Number With All Set Bits

LeetCode Problem 3370 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation Solution Problem Understanding The problem asks us to find the smallest integer x such that: x >= n Every bit in the binary representation of x is set to 1 A number whose binary representation contains only set bits looks like this: 1 → binary "1" 3 → binary "11" 7 → binary "111" 15 → binary "1111" These numbers...

Practice › Codeforces Solutions ›

Codeforces Round 198 (Div. 2)

Codeforces Round 198 (Div. 2) Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 1600-1600 | Time: 4m 39s Problem Name Rating Tags Solve Time Verified C Tourist Problem 1600 combinatorics, implementation, math 4m 39s ✓

Practice › Codeforces Solutions › Codeforces Round 144 (Div. 2) ›

CF 233B - Non-square Equation

CF 233B - Non-square Equation Rating: 1400 Tags: binary search, brute force, math Solve time: 49s Verified: no Solution Problem-Type Check This is a Type B - “Prove that / determine a value” problem. The task is to deduce a uniquely determined numerical quantity from the hypotheses. The proof must therefore show that the given conditions force a unique value for the number of students who solved only problem $B$,...

Practice › Codeforces Solutions › Codeforces Round 100 ›

CF 140A - New Year Table

CF 140A - New Year Table Rating: 1700 Tags: geometry, math Solve time: 1m 45s Verified: yes Solution Problem Understanding We have a large circular table with radius R and want to place n identical circular plates, each with radius r . Every plate must satisfy three conditions simultaneously. First, the entire plate must stay inside the table. Second, every plate must touch the boundary of the table. Third, no...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2117 - Abbreviating the Product of a Range

LeetCode Problem 2117 Difficulty: 🔴 Hard Topics: Math, Number Theory Solution Problem Understanding We are given two integers, a and b . The task is deceptively small because the entire original statement is represented only by a picture. The hidden geometry behind the problem is this: We need to determine the coordinates of a point so that a specific polyline configuration satisfies the distance requirements encoded by a and b...

Practice › Codeforces Solutions ›

Codeforces Round 167 (Div. 2)

Codeforces Round 167 (Div. 2) Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 1400-2200 | Time: 5m 30s Problem Name Rating Tags Solve Time Verified B Dima and Sequence 1400 implementation, math 1m 30s ✓ C Dima and Staircase 1500 data-structures, implementation 1m 28s ✓ E Dima and Horses 2200 combinatorics, constructive-algorithms, graphs 2m 32s ✗

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3289 - The Two Sneaky Numbers of Digitville

LeetCode Problem 3289 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math Solution Problem Understanding The problem is asking us to identify two numbers that appear twice in an otherwise consecutive list of integers ranging from 0 to n - 1 . In other words, the input nums is almost a permutation of the numbers 0 through n - 1 , except that two numbers are repeated , so the length...

Practice › Codeforces Solutions ›

Croc Champ 2012 - Round 1

Croc Champ 2012 - Round 1 Type: Special | Problems: 5 | Verified: 3/5 | Rating range: 1300-2600 | Time: 10m 55s Problem Name Rating Tags Solve Time Verified A Rock-Paper-Scissors 1300 implementation, math 1m 40s ✓ B Chamber of Secrets 1800 dfs-and-similar, shortest-paths 1m 49s ✓ C Spiral Maximum 1900 brute-force, dp 2m 41s ✗ D Deputies 2500 constructive-algorithms, graphs, greedy 3m 4s ✓ E Camping Groups 2600 data-structures,...

Practice › Codeforces Solutions › Codeforces Round 241 (Div. 2) ›

CF 416D - Population Size

CF 416D - Population Size Rating: 2400 Tags: greedy, implementation, math Solve time: 1m 23s Verified: yes Solution Problem Understanding We are given a sequence of length $n$, where each position is either a fixed positive integer or unknown (marked as $-1$). The task is to interpret this sequence as being formed by concatenating several arithmetic progressions, one after another. Within each segment, consecutive elements must differ by a constant...

Practice › Codeforces Solutions › Codeforces Round 201 (Div. 2) ›

CF 347B - Fixed Points

CF 347B - Fixed Points Rating: 1100 Tags: brute force, implementation, math Solve time: 1m 42s Verified: yes Solution Problem Understanding We are given a permutation of length n , which means an array of integers where each number from 0 to n - 1 appears exactly once. In this array, a "fixed point" is an index where the value equals the index itself. The goal is to perform at...

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251B - Playing with Permutations

CF 251B - Playing with Permutations Rating: 1800 Tags: implementation, math Solve time: 8m 15s Verified: no Solution

Practice › Codeforces Solutions › Codeforces Round 183 (Div. 1) ›

CF 303E - Random Ranking

CF 303E - Random Ranking Rating: 3000 Tags: dp, math, probabilities Solve time: 3m 7s Verified: no Solution Problem Understanding Each participant receives a real-valued score chosen uniformly from an interval $[l_i, r_i]$. Scores are independent. After all scores are generated, participants are sorted by score. Smaller score means better rank, so the participant with the largest score finishes last. For every participant $i$ and every rank $j$, we must...

Practice › Codeforces Solutions ›

MemSQL start[c]up Round 2 - online version

MemSQL start[c]up Round 2 - online version Type: Special | Problems: 3 | Verified: 1/3 | Rating range: 1900-2800 | Time: 8m 55s Problem Name Rating Tags Solve Time Verified B Palindrome 1900 constructive-algorithms, dp 2m 24s ✗ D Rectangles and Square 2400 brute-force, dp 3m 41s ✓ E Counting Skyscrapers 2800 dp, math, probabilities 2m 50s ✗

Practice › Codeforces Solutions ›

Codeforces Round 172 (Div. 1)

Codeforces Round 172 (Div. 1) Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1800-3000 | Time: 3m 38s Problem Name Rating Tags Solve Time Verified B Maximum Xor Secondary 1800 data-structures, implementation, two-pointers 1m 35s ✓ E Sequence Transformation 3000 brute-force, data-structures, dp 2m 3s ✗

Practice › Codeforces Solutions › Codeforces Round 138 (Div. 1) ›

CF 223C - Partial Sums

CF 223C - Partial Sums Rating: 1900 Tags: combinatorics, math, number theory Solve time: 1m 25s Verified: yes Solution Problem Understanding We start with an array of length n . One operation replaces every element with its prefix sum. After one operation: $$a_i \leftarrow \sum_{j=1}^{i} a_j$$ After repeating this process k times, we must print the resulting array. The operation is linear and highly structured. Each application transforms the array...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2520 - Count the Digits That Divide a Number

LeetCode Problem 2520 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine, given a positive integer num , how many of its digits evenly divide num . In other words, for each digit d in the number, we check if num % d == 0 . The input is a single integer between 1 and 10^9 , and the number will not contain a zero,...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2598 - Smallest Missing Non-negative Integer After Operations

LeetCode Problem 2598 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Greedy Solution That is a long, structured technical guide with multiple required sections and two full implementations. To keep the quality high and follow your formatting rules exactly, I will provide it in a single comprehensive response. LeetCode 2598 - Smallest Missing Non-negative Integer After Operations Problem Understanding The problem gives us an integer array nums and an integer...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2189 - Number of Ways to Build House of Cards

LeetCode Problem 2189 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution Problem Understanding The problem is asking us to count the number of distinct ways to build a house of cards using exactly n cards. Each house consists of one or more rows of triangles formed by leaning two cards together, with horizontal cards placed between adjacent triangles. The rules enforce that higher rows of triangles must rest on horizontal...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2221 - Find Triangular Sum of an Array

LeetCode Problem 2221 Difficulty: 🟡 Medium Topics: Array, Math, Simulation, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to compute the triangular sum of an array of digits. The triangular sum is obtained by repeatedly reducing the array according to a simple rule: for every pair of adjacent elements, sum them modulo 10 to form a new array of length one less than the current array. This reduction...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2450 - Number of Distinct Binary Strings After Applying Operations

LeetCode Problem 2450 Difficulty: 🟡 Medium Topics: Math, String Solution LeetCode 2450 - Number of Distinct Binary Strings After Applying Operations Problem Understanding We are given a binary string s of length n and an integer k . An operation consists of selecting any contiguous substring of length k and flipping every bit in that substring. A 0 becomes 1 , and a 1 becomes 0 . The operation may...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1828 - Queries on Number of Points Inside a Circle

LeetCode Problem 1828 Difficulty: 🟡 Medium Topics: Array, Math, Geometry Solution Problem Understanding This problem gives us two collections of geometric objects on a 2D plane. The first collection is an array called points , where each element is a coordinate pair [x, y] . Each pair represents a point on the plane. Multiple points are allowed to have the exact same coordinates, so duplicates must be counted separately. The...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1896 - Minimum Cost to Change the Final Value of Expression

LeetCode Problem 1896 Difficulty: 🔴 Hard Topics: Math, String, Dynamic Programming, Stack Solution Problem Understanding This problem gives us a boolean expression containing only: '0' and '1' binary operators '&' and '|' parentheses The expression is guaranteed to be valid, which means every operator has valid operands and every parenthesis is properly matched. The important detail is that the expression is not evaluated using normal operator precedence. Instead: Parentheses are...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3232 - Find if Digit Game Can Be Won

LeetCode Problem 3232 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem presents a simple two-player game between Alice and Bob using an array of positive integers. Each number in the array is either a single-digit number (1 to 9) or a double-digit number (10 to 99). Alice has the choice to select either all single-digit numbers or all double-digit numbers from the array, while Bob automatically gets...

Practice › Codeforces Solutions ›

Codeforces Round 235 (Div. 2)

Codeforces Round 235 (Div. 2) Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-2000 | Time: 6m 53s Problem Name Rating Tags Solve Time Verified A Vanya and Cards 800 implementation, math 4m 10s ✗ B Sereja and Contests 1200 greedy, implementation, math 1m 24s ✓ D Roman and Numbers 2000 bitmasks, brute-force, combinatorics 1m 19s ✓

Practice › Codeforces Solutions › Codeforces Round 146 (Div. 1) ›

CF 235E - Number Challenge

CF 235E - Number Challenge Rating: 2600 Tags: combinatorics, dp, implementation, math, number theory Solve time: 3m 42s Verified: yes Solution Problem Understanding We need to compute $$\sum_{i=1}^{a}\sum_{j=1}^{b}\sum_{k=1}^{c} d(i \cdot j \cdot k)$$ where $d(x)$ is the number of positive divisors of $x$. The three nested loops range over every triple $(i,j,k)$, multiply the numbers together, compute how many divisors that product has, and add everything modulo $2^{30} = 1073741824$....

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2802 - Find The K-th Lucky Number

LeetCode Problem 2802 Difficulty: 🟡 Medium Topics: Math, String, Bit Manipulation Solution Problem Understanding This problem asks us to find the k-th lucky number , where a lucky number is defined as an integer consisting only of the digits 4 and 7 . For example, the sequence of lucky numbers in increasing order starts as 4, 7, 44, 47, 74, 77, 444, and so on. The input is a single...

Practice › Codeforces Solutions › Codeforces Round 122 (Div. 1) ›

CF 193C - Hamming Distance

CF 193C - Hamming Distance Rating: 2400 Tags: constructive algorithms, greedy, math, matrices Solve time: 2m 31s Verified: no Solution Problem Understanding We are given the six pairwise Hamming distances between four unknown binary strings. Every string contains only 'a' and 'b' , and all four strings must have the same length. The task is not to recover the original strings. We only need to construct any four strings whose...

Practice › Codeforces Solutions › Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) ›

CF 241B - Friends

CF 241B - Friends Rating: 2700 Tags: binary search, bitmasks, data structures, math Solve time: 2m 23s Verified: no Solution Problem Understanding We have an array of friend attractiveness values. Every unordered pair of distinct friends produces one possible picture, and the value of that picture is the xor of the two attractiveness values. Among all possible pairs, we want to choose exactly m distinct pairs whose xor values have...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3024 - Type of Triangle

LeetCode Problem 3024 Difficulty: 🟢 Easy Topics: Array, Math, Sorting Solution Problem Understanding The problem gives an integer array nums of length 3 , where each value represents the length of a side of a possible triangle. Our task is to determine what kind of triangle these three sides can form. There are four possible outputs: "equilateral" if all three sides are equal "isosceles" if exactly two sides are equal...

Practice › Codeforces Solutions ›

Codeforces Round 116 (Div. 2, ACM-ICPC Rules)

Codeforces Round 116 (Div. 2, ACM-ICPC Rules) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1200-2300 | Time: 8m 3s Problem Name Rating Tags Solve Time Verified A Defragmentation 1800 implementation 1m 20s ✓ B Divisibility Rules 2300 math, number-theory 1m 50s ✓ C Letter 1400 dp 1m 46s ✓ D Name 1900 greedy, strings 1m 39s ✓ F Mathematical Analysis Rocks! 1200 constructive-algorithms, implementation, math...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2582 - Pass the Pillow

LeetCode Problem 2582 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem describes a line of n people, numbered sequentially from 1 to n . Initially, person 1 holds a pillow. Every second, the pillow is passed to the adjacent person. The direction of passing changes whenever the pillow reaches either end of the line. In other words, the pillow moves forward from person 1 toward person n...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1979 - Find Greatest Common Divisor of Array

LeetCode Problem 1979 Difficulty: 🟢 Easy Topics: Array, Math, Number Theory Solution Problem Understanding The problem asks us to compute the greatest common divisor (GCD) of two specific values derived from the input array nums : the smallest element in the array and the largest element in the array. In other words, we are not computing the GCD of all elements, nor are we looking for pairwise relationships across the...

Practice › Codeforces Solutions ›

Codeforces Round 148 (Div. 2)

Codeforces Round 148 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 1200-1500 | Time: 4m 55s Problem Name Rating Tags Solve Time Verified A Two Bags of Potatoes 1200 greedy, implementation, math 1m 23s ✓ B Easy Tape Programming 1500 brute-force, implementation 3m 32s ✗

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2280 - Minimum Lines to Represent a Line Chart

LeetCode Problem 2280 Difficulty: 🟡 Medium Topics: Array, Math, Geometry, Sorting, Number Theory Solution Problem Understanding In this problem, we are given a list of stock prices over different days. Each element in stockPrices is a pair: [day, price] This represents a point on a 2D graph where: The X-axis is the day The Y-axis is the stock price on that day The line chart is formed by connecting consecutive...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3116 - Kth Smallest Amount With Single Denomination Combination

LeetCode Problem 3116 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to determine the kth smallest amount that can be formed using coins of given denominations under a strict limitation: we can only use a single type of coin at a time . In other words, combinations of different denominations are not allowed . The input consists of...

Practice › Codeforces Solutions › Codeforces Round 126 (Div. 2) ›

CF 200B - Drinks

CF 200B - Drinks Rating: 800 Tags: implementation, math Solve time: 1m 33s Verified: yes Solution Problem Understanding We are given several drinks, and each drink already contains some percentage of orange juice. Vasya mixes the same amount from every drink into one large cocktail. The task is to compute the final percentage of orange juice in the mixture. If one drink is 50% orange juice and another is 100%,...

Practice › Codeforces Solutions ›

Codeforces Round 131 (Div. 2)

Codeforces Round 131 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1600 | Time: 3m 45s Problem Name Rating Tags Solve Time Verified A System of Equations 800 brute-force 56s ✓ B Hometask 1600 brute-force, constructive-algorithms, greedy 2m 49s ✓

Practice › Codeforces Solutions ›

Codeforces Round 111 (Div. 2)

Codeforces Round 111 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 900-2400 | Time: 8m 5s Problem Name Rating Tags Solve Time Verified A Twins 900 greedy, sortings 1m 15s ✓ B Unlucky Ticket 1100 greedy, sortings 1m 29s ✓ C Find Pair 1700 implementation, math, sortings 1m 47s ✓ D Edges in MST 2300 dfs-and-similar, dsu, graphs 1m 21s ✓ E Buses and...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2266 - Count Number of Texts

LeetCode Problem 2266 Difficulty: 🟡 Medium Topics: Hash Table, Math, String, Dynamic Programming Solution Problem Understanding The problem requires determining how many possible text messages Alice could have sent given a sequence of digit key presses received by Bob. Each digit from '2' to '9' maps to a set of letters on a phone keypad. Pressing a key multiple times selects a different letter on that key. For example, pressing...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2160 - Minimum Sum of Four Digit Number After Splitting Digits

LeetCode Problem 2160 Difficulty: 🟢 Easy Topics: Math, Greedy, Sorting Solution Problem Understanding The problem asks us to take a four-digit integer num and split its digits into two new integers such that the sum of these two integers is minimized. We are allowed to use all digits exactly once, and the new integers can have leading zeros . For instance, if the number is 2932 , the digits are...

Practice › Codeforces Solutions ›

Codeforces Round 252 (Div. 2)

Codeforces Round 252 (Div. 2) Type: Div. 2 | Problems: 3 | Verified: 1/3 | Rating range: 1000-2400 | Time: 4m 27s Problem Name Rating Tags Solve Time Verified A Valera and Antique Items 1000 implementation 1m 21s ✓ D Valera and Swaps 2100 constructive-algorithms, dsu, graphs 1m 26s ✗ E Valera and Number 2400 bitmasks, dp, math 1m 40s ✗

Practice › Codeforces Solutions ›

Codeforces Round 107 (Div. 2)

Codeforces Round 107 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1200 | Time: 3m 17s Problem Name Rating Tags Solve Time Verified A Soft Drinking 800 implementation, math 1m 31s ✓ B Phone Numbers 1200 implementation, strings 1m 46s ✓

Practice › Codeforces Solutions › Codeforces Round 174 (Div. 1) ›

CF 283D - Cows and Cool Sequences

CF 283D - Cows and Cool Sequences Rating: 2400 Tags: dp, math, number theory Solve time: 1m 41s Verified: yes Solution Problem Understanding We are given an array of positive integers. A pair (x, y) is called cool if x can be written as the sum of y consecutive integers, where the sequence may contain negative numbers and zero. The sequence itself is cool when every adjacent pair satisfies this...

Practice › Codeforces Solutions › Codeforces Round 169 (Div. 2) ›

CF 276D - Little Girl and Maximum XOR

CF 276D - Little Girl and Maximum XOR Rating: 1700 Tags: bitmasks, dp, greedy, implementation, math Solve time: 1m 24s Verified: yes Solution Problem Understanding We are given two integers, l and r . We may choose any two numbers a and b such that both lie inside the interval [l, r] and a ≤ b . Among all such pairs, we must compute the maximum possible value of a...

Practice › Codeforces Solutions › Codeforces Round 119 (Div. 2) ›

CF 189B - Counting Rhombi

CF 189B - Counting Rhombi Rating: 1300 Tags: brute force, math Solve time: 2m 53s Verified: yes Solution Problem Understanding We are asked to count rhombi inside a rectangle of width w and height h , where each rhombus has its vertices on integer coordinates and diagonals aligned with the axes. Each rhombus must have positive area and be fully contained in the rectangle. The output is a single integer,...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3084 - Count Substrings Starting and Ending with Given Character

LeetCode Problem 3084 Difficulty: 🟡 Medium Topics: Math, String, Counting Solution LeetCode 3084 - Count Substrings Starting and Ending with Given Character Problem Understanding The problem gives us a string s and a character c . We must count how many substrings of s both start and end with the character c . A substring is any contiguous portion of the string. For every possible substring, we check two conditions:...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2481 - Minimum Cuts to Divide a Circle

LeetCode Problem 2481 Difficulty: 🟢 Easy Topics: Math, Geometry Solution Problem Understanding The problem asks for the minimum number of straight cuts required to divide a circle into n equal slices . A valid cut can either pass through the center and touch two points on the circle, or touch one point on the circle and pass through the center. The input is a single integer n representing the desired...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2393 - Count Strictly Increasing Subarrays

LeetCode Problem 2393 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution Problem Understanding The problem asks us to count all strictly increasing subarrays in a given array nums of positive integers. A strictly increasing subarray is a contiguous sequence of numbers where each element is strictly larger than the previous one. The output should be a single integer representing the total number of such subarrays. The input nums is...

Practice › Codeforces Solutions › Codeforces Round 105 (Div. 2) ›

CF 148B - Escape

CF 148B - Escape Rating: 1500 Tags: implementation, math Solve time: 1m 12s Verified: yes Solution Problem Understanding We are asked to simulate a pursuit scenario between a princess and a dragon. The princess runs at a constant speed, and the dragon flies faster but only begins chasing after a delay. Each time the dragon catches up, the princess can drop a bijou to distract him. The dragon then returns...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1903 - Largest Odd Number in String

LeetCode Problem 1903 Difficulty: 🟢 Easy Topics: Math, String, Greedy Solution Problem Understanding The problem asks us to find the largest-valued odd integer substring from a given string num that represents a large integer. Here, a substring is any contiguous sequence of characters in num . We must return the substring itself as a string, or an empty string if no odd number exists in num . For example, if...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2348 - Number of Zero-Filled Subarrays

LeetCode Problem 2348 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem asks us to count the number of contiguous subarrays in an integer array nums that consist entirely of zeros. A subarray is defined as any consecutive sequence of elements from the original array. The input array can contain any integers within the range -10^9 to 10^9 , and the array length can be up to 10^5...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2681 - Power of Heroes

LeetCode Problem 2681 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Sorting, Prefix Sum Solution Problem Understanding The problem asks us to compute the total "power" across every possible non-empty subset of heroes. For any selected group of heroes, its power is defined as: $$(\text{maximum strength in the group})^2 \times (\text{minimum strength in the group})$$ We are given an array nums , where each value represents the strength of one...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2647 - Color the Triangle Red

LeetCode Problem 2647 Difficulty: 🔴 Hard Topics: Array, Math Solution Problem Understanding The problem asks us to determine the minimal set of initial triangles to color red in an equilateral triangle of side length n , such that by repeatedly applying a propagation rule, all triangles eventually become red. The propagation rule is simple: any white triangle with at least two red neighbors becomes red automatically. The input n specifies...

Practice › Codeforces Solutions ›

VK Cup 2012 Round 3 (Unofficial Div. 2 Edition)

VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 1100-1800 | Time: 6m 56s Problem Name Rating Tags Solve Time Verified A Problem About Equation 1100 math 1m 33s ✓ B File List 1400 dp, greedy, implementation 3m 40s ✓ C Range Increments 1800 data-structures, greedy 1m 43s ✓

Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293C - Cube Problem

CF 293C - Cube Problem Rating: 2400 Tags: brute force, math, number theory Solve time: 1m 36s Verified: yes Solution Problem Understanding We are looking for the number of positive integer triples $(a,b,c)$ such that three smaller cubes of sizes $a^3$, $b^3$, and $c^3$ together are short of exactly $n$ unit cubes when trying to build one large cube of side length $a+b+c$. The missing amount is $$(a+b+c)^3 - a^3...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2930 - Number of Strings Which Can Be Rearranged to Contain Substring

LeetCode Problem 2930 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem asks us to count how many strings of length n made of lowercase English letters can be rearranged to contain the substring "leet" . In other words, a string is "good" if, after any permutation of its characters, "leet" appears as a contiguous sequence. The input is a single integer n (1 ≤ n...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1904 - The Number of Full Rounds You Have Played

LeetCode Problem 1904 Difficulty: 🟡 Medium Topics: Math, String Solution Problem Understanding The problem describes an online chess tournament where a new round begins every 15 minutes. A player can only be credited for a full round if they are present for the entire duration of that round. The input consists of two time strings: loginTime , the moment the player logs in logoutTime , the moment the player logs...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2578 - Split With Minimum Sum

LeetCode Problem 2578 Difficulty: 🟢 Easy Topics: Math, Greedy, Sorting Solution Problem Understanding The problem asks us to take a positive integer num and split its digits into two non-negative integers num1 and num2 such that the sum num1 + num2 is minimized. Importantly, the digits of num must be entirely used between num1 and num2 , but their order can be rearranged, and leading zeros are allowed in both...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2495 - Number of Subarrays Having Even Product

LeetCode Problem 2495 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution LeetCode 2495 - Number of Subarrays Having Even Product Problem Understanding The problem gives us an integer array nums and asks us to count how many contiguous subarrays have an even product. A subarray is a continuous segment of the array. For each possible subarray, we compute the product of all its elements. If that product is even,...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2834 - Find the Minimum Possible Sum of a Beautiful Array

LeetCode Problem 2834 Difficulty: 🟡 Medium Topics: Math, Greedy Solution LeetCode 2834 - Find the Minimum Possible Sum of a Beautiful Array Problem Understanding We are given two positive integers, n and target . We need to construct an array of exactly n distinct positive integers such that no two different elements add up to target . Among all arrays satisfying these conditions, we want the one with the smallest...

Practice › Codeforces Solutions › Codeforces Round 173 (Div. 2) ›

CF 282B - Painting Eggs

CF 282B - Painting Eggs Rating: 1500 Tags: greedy, math Solve time: 1m 12s Verified: yes Solution Problem Understanding We are given a list of eggs, each of which can be painted by either of two children, A or G. Each child quotes a price for painting each egg, and these prices for a single egg always sum to exactly 1000. Uncle J. wants to assign each egg to exactly...

Practice › Codeforces Solutions › Codeforces Round 131 (Div. 2) ›

CF 214B - Hometask

CF 214B - Hometask Rating: 1600 Tags: brute force, constructive algorithms, greedy, math Solve time: 2m 49s Verified: yes Solution Problem Understanding We are given a multiset of digits and asked to construct the largest integer from some or all of them such that the resulting number is divisible by 2, 3, and 5 simultaneously. Because a number divisible by 2, 3, and 5 is divisible by 30, the task...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2652 - Sum Multiples

LeetCode Problem 2652 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem requires calculating the sum of all integers from 1 up to a given positive integer n that are divisible by 3, 5, or 7. In simpler terms, we need to consider each number in the range [1, n] and check if it is a multiple of any of these three numbers. If it is, we include it...

Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402D - Upgrading Array

CF 402D - Upgrading Array Rating: 1800 Tags: dp, greedy, math, number theory Solve time: 1m 3s Verified: yes Solution Problem Understanding We are given an array of positive integers and a set of "bad" prime numbers. Every other prime not in the bad set is implicitly "good." Each number in the array contributes to a total "beauty" score determined by its prime factorization. The contribution of a number is...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2829 - Determine the Minimum Sum of a k-avoiding Array

LeetCode Problem 2829 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to construct an array of n distinct positive integers such that no two elements in the array sum to a given integer k . This type of array is called k-avoiding . Among all possible k-avoiding arrays of length n , we are asked to find the minimum possible sum of its elements. The...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3395 - Subsequences with a Unique Middle Mode I

LeetCode Problem 3395 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Combinatorics Solution LeetCode 3395 - Subsequences with a Unique Middle Mode I Problem Understanding We are given an integer array nums , and we must count how many subsequences of length 5 satisfy a very specific condition: The subsequence must have exactly 5 elements. The middle element of the subsequence, meaning the third element seq[2] , must be the...

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248B - Chilly Willy

CF 248B - Chilly Willy Rating: 1400 Tags: math, number theory Solve time: 2m 53s Verified: yes Solution Problem Understanding We are looking for the smallest positive integer that has exactly n digits and is divisible by every one of the numbers 2, 3, 5, and 7 at the same time. In other words, we want the minimal n -digit number that is a multiple of the least common multiple...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2967 - Minimum Cost to Make Array Equalindromic

LeetCode Problem 2967 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Greedy, Sorting Solution LeetCode 2967 - Minimum Cost to Make Array Equalindromic Problem Understanding We are given an integer array nums . We may repeatedly choose any element and replace it with any positive integer x . Replacing a value nums[i] with x costs |nums[i] - x| . The goal is to transform the array so that every element...

Practice › Codeforces Solutions ›

Codeforces Round 140 (Div. 1)

Codeforces Round 140 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1400-2900 | Time: 14m 33s Problem Name Rating Tags Solve Time Verified A Flying Saucer Segments 1400 math 5m 43s ✓ B Naughty Stone Piles 1900 greedy 2m 22s ✓ C Anniversary 2400 data-structures, implementation, math 2m 19s ✓ D The table 2100 constructive-algorithms, greedy 2m 58s ✗ E Noble Knight's Path 2900...

Practice › Codeforces Solutions ›

Codeforces Round 107 (Div. 1)

Codeforces Round 107 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1400-3000 | Time: 11m 8s Problem Name Rating Tags Solve Time Verified A Win or Freeze 1400 games, math, number-theory 2m 2s ✗ B Quantity of Strings 1600 combinatorics, dfs-and-similar, graphs 1m 40s ✓ C Smart Cheater 2200 data-structures, math, probabilities 2m 11s ✓ D Mission Impassable 2600 dp, strings 2m 26s ✓...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3079 - Find the Sum of Encrypted Integers

LeetCode Problem 3079 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem provides an array of positive integers nums and asks us to compute a sum based on an encryption transformation. The transformation encrypt(x) replaces every digit in x with the largest digit in x . For example, encrypt(523) results in 555 because the largest digit in 523 is 5 , and every digit is replaced by 5...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1956 - Minimum Time For K Virus Variants to Spread

LeetCode Problem 1956 Difficulty: 🔴 Hard Topics: Array, Math, Binary Search, Geometry, Enumeration Solution Problem Understanding The problem describes multiple virus variants spreading across an infinite 2D grid. Each virus starts from its own origin point on day 0 . Every day, a virus spreads one step in the four cardinal directions, which means after d days, a virus can reach every point whose Manhattan distance from its origin is...

Practice › Codeforces Solutions › Codeforces Round 205 (Div. 2) ›

CF 353A - Domino

CF 353A - Domino Rating: 1200 Tags: implementation, math Solve time: 3m 55s Verified: yes Solution Problem Understanding We are given a row of domino tiles. Each tile has two numbers: one on the top half and one on the bottom half. We are allowed to flip a tile, which swaps its top and bottom numbers. Each flip costs one unit of time. The goal is to make both the...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2535 - Difference Between Element Sum and Digit Sum of an Array

LeetCode Problem 2535 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem gives us an array of positive integers called nums . We need to compute two different values from this array. The first value is the element sum, which is simply the sum of every number in the array. For example, if the array is [1, 15, 6, 3] , then the element sum is: $$1 +...

Practice › Codeforces Solutions ›

Codeforces Round 179 (Div. 2)

Codeforces Round 179 (Div. 2) Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 1100-1100 | Time: 57s Problem Name Rating Tags Solve Time Verified A Yaroslav and Permutations 1100 greedy, math 57s ✓

Practice › Codeforces Solutions › Codeforces Round 114 (Div. 1) ›

CF 167A - Wizards and Trolleybuses

CF 167A - Wizards and Trolleybuses Rating: 1600 Tags: implementation, math Solve time: 1m 40s Verified: yes Solution Problem Understanding Each trolleybus starts from the depot at a fixed departure time. It begins with speed 0 , can accelerate at most a , and can never exceed its own speed limit v[i] . The destination is d meters away. Braking is unrestricted, so a trolleybus can instantly reduce its speed...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 381 - Insert Delete GetRandom O(1) - Duplicates allowed

LeetCode Problem 381 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Design, Randomized Solution Problem Understanding The problem asks us to design a data structure called RandomizedCollection that behaves like a multiset. Unlike a normal set, duplicate values are allowed. The data structure must support three operations: Insert a value Remove one occurrence of a value Return a random element The critical requirement is that every operation must run in...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1830 - Minimum Number of Operations to Make String Sorted

LeetCode Problem 1830 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Combinatorics, Counting Solution Problem Understanding The operation described in the problem is exactly the process of generating the previous lexicographical permutation of a string. Starting from the current string, each operation transforms it into the lexicographically largest string that is still smaller than the current one. The goal is to determine how many such operations are required before the...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 973 - K Closest Points to Origin

LeetCode Problem 973 Difficulty: 🟡 Medium Topics: Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect Solution Problem Understanding This problem asks us to find the k points that are closest to the origin (0,0) from a list of 2D points. Each point is given as a pair [x, y] , and the distance is defined using the Euclidean formula, sqrt(x^2 + y^2) . The input consists of...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 233 - Number of Digit One

LeetCode Problem 233 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Recursion Solution LeetCode 233 - Number of Digit One Problem Statement Given a non-negative integer n , we must count how many times the digit 1 appears in every number from 0 through n , inclusive. The important detail is that we are not counting how many numbers contain the digit 1 . Instead, we are counting the total number...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1523 - Count Odd Numbers in an Interval Range

LeetCode Problem 1523 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem gives two non-negative integers, low and high , representing the inclusive bounds of an interval. We need to determine how many odd integers exist between these two values, including both endpoints. An integer is odd if it is not divisible by 2. Examples of odd numbers are 1 , 3 , 5 , and 7 . Examples...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1513 - Number of Substrings With Only 1s

LeetCode Problem 1513 Difficulty: 🟡 Medium Topics: Math, String Solution Problem Understanding The problem gives a binary string s , consisting only of the characters '0' and '1' . We must count how many substrings contain only '1' characters. A substring is a contiguous section of the string. For example, in the string "111" , the valid substrings made entirely of '1' are: "1" at index 0 "1" at index...

Practice › Codeforces Solutions › Yandex.Algorithm Open 2011: Qualification 1 ›

CF 81C - Average Score

CF 81C - Average Score Rating: 1700 Tags: greedy, math, sortings Solve time: 3m 31s Verified: yes Solution Problem Understanding We are given a sequence of marks, but the subject for each mark was lost. There are only two subjects, and we know exactly how many marks belong to each one. If subject 1 must receive a marks, then subject 2 automatically receives b = n - a marks. Our...

Practice › Codeforces Solutions › Codeforces Beta Round 46 (Div. 2) ›

CF 49B - Sum

CF 49B - Sum Rating: 1500 Tags: math Solve time: 1m 24s Verified: yes Solution Problem Understanding We are given two integers, a and b , written in some unknown base p . Vasya wants to compute the sum a + b in all valid bases and determine which base gives the sum with the largest number of digits. The key is that a number is only valid in a...

Practice › Codeforces Solutions ›

Codeforces Beta Round 72 (Div. 2 Only)

Codeforces Beta Round 72 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 900-1700 | Time: 4m 27s Problem Name Rating Tags Solve Time Verified A Toy Army 900 math, number-theory 1m 30s ✓ C Biathlon 1700 binary-search, implementation 2m 57s ✗

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1175 - Prime Arrangements

LeetCode Problem 1175 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to count how many permutations of numbers from 1 to n satisfy a specific condition: all prime numbers must appear at prime-numbered indices (1-indexed). For instance, in the permutation [1,2,5,4,3] for n = 5 , the primes 2, 3, and 5 appear at indices 2, 3, and 5 respectively, all of which are prime positions,...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1199 - Minimum Time to Build Blocks

LeetCode Problem 1199 Difficulty: 🔴 Hard Topics: Array, Math, Greedy, Heap (Priority Queue) Solution Problem Understanding The problem requires determining the minimum amount of time to build all blocks using workers that can either build blocks or split into more workers. You are given a list blocks where blocks[i] indicates the time it takes for a worker to complete the i -th block. Initially, there is only one worker, and...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1344 - Angle Between Hands of a Clock

LeetCode Problem 1344 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding This problem asks us to compute the smaller angle formed between the hour hand and the minute hand on a standard 12-hour analog clock given two integers, hour and minutes . The input hour ranges from 1 to 12 and represents the hour on the clock, while minutes ranges from 0 to 59 and represents the minute within that...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 908 - Smallest Range I

LeetCode Problem 908 Difficulty: 🟢 Easy Topics: Array, Math Solution LeetCode 908 - Smallest Range I Problem Understanding The problem gives us an integer array nums and an integer k . For every element in the array, we are allowed to modify it once by adding any integer value in the range [-k, k] . In other words, each number can either increase by at most k , decrease by...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 837 - New 21 Game

LeetCode Problem 837 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Sliding Window, Probability and Statistics Solution Problem Understanding In this problem, Alice repeatedly draws random numbers until her score reaches at least k . Every draw independently produces an integer between 1 and maxPts , inclusive, and each value is equally likely. We are asked to compute the probability that Alice's final score is less than or equal to n...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1621 - Number of Sets of K Non-Overlapping Line Segments

LeetCode Problem 1621 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Combinatorics, Prefix Sum Solution This guide is quite large and highly detailed under your required structure, especially with full worked examples, both Python and Go implementations, brute force plus optimal approaches, proof sketch, extensive test cases, and edge case analysis. To keep quality high and avoid truncation, I will provide it in a structured, comprehensive format. I will use the...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 335 - Self Crossing

LeetCode Problem 335 Difficulty: 🔴 Hard Topics: Array, Math, Geometry Solution Problem Understanding The problem describes a path traced on a two-dimensional grid. We begin at the origin (0, 0) and move according to the values in the distance array. The movement directions always rotate counter-clockwise in the following repeating order: north west south east Then the pattern repeats again. For example, if distance = [2,1,1,2] , the movement sequence...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 914 - X of a Kind in a Deck of Cards

LeetCode Problem 914 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Counting, Number Theory Solution Problem Understanding The problem asks whether it is possible to partition a deck of cards, represented as an integer array deck , into groups such that each group contains exactly x cards, all of which have the same integer value, and x is greater than 1. Essentially, we need to find a number x that...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 504 - Base 7

LeetCode Problem 504 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to convert a given integer num into its representation in base 7, returning the result as a string. In other words, instead of representing the number in the usual decimal system (base 10), we represent it in a numeral system where each digit represents a power of 7, ranging from 0 to 6. For...

Practice › Codeforces Solutions ›

Codeforces Beta Round 69 (Div. 2 Only)

Codeforces Beta Round 69 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1200 | Time: 2m 56s Problem Name Rating Tags Solve Time Verified A Panoramix's Prediction 800 brute-force 1m 18s ✓ B Depression 1200 geometry, math 1m 38s ✓

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1515 - Best Position for a Service Centre

LeetCode Problem 1515 Difficulty: 🔴 Hard Topics: Array, Math, Geometry, Randomized Solution Problem Understanding The problem asks us to find the optimal location for a service center on a 2D map such that the total Euclidean distance from the center to all customers is minimized. We are given the coordinates of customers as a list positions , where each element is a 2-element list [x, y] . The goal is...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 932 - Beautiful Array

LeetCode Problem 932 Difficulty: 🟡 Medium Topics: Array, Math, Divide and Conquer Solution Problem Understanding The problem asks us to construct a permutation of the integers from 1 to n such that the array satisfies a special condition. Specifically, for every pair of indices i < j , there must not exist any index k between them where: $2 \cdot nums[k] = nums[i] + nums[j]$ This condition means that no...

Practice › Codeforces Solutions › Codeforces Beta Round 76 (Div. 1 Only) ›

CF 93D - Flags

CF 93D - Flags Rating: 2500 Tags: dp, math, matrices Solve time: 3m 28s Verified: no Solution Problem Understanding We need to count stripe sequences built from four colors: black, red, white, and yellow. A sequence is valid if it satisfies several local restrictions. Equal adjacent colors are forbidden. White cannot touch yellow. Red cannot touch black. The length-3 patterns BWR and RWB are forbidden as well. Two flags are...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 50 - Pow(x, n)

LeetCode Problem 50 Difficulty: 🟡 Medium Topics: Math, Recursion Solution Problem Understanding The problem asks us to implement exponentiation manually, specifically computing: $$x^n$$ where x is a floating point number and n is an integer exponent. The input consists of two values: x , the base n , the exponent The output should be the result of raising x to the power n . A few examples clarify the behavior:...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1802 - Maximum Value at a Given Index in a Bounded Array

LeetCode Problem 1802 Difficulty: 🟡 Medium Topics: Math, Binary Search, Greedy Solution LeetCode 1802, Maximum Value at a Given Index in a Bounded Array Problem Understanding This problem asks us to construct an array of length n where every element is a positive integer, the difference between adjacent elements is at most 1 , and the total sum of the array does not exceed maxSum . Among all valid arrays,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 30 (Codeforces format)

Codeforces Beta Round 30 (Codeforces format) Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1400-2800 | Time: 7m 26s Problem Name Rating Tags Solve Time Verified A Accounting 1400 brute-force, math 1m 23s ✓ B Codeforces World Finals 1700 implementation 1m 1s ✓ C Shooting Gallery 1800 dp, probabilities 1m ✓ D King's Problem? 2600 geometry, greedy 2m 12s ✗ E Tricky and Clever Password 2800 binary-search,...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1776 - Car Fleet II

LeetCode Problem 1776 Difficulty: 🔴 Hard Topics: Array, Math, Stack, Heap (Priority Queue), Monotonic Stack Solution Problem Understanding The problem is asking us to compute the time at which each car in a line of cars collides with the car immediately in front of it, or return -1 if it never collides. Each car is represented by its position and speed. The cars are initially sorted by position in increasing...

Practice › Codeforces Solutions ›

Codeforces Beta Round 65 (Div. 2)

Codeforces Beta Round 65 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 800-2200 | Time: 8m 23s Problem Name Rating Tags Solve Time Verified A Way Too Long Words 800 strings 1m 28s ✓ B Progress Bar 1300 implementation, math 1m 7s ✓ C Round Table Knights 1600 dp, math, number-theory 1m 40s ✓ D Solitaire 2200 brute-force, implementation 2m 18s ✓ E Nuclear...

Practice › Codeforces Solutions ›

Codeforces Beta Round 66

Codeforces Beta Round 66 Type: Beta | Problems: 6 | Verified: 6/6 | Rating range: 1600-2900 | Time: 12m 59s Problem Name Rating Tags Solve Time Verified A The Elder Trolls IV: Oblivon 1600 greedy, math 1m 48s ✓ B Need For Brake 2000 binary-search, greedy, sortings 2m 9s ✓ C LionAge II 1800 dp 1m 27s ✓ D FreeDiv 2200 dfs-and-similar, graphs, greedy 2m 38s ✓ E Morrowindows 2400...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1041 - Robot Bounded In Circle

LeetCode Problem 1041 Difficulty: 🟡 Medium Topics: Math, String, Simulation Solution Problem Understanding This problem asks us to determine whether a robot moving on an infinite two dimensional plane will remain within some bounded region if it repeats a sequence of instructions forever. The robot starts at coordinate (0, 0) facing north. The input is a string called instructions , where each character represents an action: 'G' means move forward...

Practice › Codeforces Solutions › Unknown Language Round 2 ›

CF 72A - Goshtasp, Vishtasp and Eidi

CF 72A - Goshtasp, Vishtasp and Eidi Rating: 1800 Tags: *special, greedy, math Solve time: 1m 18s Verified: yes Solution Problem Understanding The problem asks us to decide whether a positive integer $n$ can be represented as a sum of distinct integers, where each integer is either 1 or a prime number. If such a representation exists, we need to produce one that is lexicographically largest. Lexicographically largest means that,...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 672 - Bulb Switcher II

LeetCode Problem 672 Difficulty: 🟡 Medium Topics: Math, Bit Manipulation, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem describes a room containing n light bulbs, where every bulb starts in the on state. There are four buttons available, and each button flips a specific subset of bulbs. Flipping means changing on to off or off to on . The four buttons behave as follows: Button 1 flips every bulb....

Practice › LeetCode › LeetCode 01xx ›

LeetCode 189 - Rotate Array

LeetCode Problem 189 Difficulty: 🟡 Medium Topics: Array, Math, Two Pointers Solution Problem Understanding The problem asks us to rotate a given integer array nums to the right by k steps. In other words, each element of the array should be shifted k positions forward, and the elements that "fall off" the end wrap around to the front of the array. For example, if nums = [1,2,3,4,5] and k =...

Practice › Codeforces Solutions › Codeforces Beta Round 85 (Div. 2 Only) ›

CF 112B - Petya and Square

CF 112B - Petya and Square Rating: 1200 Tags: implementation, math Solve time: 1m 42s Verified: yes Solution Problem Understanding We have a square board of size 2n × 2n , divided into unit cells. One cell is marked. We want to know whether it is possible to draw a cutting path along grid lines so that the board is split into two congruent parts after rotation, while the cutting...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 927 - Three Equal Parts

LeetCode Problem 927 Difficulty: 🔴 Hard Topics: Array, Math Solution Problem Understanding The problem asks us to partition a binary array arr into three non-empty contiguous segments such that each segment, when interpreted as a binary number (allowing leading zeros), is equal to the other two segments. The array contains only zeros and ones, and the goal is to return indices [i, j] where i + 1 < j such...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1518 - Water Bottles

LeetCode Problem 1518 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem is asking us to determine the maximum number of water bottles a person can drink given two integers: numBottles , the initial number of full bottles, and numExchange , the number of empty bottles that can be exchanged for one full bottle. Every time a full bottle is consumed, it becomes an empty bottle that can...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 492 - Construct the Rectangle

LeetCode Problem 492 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem gives us a single integer, area , which represents the area of a rectangle. Our task is to find two integers: L , the length W , the width such that: L * W == area L >= W L - W is as small as possible In other words, among all valid factor pairs of area...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1352 - Product of the Last K Numbers

LeetCode Problem 1352 Difficulty: 🟡 Medium Topics: Array, Math, Design, Data Stream, Prefix Sum Solution Problem Understanding This problem asks us to design a data structure that continuously processes a stream of integers and supports querying the product of the last k inserted numbers. The ProductOfNumbers class starts with an empty sequence. Every time add(num) is called, a new integer is appended to the stream. Later, getProduct(k) must return the...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1317 - Convert Integer to the Sum of Two No-Zero Integers

LeetCode Problem 1317 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to split a given integer n into two positive integers a and b such that: a + b = n Neither a nor b contains the digit 0 anywhere in their decimal representation Such integers are called No-Zero integers . The input is a single integer n , and the output should be a list...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 326 - Power of Three

LeetCode Problem 326 Difficulty: 🟢 Easy Topics: Math, Recursion Solution LeetCode 326 - Power of Three Problem Understanding The problem asks us to determine whether a given integer n can be represented as a power of three. In mathematical terms, we need to check whether there exists an integer x such that: $$n = 3^x$$ A power of three sequence looks like this: $$1, 3, 9, 27, 81, 243, \dots$$...

Practice › Codeforces Solutions ›

Codeforces Beta Round 76 (Div. 1 Only)

Codeforces Beta Round 76 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1700-2600 | Time: 10m 8s Problem Name Rating Tags Solve Time Verified A Frames 1700 implementation 1m 51s ✓ B End of Exams 1900 greedy 1m 43s ✗ C Azembler 2500 brute-force, implementation 2m 1s ✓ D Flags 2500 dp, math, matrices 3m 28s ✗ E Lostborn 2600 dp, math, number-theory...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1266 - Minimum Time Visiting All Points

LeetCode Problem 1266 Difficulty: 🟢 Easy Topics: Array, Math, Geometry Solution LeetCode 1266 - Minimum Time Visiting All Points Problem Understanding The problem gives a sequence of points on a 2D coordinate plane. Each point is represented as [x, y] , where x and y are integer coordinates. Your task is to determine the minimum number of seconds required to visit every point in the exact order they appear in...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1290 - Convert Binary Number in a Linked List to Integer

LeetCode Problem 1290 Difficulty: 🟢 Easy Topics: Linked List, Math Solution Problem Understanding The problem gives us the head of a singly linked list where every node contains either 0 or 1 . These values together represent a binary number. The head of the list stores the most significant bit, meaning the binary digits appear in the same order that we normally write binary numbers from left to right. Our...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1814 - Count Nice Pairs in an Array

LeetCode Problem 1814 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Counting Solution Problem Understanding The problem gives us an array of non-negative integers called nums . We need to count how many index pairs (i, j) satisfy the following conditions: i < j nums[i] + rev(nums[j]) == nums[j] + rev(nums[i]) Here, rev(x) means reversing the digits of the integer. For example: rev(123) = 321 rev(120) = 21 The goal...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 224 - Basic Calculator

LeetCode Problem 224 Difficulty: 🔴 Hard Topics: Math, String, Stack, Recursion Solution Problem Understanding The problem gives us a string representing a mathematical expression containing integers, addition, subtraction, parentheses, and spaces. Our task is to evaluate the expression and return the final integer result. The expression is guaranteed to be valid. That guarantee is extremely important because it simplifies parsing. We do not need to worry about malformed parentheses, invalid...

Practice › Codeforces Solutions › Yandex.Algorithm 2011: Round 2 ›

CF 86B - Tetris revisited

CF 86B - Tetris revisited Rating: 2200 Tags: constructive algorithms, graph matchings, greedy, math Solve time: 2m 5s Verified: yes Solution Problem Understanding We have a rectangular board where some cells are already blocked by # and the remaining cells . must be covered by polyominoes. The allowed pieces are extremely flexible: any connected shape consisting of 2, 3, 4, or 5 cells may be used, with arbitrary rotations and...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1056 - Confusing Number

LeetCode Problem 1056 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine whether a given integer becomes a different valid number after being rotated by 180 degrees. Not every digit remains valid after rotation. Only the following mappings are allowed: Original Digit Rotated Digit 0 0 1 1 6 9 8 8 9 6 Digits 2 , 3 , 4 , 5 , and 7...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1406 - Stone Game III

LeetCode Problem 1406 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Game Theory Solution Problem Understanding In this game, two players, Alice and Bob, take turns removing stones from the beginning of a row. Each stone has an integer value, which may be positive, zero, or negative. On each turn, a player may take exactly 1, 2, or 3 stones from the front of the remaining row. The score of...

Practice › Codeforces Solutions › Codeforces Beta Round 61 (Div. 2) ›

CF 66D - Petya and His Friends

CF 66D - Petya and His Friends Rating: 1700 Tags: constructive algorithms, math, number theory Solve time: 1m 57s Verified: no Solution Problem Understanding We need to construct n distinct positive integers with two simultaneous properties. First, every pair of numbers must share a common divisor larger than 1 . In other words, for every pair (ai, aj) , their gcd cannot equal 1 . Second, the gcd of the...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 587 - Erect the Fence

LeetCode Problem 587 Difficulty: 🔴 Hard Topics: Array, Math, Geometry Solution Problem Understanding This problem is asking us to find the convex hull of a set of points on a 2D plane. The input trees is a list of coordinates where each coordinate [xi, yi] represents the location of a tree in the garden. Our goal is to enclose all trees with a fence using the minimum perimeter, which means...

Practice › Codeforces Solutions ›

Codeforces Beta Round 69 (Div. 1 Only)

Codeforces Beta Round 69 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 2/5 | Rating range: 1400-2800 | Time: 11m 16s Problem Name Rating Tags Solve Time Verified A Heroes 1400 brute-force, implementation 1m 49s ✓ B Falling Anvils 1800 math, probabilities 2m 36s ✓ C Beavermuncher-0xFF 2100 dfs-and-similar, dp, dsu 2m 30s ✗ D Domino Carpet 2300 dp, implementation 1m 59s ✗ E Martian Food 2800...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 754 - Reach a Number

LeetCode Problem 754 Difficulty: 🟡 Medium Topics: Math, Binary Search Solution Problem Understanding The problem asks us to find the minimum number of moves required to reach a specific position on an infinite number line starting from position 0. Each move i allows you to move exactly i steps, either to the left or the right. The input is a single integer target , which can be positive or negative,...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1538 - Guess the Majority in a Hidden Array

LeetCode Problem 1538 Difficulty: 🟡 Medium Topics: Array, Math, Interactive Solution Problem Understanding This problem is an interactive problem. We do not receive the actual binary array directly. Instead, we can only gather information through the ArrayReader API. The hidden array nums contains only 0 and 1 . Our goal is to determine which value appears more frequently and return any index containing that majority value. If the number of...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 640 - Solve the Equation

LeetCode Problem 640 Difficulty: 🟡 Medium Topics: Math, String, Simulation Solution Problem Understanding The problem is asking us to solve a linear equation containing a single variable 'x' and integer coefficients, expressed as a string. The equation may include addition '+' , subtraction '-' , and the equality operator '=' . We need to parse this string, combine like terms, and solve for 'x' . The result should be returned...

Practice › Codeforces Solutions ›

Unknown Language Round 2

Unknown Language Round 2 Type: Special | Problems: 9 | Verified: 8/9 | Rating range: 1000-2300 | Time: 21m 37s Problem Name Rating Tags Solve Time Verified A Goshtasp, Vishtasp and Eidi 1800 *special, greedy, math 1m 18s ✓ B INI-file 2200 *special, implementation 1m 45s ✓ C Extraordinarily Nice Numbers 1200 *special, math 1m 26s ✓ D Perse-script 2300 *special, expression-parsing 1m 55s ✗ E Ali goes shopping 1800...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1680 - Concatenation of Consecutive Binary Numbers

LeetCode Problem 1680 Difficulty: 🟡 Medium Topics: Math, Bit Manipulation, Simulation Solution Problem Understanding The problem asks us to build a very large binary number by concatenating the binary representations of every integer from 1 through n , in order, and then return its decimal value modulo 10^9 + 7 . For example, if n = 3 : 1 in binary is "1" 2 in binary is "10" 3 in...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 171 - Excel Sheet Column Number

LeetCode Problem 171 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding This problem asks us to convert an Excel-style column title into its corresponding numerical index. In Excel spreadsheets, columns are labeled alphabetically: A -> 1 B -> 2 ... Z -> 26 AA -> 27 AB -> 28 The labeling system works similarly to a positional number system, except instead of digits 0-9 , it uses letters A-Z...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 390 - Elimination Game

LeetCode Problem 390 Difficulty: 🟡 Medium Topics: Math, Recursion Solution Problem Understanding The problem gives us a sorted list containing every integer from 1 to n . We repeatedly eliminate numbers in alternating directions until only one number remains. The elimination process works like this: In the first pass, we move from left to right and remove the first number and every other number after that. In the second pass,...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 899 - Orderly Queue

LeetCode Problem 899 Difficulty: 🔴 Hard Topics: Math, String, Sorting Solution LeetCode 899 - Orderly Queue Problem Understanding This problem gives us a string s and an integer k . We are allowed to repeatedly perform one operation: Choose one of the first k characters of the string. Remove that character from its current position. Append it to the end of the string. Our goal is to determine the lexicographically...

Practice › Codeforces Solutions ›

Codeforces Beta Round 41

Codeforces Beta Round 41 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1400-2700 | Time: 10m 20s Problem Name Rating Tags Solve Time Verified A Guilty --- to the kitchen! 1400 greedy, implementation 1m 32s ✓ B Game of chess unfinished 1700 implementation 2m 3s ✓ C Safe cracking 2200 brute-force, constructive-algorithms 1m 2s ✓ D Strange town 2300 constructive-algorithms, math 1m 50s ✗ E Baldman and...

Practice › Codeforces Solutions ›

Codeforces Beta Round 86 (Div. 1 Only)

Codeforces Beta Round 86 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1600-2700 | Time: 15m 15s Problem Name Rating Tags Solve Time Verified A Grammar Lessons 1600 implementation, strings 4m 41s ✓ B Petr# 2000 brute-force, data-structures, hashing 3m 20s ✓ C Double Happiness 2200 brute-force, math, number-theory 3m 20s ✓ D Museum 2700 math, matrices, probabilities 1m 55s ✓ E Sleeping...

Practice › Codeforces Solutions ›

Codeforces Testing Round 3

Codeforces Testing Round 3 Type: Special | Problems: 3 | Verified: 2/3 | Rating range: 1200-2200 | Time: 5m 24s Problem Name Rating Tags Solve Time Verified A Average Numbers 1200 brute-force, implementation 1m 39s ✓ B Pairs of Numbers 1900 brute-force, dfs-and-similar, math 1m 30s ✓ C Swaps 2200 constructive-algorithms, graphs, greedy 2m 15s ✗

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1359 - Count All Valid Pickup and Delivery Options

LeetCode Problem 1359 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding This problem asks us to count the number of valid sequences for performing pickups and deliveries for n orders. Each order consists of a pickup Pi and a delivery Di , and the key constraint is that the delivery for any order must happen after its corresponding pickup. The input is a single integer n representing...

Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39D - Cubical Planet

CF 39D - Cubical Planet Rating: 1100 Tags: math Solve time: 1m 27s Verified: yes Solution Problem Understanding We are given two vertices of a unit cube. Each vertex is described by three coordinates, and every coordinate is either 0 or 1 . Since each coordinate can only take two values, these coordinates represent the eight corners of the cube. Two flies stand on two different vertices. They can see...

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40A - Find Color

CF 40A - Find Color Rating: 1300 Tags: constructive algorithms, geometry, implementation, math Solve time: 1m 24s Verified: yes Solution Problem Understanding The plane is colored using concentric rings centered at the origin. Every ring between two consecutive integer distances alternates color. The borders themselves, meaning all points whose distance from the origin is an integer, are always black. For a point (x, y) , we need to determine whether...

Practice › Codeforces Solutions ›

Codeforces Beta Round 95 (Div. 2)

Codeforces Beta Round 95 (Div. 2) Type: Div. 2 | Problems: 6 | Verified: 5/6 | Rating range: 1000-2000 | Time: 10m 6s Problem Name Rating Tags Solve Time Verified A cAPS lOCK 1000 implementation, strings 1m 16s ✓ B Opposites Attract 1200 implementation, math 1m 34s ✓ C The World is a Theatre 1400 combinatorics, math 1m 35s ✓ D Subway 1600 dfs-and-similar, graphs 1m 14s ✓ E Yet...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 89 - Gray Code

LeetCode Problem 89 Difficulty: 🟡 Medium Topics: Math, Backtracking, Bit Manipulation Solution LeetCode 89 - Gray Code Problem Understanding The problem asks us to generate a valid Gray code sequence for a given number of bits, n . A Gray code sequence is a special ordering of numbers where every adjacent pair differs by exactly one bit in binary form. In addition, the sequence is cyclic, meaning the first and...

Practice › Codeforces Solutions ›

Codeforces Beta Round 4 (Div. 2 Only)

Codeforces Beta Round 4 (Div. 2 Only) Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 800-1700 | Time: 4m 57s Problem Name Rating Tags Solve Time Verified A Watermelon 800 brute-force, math 46s ✓ B Before an Exam 1200 constructive-algorithms, greedy 1m 12s ✓ C Registration System 1300 data-structures, hashing, implementation 1m 42s ✓ D Mysterious Present 1700 dp, sortings 1m 17s ✓

Practice › Codeforces Solutions › Codeforces Beta Round 53 ›

CF 57D - Journey

CF 57D - Journey Rating: 2500 Tags: dp, math Solve time: 2m 2s Verified: yes Solution Problem Understanding We are asked to compute the expected lifespan of a dynamic particle moving on a 2D grid with static obstacles. The grid has n rows and m columns. Static particles occupy certain cells, never sharing a row, column, or diagonally adjacent cell. Dynamic particles appear in any empty cell and choose a...

Practice › Codeforces Solutions ›

Codeforces Beta Round 47

Codeforces Beta Round 47 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 800-2300 | Time: 6m 55s Problem Name Rating Tags Solve Time Verified A Domino piling 800 greedy, math 1m 5s ✓ B Choosing Symbol Pairs 1500 strings 1m 15s ✓ C Happy Farm 5 2000 geometry 55s ✓ D Bombing 2100 binary-search, dp, probabilities 1m 42s ✗ E Square Equation Roots 2300 math 1m 58s...

Practice › Codeforces Solutions ›

Codeforces Beta Round 24

Codeforces Beta Round 24 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1400-2400 | Time: 11m 12s Problem Name Rating Tags Solve Time Verified A Ring road 1400 graphs 3m 36s ✓ B F1 Champions 1500 implementation 2m 19s ✓ C Sequence of points 1800 geometry, implementation, math 2m 35s ✓ D Broken robot 2400 dp, math, probabilities 1m 34s ✓ E Berland collider 2300 binary-search 1m...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 829 - Consecutive Numbers Sum

LeetCode Problem 829 Difficulty: 🔴 Hard Topics: Math, Enumeration Solution Problem Understanding The problem asks us to determine in how many distinct ways an integer n can be expressed as a sum of consecutive positive integers. In other words, we need to find sequences of integers starting from some positive number x and having length k such that the sum of that sequence equals n . The sequences must consist...

Practice › Codeforces Solutions › Codeforces Beta Round 23 ›

CF 23D - Tetragon

CF 23D - Tetragon Rating: 2600 Tags: geometry, math Solve time: 2m 11s Verified: no Solution Problem Understanding We are given three points in the plane. Each point is the midpoint of one side of an unknown strictly convex quadrilateral, and all four sides of that quadrilateral have equal length. The task is to reconstruct any valid quadrilateral that satisfies these conditions, or determine that no such quadrilateral exists. The...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 782 - Transform to Chessboard

LeetCode Problem 782 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation, Matrix Solution LeetCode 782 - Transform to Chessboard Problem Understanding This problem gives us an n x n binary matrix called board , where every cell contains either 0 or 1 . In one operation, we are allowed to swap any two rows or swap any two columns. The goal is to determine the minimum number of swaps required...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 380 - Insert Delete GetRandom O(1)

LeetCode Problem 380 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Design, Randomized Solution Problem Understanding This problem asks us to design a custom data structure called RandomizedSet that supports three operations: Insert a value into the set. Remove a value from the set. Return a random element from the set. The critical requirement is that all three operations must run in average O(1) time complexity. The behavior is very...

Practice › Codeforces Solutions › Unknown Language Round 1 ›

CF 64C - Table

CF 64C - Table Rating: 1600 Tags: *special, greedy, implementation, math Solve time: 1m 25s Verified: yes Solution Problem Understanding We are given an $n \times m$ table filled with consecutive integers starting from 1. The filling is done row by row, left to right. For example, if $n=3$ and $m=4$, the table looks like this: 1 2 3 4 5 6 7 8 9 10 11 12 Then, the...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1252 - Cells with Odd Values in a Matrix

LeetCode Problem 1252 Difficulty: 🟢 Easy Topics: Array, Math, Simulation Solution Problem Understanding The problem gives us an m x n matrix where every cell initially contains 0 . We are also given a list called indices , where each element is a pair [ri, ci] . For every pair [ri, ci] , we must perform two operations: Increment every value in row ri by 1 Increment every value in...

Practice › Codeforces Solutions ›

School Regional Team Contest, Saratov, 2011

School Regional Team Contest, Saratov, 2011 Type: Special | Problems: 10 | Verified: 8/10 | Rating range: 1000-2200 | Time: 16m 31s Problem Name Rating Tags Solve Time Verified A Elevator 1000 brute-force, implementation, math 1m 26s ✓ B Quiz League 1100 implementation 1m 21s ✓ C Winnie-the-Pooh and honey 1100 implementation, math 1m 39s ✓ D Three Sons 1400 brute-force 1m 35s ✓ E Put Knight! 1400 games, math...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 470 - Implement Rand10() Using Rand7()

LeetCode Problem 470 Difficulty: 🟡 Medium Topics: Math, Rejection Sampling, Randomized, Probability and Statistics Solution Problem Understanding The problem provides access to a single API, rand7() , which returns a uniformly random integer from 1 to 7 . The task is to implement another function, rand10() , which must return a uniformly random integer from 1 to 10 . The important constraint is that we are not allowed to use...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1281 - Subtract the Product and Sum of Digits of an Integer

LeetCode Problem 1281 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to compute a simple mathematical transformation on the digits of an integer. Given an integer n , we are required to find the product of its digits and the sum of its digits, then return the difference: product - sum . In other words, for a number like 234 , the digits are 2 ,...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 371 - Sum of Two Integers

LeetCode Problem 371 Difficulty: 🟡 Medium Topics: Math, Bit Manipulation Solution Problem Understanding The problem asks us to compute the sum of two integers without using the arithmetic operators + and - . Instead of relying on normal arithmetic, we must use bit manipulation to simulate how addition works at the binary level. The input consists of two integers, a and b . These integers can be positive, negative, or...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 149 - Max Points on a Line

LeetCode Problem 149 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Geometry Solution Problem Understanding The problem gives us a list of points on a 2D coordinate plane. Each point is represented as [x, y] , where x and y are integer coordinates. Our task is to determine the maximum number of points that lie on the same straight line. In other words, among all possible lines that can be...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1248 - Count Number of Nice Subarrays

LeetCode Problem 1248 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Sliding Window, Prefix Sum Solution Problem Understanding The problem asks us to count how many contiguous subarrays contain exactly k odd numbers. We are given an integer array nums and an integer k . A subarray is any continuous segment of the array, meaning the elements must appear next to each other in the original order. A subarray is...

Practice › Codeforces Solutions ›

Codeforces Beta Round 74 (Div. 2 Only)

Codeforces Beta Round 74 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1100 | Time: 3m 17s Problem Name Rating Tags Solve Time Verified A Cableway 1000 greedy, math 1m 33s ✓ B African Crossword 1100 implementation, strings 1m 44s ✓

Practice › LeetCode › LeetCode 00xx ›

LeetCode 69 - Sqrt(x)

LeetCode Problem 69 Difficulty: 🟢 Easy Topics: Math, Binary Search Solution Problem Understanding The problem asks us to compute the integer square root of a non negative integer x . More specifically, we need to return the largest integer k such that: $$k^2 \leq x$$ This means we are not looking for the exact decimal square root. Instead, we must round down to the nearest integer. For example, the square...

Practice › Codeforces Solutions › Codeforces Alpha Round 20 (Codeforces format) ›

CF 20B - Equation

CF 20B - Equation Rating: 2000 Tags: math Solve time: 1m 5s Verified: yes Solution Problem Understanding We are asked to solve a quadratic equation of the form $Ax^2 + Bx + C = 0$, where $A$, $B$, and $C$ are integers in the range $[-10^5, 10^5]$. The goal is to find all real roots of the equation, count them, and print them in ascending order with high precision. If...

Practice › Codeforces Solutions › Codeforces Beta Round 69 (Div. 1 Only) ›

CF 77B - Falling Anvils

CF 77B - Falling Anvils Rating: 1800 Tags: math, probabilities Solve time: 2m 36s Verified: yes Solution Problem Understanding We are given two real parameters chosen uniformly at random. The victim height p lies in the interval [0, a] , and the wind parameter q lies in [-b, b] . For every pair (p, q) , the anvil hits successfully if a certain quadratic equation has at least one real...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1486 - XOR Operation in an Array

LeetCode Problem 1486 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation Solution Problem Understanding The problem gives us two integers, n and start . We must construct an array named nums of length n , where each element is defined by the formula: $$nums[i] = start + 2 \times i$$ This means the array begins at start and increases by 2 for every next position. After constructing the array, we must...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 878 - Nth Magical Number

LeetCode Problem 878 Difficulty: 🔴 Hard Topics: Math, Binary Search Solution Problem Understanding The problem asks us to find the n th positive integer that is divisible by either a or b . A number is considered magical if at least one of the following is true: It is divisible by a It is divisible by b We are given three integers: n , the position of the magical number...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1837 - Sum of Digits in Base K

LeetCode Problem 1837 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem is asking us to convert a given integer n from base 10 into another base k , then compute the sum of its digits in that base. For example, if n is 34 and k is 6, first we convert 34 into base 6, which yields 54 , and then sum the digits: 5 + 4 =...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 67 - Add Binary

LeetCode Problem 67 Difficulty: 🟢 Easy Topics: Math, String, Bit Manipulation, Simulation Solution LeetCode 67, Add Binary Problem Statement You are given two strings, a and b , where each string represents a binary number. A binary number contains only the characters '0' and '1' . The task is to add these two binary numbers together and return the result as another binary string. Unlike normal decimal addition, binary addition...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1453 - Maximum Number of Darts Inside of a Circular Dartboard

LeetCode Problem 1453 Difficulty: 🔴 Hard Topics: Array, Math, Geometry Solution Problem Understanding In this problem, we are given the coordinates of several darts thrown onto a 2D plane. Each dart is represented as a point (x, y) . We are also given a radius r , which represents the radius of a circular dartboard. The task is to place a circle of radius r somewhere on the plane so...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1690 - Stone Game VII

LeetCode Problem 1690 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Game Theory Solution Problem Understanding This problem describes a two player game played on an array of stones. Each stone has a positive integer value, and the stones are arranged in a row. Alice moves first, and on every turn the current player removes either the leftmost stone or the rightmost stone. The scoring rule is the key detail...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1256 - Encode Number

LeetCode Problem 1256 Difficulty: 🟡 Medium Topics: Math, String, Bit Manipulation Solution Sure, let's build a full, detailed technical solution guide for LeetCode 1256 following your requested structure. Problem Understanding The problem asks us to take a non-negative integer num and encode it as a string using a secret encoding rule. The examples indicate that this encoding is not standard binary, decimal, or hexadecimal conversion, but follows a pattern where...

Practice › Codeforces Solutions ›

Codeforces Beta Round 75 (Div. 2 Only)

Codeforces Beta Round 75 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1300 | Time: 4m 34s Problem Name Rating Tags Solve Time Verified A Chips 800 implementation, math 3m 15s ✓ B Binary Number 1300 greedy 1m 19s ✓

Practice › LeetCode › LeetCode 00xx ›

LeetCode 48 - Rotate Image

LeetCode Problem 48 Difficulty: 🟡 Medium Topics: Array, Math, Matrix Solution Rotate Image Problem Understanding The problem gives us an n x n square matrix that represents an image. Each element in the matrix corresponds to a pixel or value in the image. Our task is to rotate the entire image by 90 degrees clockwise. The important requirement is that the rotation must happen in-place. This means we are not...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1759 - Count Number of Homogenous Substrings

LeetCode Problem 1759 Difficulty: 🟡 Medium Topics: Math, String Solution Problem Understanding The problem asks us to count all substrings in a string where every character inside the substring is identical. These are called homogenous substrings. A substring must be contiguous, meaning the characters must appear next to each other in the original string. For example, in the string "abbcccaa" , the substring "ccc" is valid because all characters are...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 920 - Number of Music Playlists

LeetCode Problem 920 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem gives us n unique songs and asks us to build playlists of length goal . Songs may repeat, but two important constraints must always hold. First, every one of the n songs must appear at least once in the playlist. Second, once a song has been played, it cannot be played again until at...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 483 - Smallest Good Base

LeetCode Problem 483 Difficulty: 🔴 Hard Topics: Math, Binary Search Solution Problem Understanding The problem is asking us to find the smallest integer k >= 2 such that a given number n can be represented in base k with all digits equal to 1 . In other words, we want n to be a sum of consecutive powers of k , like 1 + k + k^2 + ... +...

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76D - Plus and xor

CF 76D - Plus and xor Rating: 1700 Tags: dp, greedy, math Solve time: 1m 46s Verified: yes Solution Problem Understanding We are given two non-negative integers, A and B . We need to construct two other non-negative integers, X and Y , such that: their sum equals A their bitwise xor equals B Among all valid pairs, we must output the one with the smallest possible X . The...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 375 - Guess Number Higher or Lower II

LeetCode Problem 375 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Game Theory Solution Problem Understanding This problem is a variant of the classic number guessing game with a twist: incorrect guesses cost money equal to the value guessed, and the goal is to minimize the maximum cost required to guarantee a win . In other words, we want a strategy that ensures we will always find the correct number while...

Practice › Codeforces Solutions ›

Codeforces Beta Round 97 (Div. 1)

Codeforces Beta Round 97 (Div. 1) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1300-3000 | Time: 9m 14s Problem Name Rating Tags Solve Time Verified A Replacement 1300 greedy, implementation, sortings 1m 34s ✓ B Rectangle and Square 1600 brute-force, geometry, math 2m 3s ✓ C Zero-One 1900 constructive-algorithms, games, greedy 1m 50s ✓ D Cycle 2500 brute-force, dfs-and-similar, implementation 1m 50s ✓ E Weak...

Practice › Codeforces Solutions › Codeforces Testing Round 3 ›

CF 134B - Pairs of Numbers

CF 134B - Pairs of Numbers Rating: 1900 Tags: brute force, dfs and similar, math, number theory Solve time: 1m 30s Verified: yes Solution Problem Understanding We are asked to start with the number pair (1,1) and reach a pair where at least one of the numbers equals a given target n . At each step, we can add one number to the other to form a new pair. Concretely,...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 292 - Nim Game

LeetCode Problem 292 Difficulty: 🟢 Easy Topics: Math, Brainteaser, Game Theory Solution Problem Understanding The problem describes a two-player game involving a single heap of stones. There are n stones initially on the table, and players alternate turns removing stones. On each turn, a player may remove either 1, 2, or 3 stones. The player who removes the final stone wins the game. You always move first, and both players...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 469 - Convex Polygon

LeetCode Problem 469 Difficulty: 🟡 Medium Topics: Array, Math, Geometry Solution Problem Understanding The problem gives us a sequence of points on a 2D plane. These points are connected in order, and the final point connects back to the first point, forming a polygon. Our task is to determine whether that polygon is convex. A polygon is convex if every internal angle is less than 180 degrees. Another equivalent geometric...

Practice › Codeforces Solutions ›

Codeforces Beta Round 15

Codeforces Beta Round 15 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1200-2600 | Time: 11m 13s Problem Name Rating Tags Solve Time Verified A Cottage Village 1200 implementation, sortings 2m 21s ✓ B Laser 1800 math 2m 54s ✓ C Industrial Nim 2000 games 2m 25s ✓ D Map 2500 data-structures, implementation, sortings 2m 12s ✓ E Triangles 2600 combinatorics, dp 1m 21s ✓

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1201 - Ugly Number III

LeetCode Problem 1201 Difficulty: 🟡 Medium Topics: Math, Binary Search, Combinatorics, Number Theory Solution Problem Understanding The problem defines an "ugly number" as any positive integer that is divisible by at least one of the three given integers a , b , or c . We are given four integers: n , representing which ugly number we want to find a , b , and c , representing the divisibility...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 892 - Surface Area of 3D Shapes

LeetCode Problem 892 Difficulty: 🟢 Easy Topics: Array, Math, Geometry, Matrix Solution Problem Understanding The problem gives us an n x n matrix called grid , where each cell contains a non-negative integer. The value grid[i][j] represents how many 1 x 1 x 1 cubes are stacked vertically at position (i, j) . Each cube contributes surface area through its exposed faces. A single cube has 6 faces, but when...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 405 - Convert a Number to Hexadecimal

LeetCode Problem 405 Difficulty: 🟢 Easy Topics: Math, String, Bit Manipulation Solution Problem Understanding The problem asks us to convert a given 32-bit integer num into its hexadecimal representation as a string. Hexadecimal, or base-16, uses digits 0-9 and letters a-f to represent values 0-15 . For positive numbers, the conversion is straightforward: repeatedly divide the number by 16 and map remainders to the hexadecimal digits. For negative numbers, the...

Practice › Codeforces Solutions › School Regional Team Contest, Saratov, 2011 ›

CF 120A - Elevator

CF 120A - Elevator Rating: 1000 Tags: brute force, implementation, math Solve time: 1m 26s Verified: yes Solution Problem Understanding We are given two pieces of information about a person riding an elevator. The first input tells us which door the person used to enter, either the front door or the back door. The second input tells us which rail the person was holding, rail 1 or rail 2. The...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1753 - Maximum Score From Removing Stones

LeetCode Problem 1753 Difficulty: 🟡 Medium Topics: Math, Greedy, Heap (Priority Queue) Solution Problem Understanding The problem is a combinatorial game involving three piles of stones with counts a , b , and c . In each move, you are allowed to pick two different non-empty piles and remove one stone from each , earning 1 point per move. The game ends when fewer than two piles have stones left....

Practice › Codeforces Solutions ›

Codeforces Beta Round 61 (Div. 2)

Codeforces Beta Round 61 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1100-2000 | Time: 9m 20s Problem Name Rating Tags Solve Time Verified A Petya and Java 1300 implementation, strings 1m 33s ✓ B Petya and Countryside 1100 brute-force, implementation 1m 25s ✓ C Petya and File System 1800 data-structures, implementation 2m 13s ✓ D Petya and His Friends 1700 constructive-algorithms, math, number-theory...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1017 - Convert to Base -2

LeetCode Problem 1017 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding This problem asks us to convert a non-negative integer n into its representation using base -2 , instead of the usual positive bases such as base 2 , base 10 , or base 16 . In standard binary representation, numbers are written as powers of 2 . For example: $$13 = 1 \times 2^3 + 1 \times 2^2 +...

Practice › Codeforces Solutions ›

Codeforces Beta Round 88

Codeforces Beta Round 88 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1300-2900 | Time: 13m 35s Problem Name Rating Tags Solve Time Verified A Elevator 1300 implementation, math 2m 31s ✓ B Very Interesting Game 1800 brute-force, number-theory 2m 31s ✓ C Cycle 2000 dfs-and-similar, graphs 3m ✓ D Not Quick Transformation 2500 divide-and-conquer, math 2m 20s ✓ E Tree or not Tree 2900 data-structures, divide-and-conquer,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 76 (Div. 2 Only)

Codeforces Beta Round 76 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 900-1300 | Time: 3m 35s Problem Name Rating Tags Solve Time Verified A Restoring Password 900 implementation, strings 1m 58s ✓ B Friends 1300 graphs, implementation, math 1m 37s ✓

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1492 - The kth Factor of n

LeetCode Problem 1492 Difficulty: 🟡 Medium Topics: Math, Number Theory Solution Problem Understanding The problem asks us to find the kth factor of a positive integer n , where the factors are ordered in ascending order. A factor of n is any integer i such that: $n \bmod i = 0$ For example, if n = 12 , the factors are: [1, 2, 3, 4, 6, 12] If k =...

Practice › Codeforces Solutions › Codeforces Beta Round 69 (Div. 2 Only) ›

CF 80B - Depression

CF 80B - Depression Rating: 1200 Tags: geometry, math Solve time: 1m 38s Verified: yes Solution Problem Understanding We are given a digital time in HH:MM format and need to determine how far the analog clock hands must rotate from the initial position 12:00 . The clock starts with both hands pointing at 12. We may rotate each hand independently, and only in the clockwise direction. The task is to...

Practice › Codeforces Solutions ›

Codeforces Beta Round 60

Codeforces Beta Round 60 Type: Beta | Problems: 5 | Verified: 3/5 | Rating range: 1700-2900 | Time: 11m 31s Problem Name Rating Tags Solve Time Verified A Harry Potter and Three Spells 1800 implementation, math 2m 2s ✓ B Harry Potter and the History of Magic 1700 brute-force, greedy, implementation 2m 33s ✗ C Harry Potter and the Golden Snitch 2100 binary-search, geometry 2m 11s ✓ D Harry Potter...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1247 - Minimum Swaps to Make Strings Equal

LeetCode Problem 1247 Difficulty: 🟡 Medium Topics: Math, String, Greedy Solution Problem Understanding This problem asks us to determine the minimum number of swaps needed to make two strings, s1 and s2 , equal. Both strings are of the same length and consist only of the characters "x" and "y" . The allowed swap operation is restricted: you may only swap characters between the two strings, not within the same...

Practice › Codeforces Solutions ›

Codeforces Beta Round 2

Codeforces Beta Round 2 Type: Beta | Problems: 3 | Verified: 2/3 | Rating range: 1500-2600 | Time: 5m 52s Problem Name Rating Tags Solve Time Verified A Winner 1500 hashing, implementation 1m 9s ✓ B The least round way 2000 dp, math 3m 7s ✗ C Commentator problem 2600 geometry 1m 36s ✓

Practice › LeetCode › LeetCode 07xx ›

LeetCode 780 - Reaching Points

LeetCode Problem 780 Difficulty: 🔴 Hard Topics: Math Solution Problem Understanding The problem asks whether it is possible to transform a starting point (sx, sy) to a target point (tx, ty) using a defined set of operations. Specifically, from a point (x, y) , you can either move to (x, x + y) or (x + y, y) . The inputs sx , sy , tx , and ty are...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 772 - Basic Calculator III

LeetCode Problem 772 Difficulty: 🔴 Hard Topics: Math, String, Stack, Recursion Solution LeetCode 772 - Basic Calculator III Problem Understanding This problem asks us to evaluate a mathematical expression represented as a string. The expression may contain: Non-negative integers Addition ( + ) Subtraction ( - ) Multiplication ( * ) Division ( / ) Parentheses ( ( and ) ) The goal is to compute the final integer result...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 877 - Stone Game

LeetCode Problem 877 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Game Theory Solution Problem Understanding The problem describes a two-player game played on an array of stone piles. Each pile contains a positive number of stones, and the piles are arranged in a row. Alice and Bob alternate turns, with Alice always moving first. On each turn, the current player may only take the pile from the left end...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1071 - Greatest Common Divisor of Strings

LeetCode Problem 1071 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to find the greatest common divisor (GCD) of two strings. In this context, a string t divides another string s if s can be formed by concatenating t multiple times. The goal is to find the largest string x that divides both str1 and str2 . The input consists of two non-empty strings, str1...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 564 - Find the Closest Palindrome

LeetCode Problem 564 Difficulty: 🔴 Hard Topics: Math, String Solution Problem Understanding The problem gives us a string n representing a positive integer, and asks us to find the numerically closest palindrome that is not equal to the original number itself. A palindrome is a number that reads the same forward and backward. Examples include 121 , 999 , and 1331 . The key requirement is that we minimize the...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 883 - Projection Area of 3D Shapes

LeetCode Problem 883 Difficulty: 🟢 Easy Topics: Array, Math, Geometry, Matrix Solution Problem Understanding The problem gives us an n x n matrix called grid . Each cell grid[i][j] represents how many 1 x 1 x 1 cubes are stacked vertically at position (i, j) on a flat surface. We must calculate the total area of the projections of this 3D structure onto three planes: The xy plane, which is...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1295 - Find Numbers with Even Number of Digits

LeetCode Problem 1295 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to determine how many numbers in a given array nums have an even number of digits . The input is an array of integers, and the output is a single integer representing the count of numbers with an even digit length. For example, the number 12 has 2 digits, which is even, while 345...

Practice › Codeforces Solutions ›

Codeforces Beta Round 72 (Div. 1 Only)

Codeforces Beta Round 72 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1300-2800 | Time: 9m 17s Problem Name Rating Tags Solve Time Verified A Magical Array 1300 math 1m 28s ✓ B Doctor 1800 binary-search, math, sortings 1m 37s ✓ C Track 2400 graphs, greedy, shortest-paths 2m 22s ✓ D Numbers 2400 dp, math, number-theory 2m 7s ✓ E Two Subsequences 2800...

Practice › Codeforces Solutions › Codeforces Beta Round 1 ›

CF 1A - Theatre Square

Problem Understanding We are given a rectangular plaza, the Theatre Square, with dimensions n meters in length and m meters in width. The city wants to pave the entire area with square flagstones of side a . The question asks for the minimum number of flagstones required to cover the square completely. Each flagstone must be placed aligned with the sides of the square; we cannot cut them, but it...

Practice › Codeforces Solutions › Codeforces Beta Round 60 ›

CF 65A - Harry Potter and Three Spells

CF 65A - Harry Potter and Three Spells Rating: 1800 Tags: implementation, math Solve time: 2m 2s Verified: yes Solution Problem Understanding We have three transformation spells that convert one material into another. The first spell turns a grams of sand into b grams of lead. The second spell turns c grams of lead into d grams of gold. The third spell turns e grams of gold into f grams...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1510 - Stone Game IV

LeetCode Problem 1510 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Game Theory Solution Problem Understanding This problem is a two-player combinatorial game problem where Alice and Bob alternately remove stones from a single pile. On each turn, a player may remove any positive number of stones that is a perfect square (1, 4, 9, 16, etc.) as long as that number does not exceed the current pile size. The game...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 793 - Preimage Size of Factorial Zeroes Function

LeetCode Problem 793 Difficulty: 🔴 Hard Topics: Math, Binary Search Solution Problem Understanding This problem asks us to determine how many non-negative integers x exist such that the factorial of x ends with exactly k trailing zeroes. The function f(x) counts trailing zeroes in x! . For example, f(3) = 0 because 3! = 6 has no trailing zeroes, and f(11) = 2 because 11! = 39916800 has two trailing...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 634 - Find the Derangement of An Array

LeetCode Problem 634 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem asks us to count how many permutations of the numbers 1 through n are valid derangements. A derangement is a permutation where no element remains in its original position. For example, when n = 3 , the original array is [1, 2, 3] . A permutation like [2, 3, 1] is valid because: 1...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 775 - Global and Local Inversions

LeetCode Problem 775 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem presents an array nums of length n that is a permutation of integers from 0 to n-1 . A global inversion is defined as any pair (i, j) such that i < j and nums[i] > nums[j] , meaning the earlier element is larger than a later element anywhere in the array. A local inversion is...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 282 - Expression Add Operators

LeetCode Problem 282 Difficulty: 🔴 Hard Topics: Math, String, Backtracking Solution Problem Understanding The problem gives us a numeric string num and an integer target . We must insert binary operators, specifically '+' , '-' , and '*' , between the digits of the string so that the resulting mathematical expression evaluates exactly to target . The important detail is that we are not allowed to reorder digits. We may...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 553 - Optimal Division

LeetCode Problem 553 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution Problem Understanding The problem gives us an array of positive integers, and the array elements are combined using division operations in order from left to right. For example, if the input is: [2, 3, 4] the default expression becomes: 2/3/4 which evaluates as: (2/3)/4 because division is left associative. The key part of the problem is that we...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 910 - Smallest Range II

LeetCode Problem 910 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Sorting Solution LeetCode 910, Smallest Range II Problem Understanding The problem gives us an integer array nums and an integer k . For every element in the array, we must choose exactly one of two operations: add k subtract k After modifying every element, we calculate the score of the array, which is defined as: max(nums) - min(nums) Our goal...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1799 - Maximize Score After N Operations

LeetCode Problem 1799 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask Solution Problem Understanding The problem asks us to maximize the total score obtained by performing n operations on an array nums of size 2 * n . In each operation, you select two elements from the array, calculate the greatest common divisor (GCD) of the two elements, multiply it by the operation index...

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 2) ›

CF 136B - Ternary Logic

CF 136B - Ternary Logic Rating: 1100 Tags: implementation, math Solve time: 1m 41s Verified: yes Solution Problem Understanding We are given two decimal integers, a and c . The computer in this problem does not use binary xor. Instead, it uses a ternary operation called tor . To apply tor , both numbers are written in base 3. If one number has fewer digits, we pad it with leading...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 963 - Minimum Area Rectangle II

LeetCode Problem 963 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Geometry Solution Problem Understanding The problem gives us a collection of unique points on a 2D plane. Our task is to determine the minimum possible area of any rectangle that can be formed using exactly four of these points as vertices. The important detail is that the rectangle does not need to be aligned with the coordinate axes. This...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1686 - Stone Game VI

LeetCode Problem 1686 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Sorting, Heap (Priority Queue), Game Theory Solution This is a long, structured technical guide with multiple substantial sections, worked examples, code, tables, and test coverage. To make sure it is complete and properly formatted according to your rules, I should generate it as a document/canvas rather than risk truncation in chat. I can produce the full guide for LeetCode 1686...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1577 - Number of Ways Where Square of Number Is Equal to Product of Two Numbers

LeetCode Problem 1577 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Two Pointers Solution LeetCode 1577, Number of Ways Where Square of Number Is Equal to Product of Two Numbers Problem Understanding The problem gives us two integer arrays, nums1 and nums2 . We must count the number of valid triplets that satisfy one of two mathematical relationships. A Type 1 triplet exists when: We pick one element from nums1...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1230 - Toss Strange Coins

LeetCode Problem 1230 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Probability and Statistics Solution Problem Understanding This problem is asking us to calculate the probability that, when tossing a set of coins, exactly a specific number of them come up heads. Each coin has its own individual probability of landing heads, which is given in the input array prob . The integer target represents the exact number of heads...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1058 - Minimize Rounding Error to Meet Target

LeetCode Problem 1058 Difficulty: 🟡 Medium Topics: Array, Math, String, Greedy, Sorting Solution Problem Understanding The problem asks us to round an array of decimal prices to integers such that the sum of the rounded numbers equals a given target, while minimizing the total rounding error. Each price can be rounded either down ( Floor ) or up ( Ceil ). The rounding error for each price is defined as...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 400 - Nth Digit

LeetCode Problem 400 Difficulty: 🟡 Medium Topics: Math, Binary Search Solution Problem Understanding The problem asks us to find the digit that appears at position n in an infinitely long sequence formed by concatenating all positive integers together. The sequence looks like this: 1 2 3 4 5 6 7 8 9 10 11 12 13 ... If we write it as one continuous string, it becomes: 1234567891011121314... The input...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 651 - 4 Keys Keyboard

LeetCode Problem 651 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution Problem Understanding The problem gives us a keyboard with four operations: Press A , which inserts one character 'A' Press Ctrl-A , which selects everything currently on the screen Press Ctrl-C , which copies the selected text into a clipboard buffer Press Ctrl-V , which pastes the clipboard contents onto the screen We are given an integer n ,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 87 (Div. 1 Only)

Codeforces Beta Round 87 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 900-2600 | Time: 11m 15s Problem Name Rating Tags Solve Time Verified A Party 900 dfs-and-similar, graphs, trees 1m 51s ✓ B Lawnmower 1500 greedy, sortings 1m 30s ✓ C Plumber 2200 math 2m 56s ✗ D Unambiguous Arithmetic Expression 2600 dp, expression-parsing 2m 6s ✓ E Linear Kingdom Races 2400...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1806 - Minimum Number of Operations to Reinitialize a Permutation

LeetCode Problem 1806 Difficulty: 🟡 Medium Topics: Array, Math, Simulation Solution Problem Understanding The problem gives us an even integer n and defines an initial permutation: perm[i] = i This means the array initially looks like: [0, 1, 2, 3, ..., n - 1] We repeatedly apply a transformation rule to build a new array arr : If the index i is even: arr[i] = perm[i / 2] If the...

Practice › Codeforces Solutions › Codeforces Beta Round 58 ›

CF 62A - A Student's Dream

CF 62A - A Student's Dream Rating: 1300 Tags: greedy, math Solve time: 1m 13s Verified: yes Solution Problem Understanding We have four integers describing the number of fingers on two alien hands. The Venusian girl has al fingers on her left hand and ar on her right hand. The Marsian boy has bl and br fingers. They want to hold exactly one pair of hands. Since either person may...

Practice › Codeforces Solutions › Yandex.Algorithm 2011: Round 2 ›

CF 86D - Powerful array

CF 86D - Powerful array Rating: 2200 Tags: data structures, implementation, math, two pointers Solve time: 3m 46s Verified: yes Solution Problem Understanding We are given an array of positive integers and many interval queries. For each query [l, r] , we look only at the subarray between those indices and compute a value called its power. If a number x appears k times inside the subarray, then x contributes...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1728 - Cat and Mouse II

LeetCode Problem 1728 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory Solution Problem Understanding This problem describes a two-player perfect-information game played on a small grid. One player controls the mouse and the other controls the cat. Both players move optimally and alternate turns, with the mouse always moving first. The grid contains several kinds of cells: 'M' represents the mouse's starting...

Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44D - Hyperdrive

CF 44D - Hyperdrive Rating: 1800 Tags: math Solve time: 1m 5s Verified: yes Solution Problem Understanding We are asked to model the spread of hyperdrive news across a galaxy of planets, where ships move along straight lines at uniform speed. The input consists of n planets, each with three-dimensional coordinates, and the goal is to determine the earliest moment two ships would collide if every ship, upon reaching a...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 477 - Total Hamming Distance

LeetCode Problem 477 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation Solution Problem Understanding The problem asks us to compute the total Hamming distance between every possible pair of integers in the array. The Hamming distance between two integers is defined as the number of bit positions where the two numbers differ. For example: 4 = 0100 14 = 1110 Comparing the bits position by position: Bit Position 4 14...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1237 - Find Positive Integer Solution for a Given Equation

LeetCode Problem 1237 Difficulty: 🟡 Medium Topics: Math, Two Pointers, Binary Search, Interactive Solution Problem Understanding This problem gives us access to a hidden function f(x, y) through an interface. We are not allowed to know or implement the formula directly. Instead, we can only call the function with positive integers x and y and observe the result. The important property is that the function is strictly increasing in both...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 812 - Largest Triangle Area

LeetCode Problem 812 Difficulty: 🟢 Easy Topics: Array, Math, Geometry Solution LeetCode 812, Largest Triangle Area Problem Understanding The problem gives us a list of unique points on a 2D X-Y plane. Each point is represented as a pair of integers [x, y] . Our task is to choose any three distinct points and compute the area of the triangle formed by those points. Among all possible triangles, we must...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1628 - Design an Expression Tree With Evaluate Function

LeetCode Problem 1628 Difficulty: 🟡 Medium Topics: Array, Math, Stack, Tree, Design, Binary Tree Solution Problem Understanding The problem requires constructing a binary expression tree from a postfix arithmetic expression and implementing a method to evaluate the tree. The input is an array of strings postfix representing numbers and operators ( + , - , * , / ) in postfix notation , meaning operands appear before their operators. The...

Practice › Codeforces Solutions › Codeforces Beta Round 50 ›

CF 54C - First Digit Law

CF 54C - First Digit Law Rating: 2000 Tags: dp, math, probabilities Solve time: 1m 10s Verified: yes Solution Problem Understanding We are given a set of N random integers, where each integer i can take any value in a given inclusive range [L_i, R_i] , all values equally likely. The task is to compute the probability that at least K% of these N integers start with the digit 1...

Practice › Codeforces Solutions › Codeforces Beta Round 46 (Div. 2) ›

CF 49C - Disposition

CF 49C - Disposition Rating: 1700 Tags: constructive algorithms, math Solve time: 1m 48s Verified: yes Solution Problem Understanding We need to build a permutation of numbers from 1 to n . Position j contains volume p(j) . A positive integer i is called a divisor of the disposition if there exists some position j such that both j and p(j) are divisible by i . The task is to...

Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73E - Morrowindows

CF 73E - Morrowindows Rating: 2400 Tags: math, number theory Solve time: 1m 51s Verified: yes Solution Problem Understanding Each viewing mode groups the inventory into pages of size a_i . If the inventory contains k items, then the game shows $b_i = \left\lceil \frac{k}{a_i} \right\rceil$ pages in that mode. Vasya does not know the actual value of k , only that 2 ≤ k ≤ x . Before looking...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 593 - Valid Square

LeetCode Problem 593 Difficulty: 🟡 Medium Topics: Math, Geometry Solution Problem Understanding The problem gives four points in a 2D coordinate system and asks whether those four points form a valid square. The points are not provided in any guaranteed order, which means we cannot assume adjacent points or diagonally opposite points are already grouped correctly. A square must satisfy two geometric properties simultaneously. First, all four sides must have...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 770 - Basic Calculator IV

LeetCode Problem 770 Difficulty: 🔴 Hard Topics: Hash Table, Math, String, Stack, Recursion Solution Problem Understanding The problem requires parsing and evaluating a mathematical expression that includes integers, variables, addition, subtraction, multiplication, and parentheses, while also applying a substitution map for certain variables. Essentially, we are building a symbolic algebra engine that simplifies expressions according to standard arithmetic rules. The input consists of a string expression that may contain integers,...

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40D - Interesting Sequence

CF 40D - Interesting Sequence Rating: 2600 Tags: math Solve time: 1m 55s Verified: yes Solution Problem Understanding The sequence starts with two fixed values: $$d_1 = 2,\quad d_2 = 13$$ For every later year, the population satisfies one of two recurrence rules: $$d_i = 12d_{i-2}$$ or $$d_i = 13d_{i-1} - 12d_{i-2}$$ We are given a huge integer $A$, up to 300 decimal digits, and must determine whether some valid...

Practice › Codeforces Solutions › School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) ›

CF 38B - Chess

CF 38B - Chess Rating: 1200 Tags: brute force, implementation, math Solve time: 2m Verified: no Solution Problem Understanding We are given the positions of two chess pieces on a standard 8 × 8 board, one rook and one knight. Their starting positions are guaranteed to be safe, meaning the rook does not attack the knight and the knight does not attack the rook. We must place one more knight...

Practice › Codeforces Solutions › Codeforces Beta Round 37 ›

CF 37D - Lesson Timetable

CF 37D - Lesson Timetable Rating: 2300 Tags: combinatorics, dp, math Solve time: 2m 23s Verified: no Solution Problem Understanding Each student group attends exactly two lessons. For a group, the classroom used in the first lesson must not exceed the classroom used in the second lesson. We know exactly how many groups start in each classroom. If Xi = 3 , then exactly three groups have their first lesson...

Practice › Codeforces Solutions ›

Codeforces Beta Round 32 (Div. 2, Codeforces format)

Codeforces Beta Round 32 (Div. 2, Codeforces format) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2400 | Time: 6m 58s Problem Name Rating Tags Solve Time Verified A Reconnaissance 800 brute-force 1m 5s ✓ B Borze 800 expression-parsing, implementation 1m 17s ✓ C Flea 1700 math 1m 12s ✓ D Constellation 1600 implementation 59s ✓ E Hide-and-Seek 2400 geometry, implementation 2m 25s ✓

Practice › LeetCode › LeetCode 09xx ›

LeetCode 906 - Super Palindromes

LeetCode Problem 906 Difficulty: 🔴 Hard Topics: Math, String, Enumeration Solution LeetCode 906 - Super Palindromes Problem Understanding This problem asks us to count how many numbers within a given inclusive range are "super-palindromes". A number is considered a super-palindrome if both of the following conditions are true: The number itself is a palindrome. The number is the square of another palindrome. For example: 121 is a palindrome. 121 =...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 891 - Sum of Subsequence Widths

LeetCode Problem 891 Difficulty: 🔴 Hard Topics: Array, Math, Sorting Solution Problem Understanding The problem asks us to calculate the sum of widths for all non-empty subsequences of a given integer array nums . A subsequence is any sequence derived by removing zero or more elements from the original array while maintaining the order. The width of a sequence is defined as the difference between its maximum and minimum elements....

Practice › LeetCode › LeetCode 00xx ›

LeetCode 66 - Plus One

LeetCode Problem 66 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem gives us a non-empty array of digits that together represent a large integer. Each element in the array is a single decimal digit, and the digits are stored in left-to-right order from the most significant digit to the least significant digit. For example: [1,2,3] represents the number 123 [4,3,2,1] represents the number 4321 [9] represents the...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 60 - Permutation Sequence

LeetCode Problem 60 Difficulty: 🔴 Hard Topics: Math, Recursion Solution LeetCode 60, Permutation Sequence Problem Understanding The problem gives us the numbers from 1 to n , and asks us to find the kth permutation when all possible permutations are ordered lexicographically. For example, when n = 3 , the numbers are: [1, 2, 3] All permutations in sorted order are: 123 132 213 231 312 321 If k =...

Practice › Codeforces Solutions › Codeforces Beta Round 53 ›

CF 57C - Array

CF 57C - Array Rating: 1900 Tags: combinatorics, math Solve time: 1m 21s Verified: yes Solution Problem Understanding We are asked to count the number of arrays of length n containing integers from 1 to n such that the array is either entirely non-decreasing or entirely non-increasing. In other words, every consecutive element must either be no smaller than the previous one, or no larger than the previous one. The...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1276 - Number of Burgers with No Waste of Ingredients

LeetCode Problem 1276 Difficulty: 🟡 Medium Topics: Math Solution Here is a complete, detailed technical solution guide for LeetCode 1276 - Number of Burgers with No Waste of Ingredients , following your requested format. Problem Understanding The problem asks us to determine how many Jumbo and Small burgers we can make using exactly a given number of tomato slices and cheese slices without leaving any leftover ingredients. Each Jumbo Burger...

Practice › Codeforces Solutions › Codeforces Beta Round 71 ›

CF 79E - Security System

CF 79E - Security System Rating: 2900 Tags: math Solve time: 1m 28s Verified: yes Solution Problem Understanding We are asked to help Ciel move from the bottom-left corner of a castle grid, coordinate (1,1), to the top-right corner (n,n), while avoiding being caught by a system of sensors. The castle grid allows only two types of moves: right (R) or upward (U). The sensors occupy a square of size...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1622 - Fancy Sequence

LeetCode Problem 1622 Difficulty: 🔴 Hard Topics: Math, Design, Segment Tree, Number Theory Solution Problem Understanding The problem asks us to design a mutable sequence data structure that supports four operations efficiently: Append a value to the sequence. Add a constant value to every element currently in the sequence. Multiply every element currently in the sequence by a constant. Retrieve the value at a specific index. All returned values must...

Practice › Codeforces Solutions ›

Codeforces Beta Round 97 (Div. 2)

Codeforces Beta Round 97 (Div. 2) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1100 | Time: 2m 54s Problem Name Rating Tags Solve Time Verified A Presents 800 implementation 1m 13s ✓ B Ternary Logic 1100 implementation, math 1m 41s ✓

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1140 - Stone Game II

LeetCode Problem 1140 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Prefix Sum, Game Theory Solution Problem Understanding The problem is a two-player turn-based game played on a row of stone piles. Each pile has a positive number of stones, and players take turns taking stones from the start of the remaining piles. On each turn, a player can take up to 2 * M piles, where M starts at...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 650 - 2 Keys Keyboard

LeetCode Problem 650 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution Problem Understanding The problem is asking for the minimum number of operations required to generate exactly n characters 'A' on a notepad starting with a single 'A' . We are allowed only two operations: "Copy All," which copies all characters currently on the screen, and "Paste," which pastes the previously copied characters. Each operation counts as one step. The...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 447 - Number of Boomerangs

LeetCode Problem 447 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math Solution Problem Understanding The problem asks us to count the number of valid boomerangs among a set of distinct 2D points. A boomerang is defined as a tuple (i, j, k) where the distance between point i and point j is equal to the distance between point i and point k . The important detail is that the order...

Practice › Codeforces Solutions ›

Codeforces Beta Round 51

Codeforces Beta Round 51 Type: Beta | Problems: 5 | Verified: 3/5 | Rating range: 1200-2500 | Time: 10m 12s Problem Name Rating Tags Solve Time Verified A Flea travel 1200 implementation, math 1m 24s ✓ B Smallest number 1600 brute-force 1m 47s ✓ C Pie or die 1900 games 1m 43s ✓ D Beautiful numbers 2500 dp, number-theory 3m 29s ✗ E Very simple problem 2500 geometry, two-pointers 1m...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1360 - Number of Days Between Two Dates

LeetCode Problem 1360 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem gives two dates in the format YYYY-MM-DD and asks us to compute the absolute number of days between them. Each input string represents a valid calendar date. The year, month, and day are separated by hyphens. For example: "2019-06-29" means June 29, 2019 "2020-01-15" means January 15, 2020 The expected output is a single integer representing...

Practice › Codeforces Solutions › Codeforces Beta Round 4 (Div. 2 Only) ›

CF 4A - Watermelon

CF 4A - Watermelon Rating: 800 Tags: brute force, math Solve time: 46s Verified: yes Solution Problem Understanding The problem gives a single integer w , the weight of a watermelon. We need to decide whether it can be split into two positive parts such that both parts are even numbers. The word "positive" matters here. Splitting 2 into 0 + 2 is not allowed because one part would have...

Practice › Codeforces Solutions ›

Codeforces Alpha Round 20 (Codeforces format)

Codeforces Alpha Round 20 (Codeforces format) Type: Special | Problems: 3 | Verified: 3/3 | Rating range: 1700-2000 | Time: 4m 1s Problem Name Rating Tags Solve Time Verified A BerOS file system 1700 implementation 1m 20s ✓ B Equation 2000 math 1m 5s ✓ C Dijkstra? 1900 graphs, shortest-paths 1m 36s ✓

Practice › Codeforces Solutions ›

School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules)

School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) Type: Beta | Problems: 8 | Verified: 5/8 | Rating range: 800-2400 | Time: 13m 48s Problem Name Rating Tags Solve Time Verified A Army 800 implementation 1m 18s ✓ B Chess 1200 brute-force, implementation, math 2m ✗ C Blinds 1400 brute-force 1m 7s ✓ D Vasya the Architect 1900 implementation 1m 38s ✓ E...

Practice › Codeforces Solutions › Codeforces Beta Round 51 ›

CF 55A - Flea travel

CF 55A - Flea travel Rating: 1200 Tags: implementation, math Solve time: 1m 24s Verified: yes Solution Problem Understanding We have n positions arranged in a circle. The flea starts on one position. After the first minute it moves forward by 1 step, after the second minute by 2 steps, after the third minute by 3 steps, and so on. The question is whether this movement pattern eventually visits every...

Practice › Codeforces Solutions › Codeforces Beta Round 73 (Div. 1 Only) ›

CF 87C - Interesting Game

CF 87C - Interesting Game Rating: 2000 Tags: dp, games, math Solve time: 1m 9s Verified: yes Solution Problem Understanding We are asked to analyze a two-player game with a single pile of n stones. The players alternate turns, starting with Serozha. On each turn, a player selects one existing pile and splits it into at least two piles that form a strictly decreasing sequence with consecutive differences equal to...

Practice › Codeforces Solutions › Unknown Language Round 3 ›

CF 100J - Interval Coloring

CF 100J - Interval Coloring Rating: 2400 Tags: *special, greedy, math Solve time: 1m 52s Verified: yes Solution Problem Understanding We are asked to color a collection of intervals on the number line such that no three intervals with the same color form a "triple overlap pattern." More concretely, a coloring is invalid if there exist three intervals of the same color where each pair overlaps at some point in...

Practice › Codeforces Solutions › School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) ›

CF 48C - The Race

CF 48C - The Race Rating: 1800 Tags: math Solve time: 1m 54s Verified: yes Solution Problem Understanding We are asked to predict the next petrol station where Vanya will stop, given the stations he has already visited. Vanya drives a car that consumes exactly 10 liters per 100 kilometers, starts with a tank filled with some unknown α liters (α ≥ 10), and stops only when the remaining petrol...

Practice › Codeforces Solutions › Codeforces Beta Round 9 (Div. 2 Only) ›

CF 9C - Hexadecimal's Numbers

CF 9C - Hexadecimal's Numbers Rating: 1200 Tags: brute force, implementation, math Solve time: 1m 10s Verified: yes Solution Problem Understanding We are asked to count how many numbers from 1 to n consist only of the digits 0 and 1 in their decimal representation. In other words, Hexadecimal's memory only stores numbers that, when written in base 10, contain no digits other than 0 or 1. For example, 1,...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1467 - Probability of a Two Boxes Having The Same Number of Distinct Balls

LeetCode Problem 1467 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Backtracking, Combinatorics, Probability and Statistics Solution Problem Understanding The problem gives us several colors of balls, where balls[i] represents how many balls exist for color i . The total number of balls is always even, say 2n . We randomly shuffle all balls and place the first n balls into box 1 and the remaining n balls into box...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 479 - Largest Palindrome Product

LeetCode Problem 479 Difficulty: 🔴 Hard Topics: Math, Enumeration Solution Largest Palindrome Product Problem Understanding The problem asks us to find the largest palindrome number that can be written as the product of two n -digit integers. A palindrome is a number that reads the same forward and backward. For example, 9009 is a palindrome because reversing its digits still gives 9009 . The input is a single integer n...

Practice › Codeforces Solutions ›

Yandex.Algorithm 2011: Qualification 2

Yandex.Algorithm 2011: Qualification 2 Type: Special | Problems: 5 | Verified: 4/5 | Rating range: 1100-2600 | Time: 11m 32s Problem Name Rating Tags Solve Time Verified A Double Cola 1100 implementation, math 1m 30s ✓ B Sets 1700 constructive-algorithms, hashing, implementation 2m 17s ✗ C General Mobilization 2000 data-structures, dfs-and-similar, sortings 2m 42s ✓ D Two out of Three 2000 dp 2m 57s ✓ E Corridor 2600 geometry 2m...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1399 - Count Largest Group

LeetCode Problem 1399 Difficulty: 🟢 Easy Topics: Hash Table, Math, Counting Solution Problem Understanding The problem asks us to group all integers from 1 to n based on the sum of their digits. Every number belongs to exactly one group, determined by adding together all of its decimal digits. For example: 14 has digit sum 1 + 4 = 5 5 also has digit sum 5 So both numbers belong...

Practice › Codeforces Solutions › Codeforces Beta Round 79 (Div. 1 Only) ›

CF 101C - Vectors

CF 101C - Vectors Rating: 2000 Tags: implementation, math Solve time: 2m 22s Verified: yes Solution Problem Understanding We start with a vector A = (x1, y1) and want to transform it into another vector B = (x2, y2) . Two operations are allowed. We may rotate the current vector by 90 degrees clockwise, and we may add vector C = (x3, y3) any number of times. The operations may...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 445 - Add Two Numbers II

LeetCode Problem 445 Difficulty: 🟡 Medium Topics: Linked List, Math, Stack Solution Problem Understanding The problem gives us two non-empty singly linked lists where each node stores a single digit of a non-negative integer. Unlike the classic "Add Two Numbers" problem, the digits are stored in forward order, meaning the most significant digit appears first. For example, the linked list: 7 -> 2 -> 4 -> 3 represents the integer...

Practice › Codeforces Solutions › Codeforces Beta Round 44 (Div. 2) ›

CF 47A - Triangular numbers

CF 47A - Triangular numbers Rating: 800 Tags: brute force, math Solve time: 1m 10s Verified: yes Solution Problem Understanding We are asked to determine if a given positive integer can be represented as a triangular number. Triangular numbers are formed by arranging dots into an equilateral triangle, so the n -th triangular number is the sum of the first n positive integers. For example, the first few triangular numbers...

Practice › Codeforces Solutions › Codeforces Beta Round 32 (Div. 2, Codeforces format) ›

CF 32C - Flea

CF 32C - Flea Rating: 1700 Tags: math Solve time: 1m 12s Verified: yes Solution Problem Understanding We have a grid of size $n \times m$ where each cell is 1 centimeter square. A flea starts at some cell and can jump exactly $s$ centimeters either vertically or horizontally, staying inside the board. The task is to determine the number of starting cells that allow the flea to reach the...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 497 - Random Point in Non-overlapping Rectangles

LeetCode Problem 497 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized Solution Problem Understanding The problem asks us to randomly pick an integer point from a set of non-overlapping rectangles in 2D space. Each rectangle is defined by its bottom-left (ai, bi) and top-right (xi, yi) corners. The goal is to ensure that every integer point inside the union of all rectangles has...

Practice › Codeforces Solutions › Yandex.Algorithm 2011: Round 2 ›

CF 86E - Long sequence

CF 86E - Long sequence Rating: 2700 Tags: brute force, math, matrices Solve time: 1m 38s Verified: yes Solution Problem Understanding We are asked to construct a special kind of binary sequence, called a recurrent binary sequence. Each term in this sequence is either 0 or 1, and for a given integer k , there exist coefficients c₁, c₂, …, cₖ , also 0 or 1, such that every term...

Practice › Codeforces Solutions › Codeforces Beta Round 76 (Div. 2 Only) ›

CF 94B - Friends

CF 94B - Friends Rating: 1300 Tags: graphs, implementation, math Solve time: 1m 37s Verified: yes Solution Problem Understanding We have exactly five people. Some pairs of people know each other, and the input lists all such acquaintance relations. The task is to determine whether there exists either: Three people where every pair knows each other. Three people where no pair knows each other. This is naturally a graph problem....

Practice › Codeforces Solutions › Codeforces Beta Round 86 (Div. 1 Only) ›

CF 113D - Museum

CF 113D - Museum Rating: 2700 Tags: math, matrices, probabilities Solve time: 1m 55s Verified: yes Solution Problem Understanding We are asked to model the random movements of two friends inside a museum represented as an undirected connected graph with n rooms and m corridors. Each room has a probability of staying in place for a minute, and otherwise the person moves uniformly to a neighboring room. The task is...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1766 - Tree of Coprimes

LeetCode Problem 1766 Difficulty: 🔴 Hard Topics: Array, Math, Tree, Depth-First Search, Number Theory Solution Problem Understanding This problem gives us a tree with n nodes numbered from 0 to n-1 , rooted at node 0 . Each node has an associated value from the array nums , and the tree structure is given as a list of edges. For each node i , we are asked to find the...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1819 - Number of Different Subsequences GCDs

LeetCode Problem 1819 Difficulty: 🔴 Hard Topics: Array, Math, Counting, Number Theory Solution Problem Understanding The problem asks us to compute how many distinct values can appear as the GCD of some non-empty subsequence of the given array. A subsequence is formed by deleting zero or more elements while preserving order. Since the order does not matter for the GCD operation, the real challenge is determining which integers can be...

Practice › Codeforces Solutions ›

Codeforces Beta Round 80 (Div. 1 Only)

Codeforces Beta Round 80 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1100-2900 | Time: 10m 20s Problem Name Rating Tags Solve Time Verified A Testing Pants for Sadness 1100 greedy, implementation, math 1m 39s ✓ B Cthulhu 1500 dfs-and-similar, dsu, graphs 1m 43s ✓ C Russian Roulette 1900 constructive-algorithms, greedy 2m ✓ D Time to Raid Cowavans 2100 brute-force, data-structures, sortings 1m...

Practice › Codeforces Solutions › Codeforces Beta Round 73 (Div. 1 Only) ›

CF 87A - Trains

CF 87A - Trains Rating: 1500 Tags: implementation, math Solve time: 1m 15s Verified: yes Solution Problem Understanding Vasya is at the central station of a subway branch with two endpoints. Each endpoint corresponds to one of his girlfriends: Dasha or Masha. Trains to Dasha’s station arrive every a minutes and trains to Masha’s station arrive every b minutes. Vasya arrives at the station at a random moment and always...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1134 - Armstrong Number

LeetCode Problem 1134 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding In this problem, we are given an integer n , and we must determine whether it is an Armstrong number. An Armstrong number is defined as follows: Let k be the number of digits in n . Take every digit in the number. Raise each digit to the power k . Sum all those powered values. If the final...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1478 - Allocate Mailboxes

LeetCode Problem 1478 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Sorting Solution Here’s a complete, detailed technical solution guide for LeetCode 1478 following your requested format and requirements. Problem Understanding The problem provides a list houses , where each element represents the position of a house along a street. You are asked to allocate exactly k mailboxes to minimize the total distance from each house to its nearest mailbox....

Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71B - Progress Bar

CF 71B - Progress Bar Rating: 1300 Tags: implementation, math Solve time: 1m 7s Verified: yes Solution Problem Understanding We are asked to construct a graphical progress bar as an array of squares, where each square has a saturation value. The bar has a total of n squares, and the maximum saturation is k . The completion of the process is measured as t percent, and we need to reflect...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1563 - Stone Game V

LeetCode Problem 1563 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Game Theory Solution Problem Understanding In this game, we are given an array stoneValue where each element represents the value of a stone. The stones are arranged in a row, and Alice repeatedly splits the current row into two non-empty contiguous parts. After Alice chooses a split point, Bob compares the sums of the left and right parts: If...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1180 - Count Substrings with Only One Distinct Letter

LeetCode Problem 1180 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to count how many substrings of a given string contain only one distinct character. A substring is a contiguous section of the string. For example, in the string "aaaba" , the substring "aaa" is valid because every character is 'a' . The substring "aab" is not valid because it contains both 'a' and 'b'...

Practice › Codeforces Solutions ›

Codeforces Beta Round 83 (Div. 2 Only)

Codeforces Beta Round 83 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1400 | Time: 9m 3s Problem Name Rating Tags Solve Time Verified A Palindromic Times 1000 implementation, strings 4m 56s ✓ B Datatypes 1400 math, sortings 4m 7s ✓

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1611 - Minimum One Bit Operations to Make Integers Zero

LeetCode Problem 1611 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Bit Manipulation, Recursion, Memoization Solution Problem Understanding This problem asks us to transform a given integer n into 0 using a specialized set of bit-flipping operations. Each operation allows you to flip either the rightmost bit of the binary representation of n , or the i-th bit if the (i-1)-th bit is set to 1 and all lower bits (i-2...

Practice › Codeforces Solutions › Unknown Language Round 2 ›

CF 72C - Extraordinarily Nice Numbers

CF 72C - Extraordinarily Nice Numbers Rating: 1200 Tags: *special, math Solve time: 1m 26s Verified: yes Solution Problem Understanding We are asked to determine whether a positive integer $x$ is extraordinarily nice. By the problem's definition, a number is extraordinarily nice if it has exactly the same number of even divisors as odd divisors. The input is a single integer $x$ between 1 and 1000. The output is simply...

Practice › Codeforces Solutions › Codeforces Beta Round 13 ›

CF 13A - Numbers

CF 13A - Numbers Rating: 1000 Tags: implementation, math Solve time: 1m 3s Verified: yes Solution Problem Understanding We are asked to compute the average sum of digits of a number A when it is expressed in all bases from 2 up to A - 1. The input is a single integer A between 3 and 1000. The output should be an irreducible fraction representing the sum of all digit...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 29 - Divide Two Integers

LeetCode Problem 29 Difficulty: 🟡 Medium Topics: Math, Bit Manipulation Solution Problem Understanding The problem asks us to implement integer division without using the standard arithmetic operators for multiplication, division, or modulo. We are given two integers, dividend and divisor , and we must compute the quotient obtained by dividing the dividend by the divisor. The result must follow truncation toward zero. This means that any fractional portion is discarded...

Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71C - Round Table Knights

CF 71C - Round Table Knights Rating: 1600 Tags: dp, math, number theory Solve time: 1m 40s Verified: yes Solution Problem Understanding The knights sit on a circle, equally spaced. Each position is marked either 1 for a knight in a good mood or 0 for a knight in a bad mood. We need to determine whether it is possible to choose some of the good-mood knights so that they...

Practice › Codeforces Solutions › Codeforces Beta Round 74 (Div. 2 Only) ›

CF 90A - Cableway

CF 90A - Cableway Rating: 1000 Tags: greedy, math Solve time: 1m 33s Verified: yes Solution Problem Understanding The cableway sends one cablecar every minute, and the colors repeat in a fixed cycle: red -> green -> blue -> red -> ... Each cablecar can carry at most two students, and every ride takes exactly 30 minutes to reach the top. We are given three groups of students. One group...

Practice › Codeforces Solutions › Codeforces Beta Round 2 ›

CF 2B - The least round way

Problem Understanding We have an n × n grid of non-negative integers. Starting from the top-left corner, we may move only right or down until we reach the bottom-right corner. Along a chosen path, we multiply every visited value together. The goal is to make the resulting product end with as few trailing zeros as possible. A trailing zero appears whenever the product contains a factor 10 , and every...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1627 - Graph Connectivity With Threshold

LeetCode Problem 1627 Difficulty: 🔴 Hard Topics: Array, Math, Union-Find, Number Theory Solution Problem Understanding The problem gives us n cities labeled from 1 to n . Two cities are directly connected if they share a common divisor that is strictly greater than a given threshold . For example, if threshold = 2 , then cities 6 and 9 are directly connected because they share divisor 3 , and 3...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 172 - Factorial Trailing Zeroes

LeetCode Problem 172 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem asks us to determine how many trailing zeroes appear at the end of n! , where n! represents the factorial of n . A factorial is defined as: $$n! = n \times (n - 1) \times (n - 2) \times \dots \times 2 \times 1$$ For example: 5! = 5 × 4 × 3 × 2 ×...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1588 - Sum of All Odd Length Subarrays

LeetCode Problem 1588 Difficulty: 🟢 Easy Topics: Array, Math, Prefix Sum Solution Problem Understanding The problem asks us to calculate the sum of all odd-length subarrays of a given array of positive integers. A subarray is any contiguous sequence of elements from the original array. For example, in an array [1, 2, 3] , the subarrays of length 1 are [1] , [2] , [3] , and the subarray of...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 486 - Predict the Winner

LeetCode Problem 486 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Recursion, Game Theory Solution Problem Understanding The problem describes a two-player game played on an integer array. Players alternate turns, and during each turn a player may only take a number from one of the two ends of the array. The chosen value is added to that player's score, and the element is removed from the array. The game...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1250 - Check If It Is a Good Array

LeetCode Problem 1250 Difficulty: 🔴 Hard Topics: Array, Math, Number Theory Solution Problem Understanding This problem asks whether it is possible to create the number 1 using the integers in the array, where each chosen number can be multiplied by any integer, including negative integers, before all results are summed together. More formally, given an array nums , we want to know whether there exist integers: $$x_1, x_2, x_3, \dots,...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 633 - Sum of Square Numbers

LeetCode Problem 633 Difficulty: 🟡 Medium Topics: Math, Two Pointers, Binary Search Solution Problem Understanding The problem gives a non-negative integer c and asks whether it can be represented as the sum of the squares of two integers. In mathematical terms, we need to determine whether there exist integers a and b such that: $a^2 + b^2 = c$ The integers a and b can be zero, and they do...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1137 - N-th Tribonacci Number

LeetCode Problem 1137 Difficulty: 🟢 Easy Topics: Math, Dynamic Programming, Memoization Solution LeetCode 1137, N-th Tribonacci Number Problem Understanding The problem asks us to compute the n -th number in the Tribonacci sequence. The Tribonacci sequence is very similar to the Fibonacci sequence, except that instead of summing the previous two numbers, each value is formed by summing the previous three numbers. The sequence is defined as: T0 = 0...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1118 - Number of Days in a Month

LeetCode Problem 1118 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine the number of days in a specific month of a given year. The inputs are two integers: year , which ranges from 1583 to 2100, and month , which ranges from 1 (January) to 12 (December). The output is a single integer representing the total number of days in that month for that...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 12 - Integer to Roman

LeetCode Problem 12 Difficulty: 🟡 Medium Topics: Hash Table, Math, String Solution Problem Understanding The problem asks us to convert a positive integer into its Roman numeral representation. Roman numerals use combinations of specific symbols to represent values, and the rules for combining those symbols are strict. Unlike a positional number system such as decimal, Roman numerals are constructed greedily from the largest possible symbol values down to the smallest....

Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34E - Collisions

CF 34E - Collisions Rating: 2000 Tags: brute force, implementation, math Solve time: 2m 6s Verified: yes Solution Problem Understanding We have several point-like balls moving on a one-dimensional line. Every ball starts at some coordinate with its own velocity and mass. Whenever two balls occupy the same position at the same time, they collide elastically, and their velocities change according to the standard physics formulas for one-dimensional elastic collisions....

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1685 - Sum of Absolute Differences in a Sorted Array

LeetCode Problem 1685 Difficulty: 🟡 Medium Topics: Array, Math, Prefix Sum Solution Problem Understanding The problem gives us a sorted integer array nums , arranged in non-decreasing order. For every index i , we must compute the total sum of absolute differences between nums[i] and every other element in the array. Formally, for each position i : $$result[i] = \sum_{j=0}^{n-1} |nums[i] - nums[j]|$$ The output must be an array of...

Practice › Codeforces Solutions › School Regional Team Contest, Saratov, 2011 ›

CF 120E - Put Knight!

CF 120E - Put Knight! Rating: 1400 Tags: games, math Solve time: 1m 56s Verified: yes Solution Problem Understanding We are asked to analyze a two-player game on an n × n chessboard. Petya and Gena take turns placing knights such that no knight can threaten another. A knight threatens positions in its standard L-shaped moves. The first player unable to place a knight loses, and Petya always starts. The...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 976 - Largest Perimeter Triangle

LeetCode Problem 976 Difficulty: 🟢 Easy Topics: Array, Math, Greedy, Sorting Solution Problem Understanding The problem gives us an array of integers called nums , where each integer represents a possible side length. Our goal is to select exactly three lengths that can form a valid triangle with a non-zero area, and among all valid triangles, return the maximum possible perimeter. A triangle is only valid if the sum of...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1030 - Matrix Cells in Distance Order

LeetCode Problem 1030 Difficulty: 🟢 Easy Topics: Array, Math, Geometry, Sorting, Matrix Solution Problem Understanding This problem asks us to return every cell in a matrix, ordered by its Manhattan distance from a given center cell. We are given four integers: rows , the number of rows in the matrix cols , the number of columns in the matrix rCenter , the row index of the reference cell cCenter ,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 85 (Div. 2 Only)

Codeforces Beta Round 85 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1200 | Time: 3m 19s Problem Name Rating Tags Solve Time Verified A Petya and Strings 800 implementation, strings 1m 37s ✓ B Petya and Square 1200 implementation, math 1m 42s ✓

Practice › LeetCode › LeetCode 06xx ›

LeetCode 670 - Maximum Swap

LeetCode Problem 670 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to take an integer num and find the maximum number we can create by swapping at most two digits . In other words, we can pick two positions in the number, swap their digits, and we want the resulting number to be as large as possible. If no swap would increase the number, we...

Practice › Codeforces Solutions ›

Unknown Language Round 1

Unknown Language Round 1 Type: Special | Problems: 9 | Verified: 9/9 | Rating range: 1300-2400 | Time: 14m 26s Problem Name Rating Tags Solve Time Verified A Factorial 1300 *special, implementation 1m 13s ✓ B Expression 1500 *special, expression-parsing 1m 39s ✓ C Table 1600 *special, greedy, implementation 1m 25s ✓ D Presents 1800 *special, greedy 1m 40s ✓ E Prime Segment 1800 *special, brute-force, math 1m 28s ✓...

Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117D - Not Quick Transformation

CF 117D - Not Quick Transformation Rating: 2500 Tags: divide and conquer, math Solve time: 2m 20s Verified: yes Solution Problem Understanding We start with the array [1, 2, 3, ..., n] . A recursive transformation rearranges it by repeatedly taking all elements at odd positions, transforming that subarray, then taking all elements at even positions and transforming that subarray. For example: F([1,2,3,4,5,6,7,8]) becomes F([1,3,5,7]) + F([2,4,6,8]) and each half...

Practice › Codeforces Solutions ›

Codeforces Beta Round 63 (Div. 2)

Codeforces Beta Round 63 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1000-2000 | Time: 9m 17s Problem Name Rating Tags Solve Time Verified A Young Physicist 1000 implementation, math 1m 43s ✓ B Bets 1200 greedy, implementation 2m 1s ✓ C Game 2000 implementation 2m 15s ✓ D Dot 1900 dp, games 1m 56s ✓ E Subsegments 1800 data-structures, implementation 1m 22s ✓

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1025 - Divisor Game

LeetCode Problem 1025 Difficulty: 🟢 Easy Topics: Math, Dynamic Programming, Brainteaser, Game Theory Solution Problem Understanding The problem describes a two-player turn-based game between Alice and Bob. The game starts with a single integer n written on a chalkboard. Alice always takes the first turn. On each turn, the current player must choose a positive integer x such that: 0 < x < n x divides n evenly, meaning n...

Practice › Codeforces Solutions ›

Codeforces Beta Round 92 (Div. 2 Only)

Codeforces Beta Round 92 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1400 | Time: 3m 1s Problem Name Rating Tags Solve Time Verified A The number of positions 1000 math 1m 27s ✓ B Permutations 1400 brute-force, combinatorics, implementation 1m 34s ✓

Practice › LeetCode › LeetCode 06xx ›

LeetCode 660 - Remove 9

LeetCode Problem 660 Difficulty: 🔴 Hard Topics: Math Solution Problem Understanding The problem defines a modified sequence of positive integers where every number containing the digit 9 is removed. Starting from the natural numbers: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... we remove all numbers that contain the digit 9 : 9, 19, 29, 39, 49, ... The resulting sequence becomes: 1, 2, 3, 4,...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 227 - Basic Calculator II

LeetCode Problem 227 Difficulty: 🟡 Medium Topics: Math, String, Stack Solution Problem Understanding The problem gives us a string representing a mathematical expression containing non-negative integers, spaces, and the four operators + , - , * , and / . Our task is to evaluate the expression and return the resulting integer value. The important detail is that multiplication and division must follow normal arithmetic precedence rules. This means *...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 453 - Minimum Moves to Equal Array Elements

LeetCode Problem 453 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem gives an integer array nums with n elements. In a single move, you are allowed to increment exactly n - 1 elements by 1 . Your goal is to determine the minimum number of such moves required to make every element in the array equal. At first glance, the operation feels unusual because instead of incrementing...

Practice › Codeforces Solutions ›

Unknown Language Round 3

Unknown Language Round 3 Type: Special | Problems: 10 | Verified: 10/10 | Rating range: 1100-2400 | Time: 23m 31s Problem Name Rating Tags Solve Time Verified A Carpeting the Room 1100 *special, implementation 2m 19s ✓ B Friendly Numbers 1500 *special, implementation 2m 19s ✓ C A+B 1400 *special, implementation 1m 27s ✓ D World of Mouth 1500 *special, strings 2m 18s ✓ E Lamps in a Line 1600...

Practice › Codeforces Solutions › Codeforces Beta Round 72 (Div. 1 Only) ›

CF 83D - Numbers

CF 83D - Numbers Rating: 2400 Tags: dp, math, number theory Solve time: 2m 7s Verified: yes Solution Problem Understanding We need to count integers inside the interval $[a,b]$ whose smallest divisor greater than $1$ is exactly $k$. For a number $x$, saying that its smallest divisor is $k$ means two things happen simultaneously: $x$ is divisible by $k$. $x$ is not divisible by any integer from $2$ to $k-1$....

Practice › LeetCode › LeetCode 02xx ›

LeetCode 279 - Perfect Squares

LeetCode Problem 279 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Breadth-First Search Solution Problem Understanding The problem asks for the minimum number of perfect square numbers whose sum equals a given integer n . A perfect square is a number that can be written as x * x for some integer x . Examples include 1 , 4 , 9 , 16 , and 25 . The task is not...

Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7C - Line

CF 7C - Line Rating: 1800 Tags: math, number theory Solve time: 52s Verified: yes Solution Problem Understanding We are asked to find an integer point on a straight line described by the equation Ax + By + C = 0 . The inputs are three integers, A , B , and C , which define the slope and position of the line. Our task is to output integers x...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 231 - Power of Two

LeetCode Problem 231 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation, Recursion Solution Problem Understanding The problem asks us to determine whether a given integer n is a power of two. A number is considered a power of two if it can be written in the form: $$n = 2^x$$ where x is a non-negative integer. Some examples of powers of two are: 1 = 2^0 2 = 2^1 4 =...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 991 - Broken Calculator

LeetCode Problem 991 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding This problem gives us a calculator that starts with an integer startValue and allows only two operations: Multiply the current number by 2 Subtract 1 Our goal is to transform startValue into target using the minimum number of operations. At first glance, this looks like a shortest path problem where we try different sequences of operations until we...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1259 - Handshakes That Don't Cross

LeetCode Problem 1259 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution Problem Understanding In this problem, we are given an even number of people standing around a circle. Every person must participate in exactly one handshake, meaning the people are partitioned into pairs. The challenge is to count how many different ways these pairings can be formed such that no two handshakes cross when drawn as straight lines inside the...

Practice › Codeforces Solutions › School Regional Team Contest, Saratov, 2011 ›

CF 120C - Winnie-the-Pooh and honey

CF 120C - Winnie-the-Pooh and honey Rating: 1100 Tags: implementation, math Solve time: 1m 39s Verified: yes Solution Problem Understanding We have several jars of honey, and each jar starts with some amount of honey. Winnie repeatedly chooses the jar that currently contains the most honey. When Winnie picks a jar, two things may happen. If the jar contains less than k kilos of honey, or if Winnie has already...

Practice › Codeforces Solutions › Codeforces Beta Round 26 (Codeforces format) ›

CF 26D - Tickets

CF 26D - Tickets Rating: 2400 Tags: combinatorics, math, probabilities Solve time: 1m 14s Verified: yes Solution Problem Understanding We have a ticket seller, Charlie, who sells race tickets costing 10 euros each. Customers arrive in some random order: some have only 10 euro banknotes, some have only 20 euro banknotes. Charlie initially has k 10 euro banknotes. Every customer with a 20 euro note requires Charlie to give one...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 858 - Mirror Reflection

LeetCode Problem 858 Difficulty: 🟡 Medium Topics: Math, Geometry, Number Theory Solution LeetCode 858 - Mirror Reflection Problem Understanding This problem describes a square room with perfectly reflective walls. The room has side length p , and there are three receptors placed at three corners of the square: Receptor 0 is at the southeast corner Receptor 1 is at the northeast corner Receptor 2 is at the northwest corner The...

Practice › Codeforces Solutions › Codeforces Beta Round 9 (Div. 2 Only) ›

CF 9A - Die Roll

CF 9A - Die Roll Rating: 800 Tags: math, probabilities Solve time: 2m 43s Verified: yes Solution Problem Understanding We are asked to calculate the probability that Dot wins a simple dice game against Yakko and Wakko. Each character rolls a standard six-sided die. Dot wins if her roll is at least as large as the maximum of Yakko’s and Wakko’s rolls. Yakko and Wakko’s rolls are given as input,...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1323 - Maximum 69 Number

LeetCode Problem 1323 Difficulty: 🟢 Easy Topics: Math, Greedy Solution Problem Understanding The problem gives us a positive integer num that contains only the digits 6 and 9 . We are allowed to change at most one digit , where a 6 can become a 9 , or a 9 can become a 6 . Our goal is to return the largest possible number after making zero or one modification....

Practice › LeetCode › LeetCode 02xx ›

LeetCode 223 - Rectangle Area

LeetCode Problem 223 Difficulty: 🟡 Medium Topics: Math, Geometry Solution Problem Understanding The problem gives the coordinates of two axis-aligned rectangles on a 2D plane. Each rectangle is represented using two corner points: Bottom-left corner (x1, y1) Top-right corner (x2, y2) For the first rectangle, the coordinates are: (ax1, ay1) for the bottom-left (ax2, ay2) for the top-right For the second rectangle, the coordinates are: (bx1, by1) for the bottom-left...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 398 - Random Pick Index

LeetCode Problem 398 Difficulty: 🟡 Medium Topics: Hash Table, Math, Reservoir Sampling, Randomized Solution Problem Understanding The problem gives us an integer array nums that may contain duplicate values. We must design a class that supports repeatedly selecting a random index for a given target value. The important requirement is that if the target appears multiple times, every valid index must have the same probability of being returned. For example,...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1716 - Calculate Money in Leetcode Bank

LeetCode Problem 1716 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem describes a repeating weekly saving pattern. Hercy deposits money into the LeetCode bank every day, and the amount increases in a structured way. On the very first Monday, he deposits 1 dollar. Each following day in the same week increases by 1 . That means the first week looks like this: Monday: 1 Tuesday: 2 Wednesday: 3...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1688 - Count of Matches in Tournament

LeetCode Problem 1688 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem describes a tournament where teams compete until only one winner remains. At every round, teams are paired to play matches, but the tournament follows slightly unusual rules depending on whether the current number of teams is even or odd. If the number of teams is even, every team gets paired with another team. Since each match...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 869 - Reordered Power of 2

LeetCode Problem 869 Difficulty: 🟡 Medium Topics: Hash Table, Math, Sorting, Counting, Enumeration Solution Problem Understanding The problem gives us a positive integer n and asks whether its digits can be rearranged to form a power of two. The rearrangement may keep the digits in their original order or place them in any other order, but the resulting number cannot contain a leading zero. A power of two is any...

Practice › Codeforces Solutions › Codeforces Beta Round 84 (Div. 1 Only) ›

CF 109E - Lucky Interval

CF 109E - Lucky Interval Rating: 2700 Tags: brute force, math Solve time: 2m 11s Verified: yes Solution Problem Understanding We are given an interval of consecutive integers starting at a and having length l . For every number x , define F(x) as the count of lucky digits inside its decimal representation. Only digits 4 and 7 are considered lucky. The task is to find the smallest integer b...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1840 - Maximum Building Height

LeetCode Problem 1840 Difficulty: 🔴 Hard Topics: Array, Math, Sorting Solution LeetCode 1840 - Maximum Building Height Problem Understanding This problem asks us to construct heights for n buildings arranged in a straight line while satisfying several constraints. Each building has a non-negative integer height. Building 1 must always have height 0 . Additionally, adjacent buildings cannot differ in height by more than 1 . This means that if one...

Practice › Codeforces Solutions › Codeforces Beta Round 62 ›

CF 68D - Half-decay tree

CF 68D - Half-decay tree Rating: 2500 Tags: data structures, divide and conquer, dp, math, probabilities Solve time: 2m 50s Verified: yes Solution Problem Understanding We have a complete binary tree of height h . Every vertex may store some number of electrons, and queries gradually add more electrons to vertices. A decay operation chooses one leaf uniformly at random and deletes every edge on the path from the root...

Practice › Codeforces Solutions ›

Codeforces Beta Round 23

Codeforces Beta Round 23 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1200-2600 | Time: 11m 15s Problem Name Rating Tags Solve Time Verified A You're Given a String... 1200 brute-force, greedy 1m 55s ✓ B Party 1600 constructive-algorithms, graphs, math 3m 27s ✓ C Oranges and Apples 2500 constructive-algorithms, sortings 2m 29s ✓ D Tetragon 2600 geometry, math 2m 11s ✗ E Tree 2500 dp 1m...

Practice › Codeforces Solutions ›

Codeforces Beta Round 44 (Div. 2)

Codeforces Beta Round 44 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-2200 | Time: 8m 58s Problem Name Rating Tags Solve Time Verified A Triangular numbers 800 brute-force, math 1m 10s ✓ B Coins 1200 implementation 1m 42s ✓ C Crossword 2000 implementation 2m 32s ✗ D Safe 2200 brute-force 1m 40s ✓ E Cannon 2200 data-structures, geometry, sortings 1m 54s ✗

Practice › LeetCode › LeetCode 03xx ›

LeetCode 396 - Rotate Function

LeetCode Problem 396 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution Problem Understanding The problem defines a special value called the rotation function for an array. Given an integer array nums of length n , we rotate the array clockwise by k positions to create a new array arrk . For every possible rotation from 0 to n - 1 , we compute: $$F(k) = 0 \cdot arr_k[0] +...

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76C - Mutation

CF 76C - Mutation Rating: 2700 Tags: bitmasks, dp, math Solve time: 2m 6s Verified: yes Solution Problem Understanding We are given a string representing the genome of an organism, where each character is one of the first K capital letters. Adjacent genes contribute to the total “risk of disease” according to a given K × K matrix of non-negative integers. Additionally, we are allowed to remove all occurrences of...

Practice › Codeforces Solutions › Codeforces Beta Round 67 (Div. 2) ›

CF 75D - Big Maximum Sum

CF 75D - Big Maximum Sum Rating: 2000 Tags: data structures, dp, greedy, implementation, math, trees Solve time: 1m 34s Verified: yes Solution Problem Understanding We are given a set of small arrays and a sequence of indexes indicating how to concatenate them into one larger array. Once the large array is built in this way, the goal is to find the maximum sum of a contiguous subarray. This is...

Practice › Codeforces Solutions › Codeforces Beta Round 92 (Div. 2 Only) ›

CF 124A - The number of positions

CF 124A - The number of positions Rating: 1000 Tags: math Solve time: 1m 27s Verified: yes Solution Problem Understanding Petr is standing somewhere in a line containing n people. Positions are numbered from 1 at the front to n at the back. He knows two things about his position. At least a people are standing in front of him, and at most b people are standing behind him. We...

Practice › Codeforces Solutions ›

School Team Contest 1 (Winter Computer School 2010/11)

School Team Contest 1 (Winter Computer School 2010/11) Type: Special | Problems: 11 | Verified: 9/11 | Rating range: 1100-2600 | Time: 23m 20s Problem Name Rating Tags Solve Time Verified A C*++ Calculations 2000 expression-parsing, greedy 2m 42s ✓ B Company Income Growth 1300 greedy 3m 27s ✓ C Moon Craters 2100 dp, sortings 4m 25s ✗ D Cubical Planet 1100 math 1m 27s ✓ E What Has Dirichlet...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 628 - Maximum Product of Three Numbers

LeetCode Problem 628 Difficulty: 🟢 Easy Topics: Array, Math, Sorting Solution Problem Understanding The problem gives an integer array nums and asks us to select exactly three numbers whose product is as large as possible. We must return that maximum product value. In simpler terms, among all possible combinations of three elements in the array, we need to determine which combination produces the greatest multiplication result. The input is an...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 843 - Guess the Word

LeetCode Problem 843 Difficulty: 🔴 Hard Topics: Array, Math, String, Interactive, Game Theory Solution LeetCode 843 - Guess the Word Problem Understanding This is an interactive problem where we must identify a hidden six-letter word from a given list of candidate words. We are not allowed to directly inspect the secret word. Instead, we can interact with the provided Master API by calling master.guess(word) . Each call returns the number...

Practice › Codeforces Solutions ›

Codeforces Beta Round 1

Codeforces Beta Round 1 Type: Beta | Problems: 3 | Verified: 3/3 | Rating range: 1000-2100 | Time: 10m 36s Problem Name Rating Tags Solve Time Verified A Theatre Square 1000 math 4m 1s ✓ B Spreadsheet 1600 implementation, math 4m 55s ✓ C Ancient Berland Circus 2100 geometry, math 1m 40s ✓

Practice › Codeforces Solutions ›

Codeforces Beta Round 39

Codeforces Beta Round 39 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1300-2600 | Time: 7m 51s Problem Name Rating Tags Solve Time Verified A Find Color 1300 constructive-algorithms, geometry, implementation 1m 24s ✓ B Repaintings 1600 math 1m 44s ✓ C Berland Square 2300 implementation, math 1m 38s ✓ D Interesting Sequence 2600 math 1m 55s ✓ E Number Table 2500 combinatorics 1m 10s ✓

Practice › LeetCode › LeetCode 03xx ›

LeetCode 384 - Shuffle an Array

LeetCode Problem 384 Difficulty: 🟡 Medium Topics: Array, Math, Design, Randomized Solution Problem Understanding The problem asks us to design a data structure that supports two operations on an integer array: Reset the array back to its original order. Return a randomly shuffled version of the array. The important requirement is that every possible permutation of the array must be equally likely. This means the shuffle operation cannot introduce statistical...

Practice › Codeforces Solutions › Codeforces Beta Round 23 ›

CF 23B - Party

CF 23B - Party Rating: 1600 Tags: constructive algorithms, graphs, math Solve time: 3m 27s Verified: yes Solution Problem Understanding We can think of the party as an undirected friendship graph. Every person is a vertex, and an edge means two people are friends. The process removes people in rounds. First, everyone with degree 0 leaves. After those removals, some remaining people may now have degree 1 , so they...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 939 - Minimum Area Rectangle

LeetCode Problem 939 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Geometry, Sorting Solution Problem Understanding The problem gives us a collection of distinct points on a 2D plane. Each point is represented as [x, y] , where x is the horizontal coordinate and y is the vertical coordinate. Our task is to determine the minimum possible area of an axis-aligned rectangle that can be formed using four of these...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1228 - Missing Number In Arithmetic Progression

LeetCode Problem 1228 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to find a missing value from an array that originally formed an arithmetic progression (AP). An arithmetic progression is a sequence where the difference between consecutive terms is constant, i.e., arr[i + 1] - arr[i] is the same for every consecutive pair. We are given an array arr where one element has been removed...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1551 - Minimum Operations to Make Array Equal

LeetCode Problem 1551 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem presents an array arr of length n where each element is defined by the formula arr[i] = 2 * i + 1 . This generates an array of consecutive odd numbers starting from 1. The task is to make all elements equal using a specific operation: choose two indices x and y , subtract 1 from arr[x]...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 319 - Bulb Switcher

LeetCode Problem 319 Difficulty: 🟡 Medium Topics: Math, Brainteaser Solution Problem Understanding The problem describes a sequence of n bulbs, all initially turned off. We perform n rounds of operations on these bulbs. In the first round, every bulb is turned on. In the second round, every second bulb is toggled, meaning on bulbs become off and off bulbs become on. In the third round, every third bulb is toggled,...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1442 - Count Triplets That Can Form Two Arrays of Equal XOR

LeetCode Problem 1442 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Bit Manipulation, Prefix Sum Solution Problem Understanding The problem asks us to find the number of triplets (i, j, k) in an array arr such that the XOR of elements from index i to j-1 equals the XOR of elements from index j to k . Formally, for 0 <= i < j <= k < arr.length , define:...

Practice › Codeforces Solutions ›

Codeforces Beta Round 7

Codeforces Beta Round 7 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1100-2600 | Time: 5m 10s Problem Name Rating Tags Solve Time Verified A Kalevitch and Chess 1100 brute-force, constructive-algorithms 1m 5s ✓ B Memory Manager 1600 implementation 1m 1s ✓ C Line 1800 math, number-theory 52s ✓ D Palindrome Degree 2200 hashing, strings 1m 5s ✓ E Defining Macros 2600 dp, expression-parsing, implementation 1m 7s...

Practice › Codeforces Solutions › Yandex.Algorithm 2011: Qualification 2 ›

CF 82A - Double Cola

CF 82A - Double Cola Rating: 1100 Tags: implementation, math Solve time: 1m 30s Verified: yes Solution Problem Understanding Five people stand in a queue in a fixed order: Sheldon, Leonard, Penny, Rajesh, Howard. Whenever the person at the front buys a cola, that person immediately creates a copy of themselves, and both copies go to the back of the queue. The queue keeps growing forever. We are given the...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 913 - Cat and Mouse

LeetCode Problem 913 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Game Theory Solution Problem Understanding In this problem, we are given an undirected graph where two players, Mouse and Cat, move alternately across the graph according to specific rules. The graph is represented as an adjacency list, where graph[a] contains all nodes directly connected to node a . The Mouse always starts at node 1...

Practice › Codeforces Solutions › Codeforces Beta Round 47 ›

CF 50E - Square Equation Roots

CF 50E - Square Equation Roots Rating: 2300 Tags: math Solve time: 1m 58s Verified: yes Solution Problem Understanding We are asked to count all distinct real roots of quadratic equations of the form $x^2 + 2bx + c = 0$, where $b$ ranges from 1 to $n$ and $c$ ranges from 1 to $m$. Each pair $(b, c)$ defines one quadratic. The output is the total number of distinct...

Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73A - The Elder Trolls IV: Oblivon

CF 73A - The Elder Trolls IV: Oblivon Rating: 1600 Tags: greedy, math Solve time: 1m 48s Verified: yes Solution Problem Understanding We have a rectangular block made of unit cubes with dimensions x × y × z . A single cut is always made along the grid lines and must be parallel to one of the faces of the box. Since the cuts are infinitely long and the pieces...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1447 - Simplified Fractions

LeetCode Problem 1447 Difficulty: 🟡 Medium Topics: Math, String, Number Theory Solution Problem Understanding The problem asks us to generate all simplified fractions between 0 and 1 (exclusive) where the denominator does not exceed a given integer n . A simplified fraction is one in which the numerator and denominator are coprime , meaning their greatest common divisor (GCD) is 1. For example, 2/4 is not simplified because it reduces...

Practice › Codeforces Solutions › Codeforces Beta Round 41 ›

CF 42D - Strange town

CF 42D - Strange town Rating: 2300 Tags: constructive algorithms, math Solve time: 1m 50s Verified: no Solution Problem Understanding We are asked to construct a fully connected graph of N tourist attractions, where each road has a distinct positive integer cost not exceeding 1000. The unusual property of this town is that every Hamiltonian cycle -a cycle visiting each attraction exactly once-must have the same total cost. Our task...

Practice › Codeforces Solutions ›

Codeforces Beta Round 26 (Codeforces format)

Codeforces Beta Round 26 (Codeforces format) Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 900-2400 | Time: 7m 38s Problem Name Rating Tags Solve Time Verified A Almost Prime 900 number-theory 1m 18s ✓ B Regular Bracket Sequence 1400 greedy 1m 20s ✓ C Parquet 2000 combinatorics, constructive-algorithms, greedy 2m 9s ✗ D Tickets 2400 combinatorics, math, probabilities 1m 14s ✓ E Multithreading 2400 constructive-algorithms 1m 37s...

Practice › Codeforces Solutions › Codeforces Beta Round 14 (Div. 2) ›

CF 14C - Four Segments

CF 14C - Four Segments Rating: 1700 Tags: brute force, constructive algorithms, geometry, implementation, math Solve time: 1m 48s Verified: yes Solution Problem Understanding We are given exactly four line segments on the 2D plane. Every segment is axis-aligned, or may even degenerate into a single point. The task is to decide whether these four segments together form the border of one rectangle with positive area, where all rectangle sides...

Practice › Codeforces Solutions › Unknown Language Round 2 ›

CF 72F - Oil

CF 72F - Oil Rating: 1900 Tags: *special, greedy, math Solve time: 1m 43s Verified: yes Solution Problem Understanding We have an n × m grid. Some entire rows are empty, some entire columns are empty, and every empty cell belongs to at least one of those empty rows or empty columns. All remaining cells contain oil. If we drill a well in one oil cell, we can reach every...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1401 - Circle and Rectangle Overlapping

LeetCode Problem 1401 Difficulty: 🟡 Medium Topics: Math, Geometry Solution Problem Understanding The problem gives two geometric shapes: A circle, defined by: radius center coordinates (xCenter, yCenter) An axis-aligned rectangle, defined by: bottom-left corner (x1, y1) top-right corner (x2, y2) The goal is to determine whether the circle and rectangle overlap. Two shapes overlap if there exists at least one point that belongs to both shapes simultaneously. The rectangle is...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1427 - Perform String Shifts

LeetCode Problem 1427 Difficulty: 🟢 Easy Topics: Array, Math, String Solution Problem Understanding This problem asks us to simulate a sequence of string shift operations on a given string s . Each operation in the shift matrix contains two values: direction 0 means shift left 1 means shift right amount the number of positions to shift A left shift removes characters from the front and appends them to the back....

Practice › Codeforces Solutions › Codeforces Beta Round 95 (Div. 2) ›

CF 131B - Opposites Attract

CF 131B - Opposites Attract Rating: 1200 Tags: implementation, math Solve time: 1m 34s Verified: yes Solution Problem Understanding We are asked to count all pairs of clients whose assigned numbers are exact opposites. Each client has a number between -10 and 10, and a pair is valid if one client has number $x$ and the other has number $-x$. Zero is considered its own opposite, so two clients with...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 342 - Power of Four

LeetCode Problem 342 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation, Recursion Solution LeetCode 342 - Power of Four Problem Understanding This problem asks us to determine whether a given integer n is an exact power of four. In other words, we need to check whether there exists some integer x such that: n = 4^x Examples of powers of four are: 1 = 4^0 4 = 4^1 16 = 4^2...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 989 - Add to Array-Form of Integer

LeetCode Problem 989 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem is asking us to perform addition between a number represented as an array of digits, num , and an integer k . The array-form of a number represents each digit in left-to-right order, so the first element corresponds to the most significant digit. For example, [1, 2, 0, 0] represents the number 1200 . Given num...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1432 - Max Difference You Can Get From Changing an Integer

LeetCode Problem 1432 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem gives us an integer num , and we are allowed to perform a digit replacement operation twice, independently. In one operation, we: Choose a digit x Choose another digit y Replace every occurrence of digit x in the decimal representation of num with y The two operations are completely independent. This means the second operation starts...

Practice › Codeforces Solutions › Codeforces Beta Round 92 (Div. 1 Only) ›

CF 123B - Squares

CF 123B - Squares Rating: 1800 Tags: math Solve time: 5m 4s Verified: yes Solution Problem Understanding We move on an infinite grid of unit squares. From any square we may move one step up, down, left, or right. Some squares are marked as bad, and entering such a square costs one. The start and finish squares are guaranteed to be good, so the answer counts only the bad squares...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 150 - Evaluate Reverse Polish Notation

LeetCode Problem 150 Difficulty: 🟡 Medium Topics: Array, Math, Stack Solution LeetCode 150, Evaluate Reverse Polish Notation Problem Understanding This problem asks us to evaluate an arithmetic expression written in Reverse Polish Notation, also called postfix notation. Instead of placing operators between operands as in standard infix notation, Reverse Polish Notation places operators after their operands. For example, the infix expression: (2 + 1) * 3 becomes: 2 1 +...

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 1 Only) ›

CF 107B - Basketball Team

CF 107B - Basketball Team Rating: 1600 Tags: combinatorics, dp, math, probabilities Solve time: 2m 22s Verified: yes Solution Problem Understanding We have a university with several departments. Each department contributes some number of basketball players. Herr Wafa belongs to department h , and he is already guaranteed a place on the final team. The team must contain exactly n players including Wafa himself. Every valid team containing Wafa is...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1735 - Count Ways to Make Array With Product

LeetCode Problem 1735 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to count the number of ways to fill an array of size ni with positive integers such that the product of all elements equals ki . Each query in the input array queries is independent, meaning we compute the answer for each (ni, ki) pair separately. The output is...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 598 - Range Addition II

LeetCode Problem 598 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem presents an m x n matrix M initialized with all zeros. You are also given an array of operations ops , where each operation ops[i] = [ai, bi] instructs you to increment by one all elements in the submatrix defined by the top-left corner (0,0) and the bottom-right corner (ai-1, bi-1) . After applying all operations,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 14 (Div. 2)

Codeforces Beta Round 14 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-1900 | Time: 7m 42s Problem Name Rating Tags Solve Time Verified A Letter 800 implementation 1m 8s ✓ B Young Photographer 1000 implementation 1m 20s ✓ C Four Segments 1700 brute-force, constructive-algorithms, geometry 1m 48s ✓ D Two Paths 1900 dfs-and-similar, dp, graphs 1m 27s ✓ E Camels 1900 dp 1m...

Practice › Codeforces Solutions › Codeforces Beta Round 18 (Div. 2 Only) ›

CF 18B - Platforms

CF 18B - Platforms Rating: 1700 Tags: brute force, math Solve time: 1m 13s Verified: yes Solution Problem Understanding We have a line with a series of discrete platforms. Each platform has a fixed length l and is separated from the next by a fixed distance m - l , so platform k occupies the segment from (k-1)*m to (k-1)*m + l . The grasshopper Bob starts at position 0...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 781 - Rabbits in Forest

LeetCode Problem 781 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Greedy Solution Problem Understanding In this problem, every rabbit tells us how many other rabbits share its color. The input array answers contains these responses. If a rabbit says x , that means there are exactly x + 1 rabbits of that color group in total, including itself. The challenge is that we do not know which rabbits belong...

Practice › Codeforces Solutions ›

Codeforces Beta Round 64

Codeforces Beta Round 64 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1300-2700 | Time: 11m 7s Problem Name Rating Tags Solve Time Verified A Cookies 1300 math 1m 46s ✓ B Text Messaging 1600 expression-parsing, greedy, strings 1m 39s ✓ C Lucky Tickets 2200 binary-search, data-structures, sortings 2m 11s ✓ D Professor's task 2700 data-structures, geometry 2m 2s ✓ E Information Reform 2700 dp, implementation, trees...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 952 - Largest Component Size by Common Factor

LeetCode Problem 952 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Union-Find, Number Theory Solution Problem Understanding The problem asks us to find the largest connected component in a graph derived from an array of unique positive integers nums . Each integer in the array represents a node, and there is an undirected edge between two nodes if the corresponding numbers share a common factor greater than 1. Essentially, numbers...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 478 - Generate Random Point in a Circle

LeetCode Problem 478 Difficulty: 🟡 Medium Topics: Math, Geometry, Rejection Sampling, Randomized Solution LeetCode 478 - Generate Random Point in a Circle Problem Understanding This problem asks us to generate random points uniformly inside a circle. The circle is defined by its radius and the coordinates of its center. Every call to randPoint() must return a point [x, y] such that the point lies either inside the circle or exactly...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 268 - Missing Number

LeetCode Problem 268 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting Solution Problem Understanding The problem gives an array nums containing n distinct integers. Every number is supposed to come from the range [0, n] , which means there are actually n + 1 possible values in total. Since the array only contains n numbers, exactly one value from that range is missing. The task...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1512 - Number of Good Pairs

LeetCode Problem 1512 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Counting Solution LeetCode 1512 - Number of Good Pairs Problem Understanding The problem gives us an integer array nums and asks us to count how many pairs of indices (i, j) satisfy two conditions: nums[i] == nums[j] i < j Such pairs are called "good pairs". In simpler terms, we need to count how many times the same value...

Practice › Codeforces Solutions › Codeforces Beta Round 86 (Div. 1 Only) ›

CF 113C - Double Happiness

CF 113C - Double Happiness Rating: 2200 Tags: brute force, math, number theory Solve time: 3m 20s Verified: yes Solution Problem Understanding We are asked to count the numbers in a given interval $l, r$ that are simultaneously prime and expressible as the sum of two positive squares. In simpler terms, for each number in the interval, we need to check two independent properties. First, whether it is prime -...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2033 - Minimum Operations to Make a Uni-Value Grid

LeetCode Problem 2033 Difficulty: 🟡 Medium Topics: Array, Math, Sorting, Matrix Solution Problem Understanding The problem gives us a 2D integer matrix called grid and an integer x . In one operation, we may either add x to a cell or subtract x from a cell. Our goal is to make every value in the grid equal using the minimum number of operations. A key detail is that every operation...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1780 - Check if Number is a Sum of Powers of Three

LeetCode Problem 1780 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem asks whether a given integer n can be expressed as the sum of distinct powers of three. A power of three is any number of the form: $3^x$ where x is a non-negative integer. That means the valid powers are: 3^0 = 1 3^1 = 3 3^2 = 9 3^3 = 27 and so on. The word...

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40B - Repaintings

CF 40B - Repaintings Rating: 1600 Tags: math Solve time: 1m 44s Verified: yes Solution Problem Understanding We start with an n × m chessboard. The top-left cell is black, so the coloring alternates exactly like a normal chessboard. Only the initially black cells participate in the repainting process. At minute 0 , every black cell receives color 0 . After that, at minute i , we repaint every black...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 556 - Next Greater Element III

LeetCode Problem 556 Difficulty: 🟡 Medium Topics: Math, Two Pointers, String Solution LeetCode 556 - Next Greater Element III Problem Understanding This problem asks us to find the smallest integer that is strictly greater than a given integer n , while using exactly the same digits as n . In other words, we are allowed to rearrange the digits of the number, but we cannot add or remove digits. Among...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1103 - Distribute Candies to People

LeetCode Problem 1103 Difficulty: 🟢 Easy Topics: Math, Simulation Solution Problem Understanding The problem describes a sequential candy distribution process across a row of people. We are given two integers, candies and num_people . The goal is to simulate distributing candies in increasing order until all candies are exhausted. The distribution pattern follows a strict sequence. The first person receives 1 candy, the second person receives 2 candies, the third...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 805 - Split Array With Same Average

LeetCode Problem 805 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Bitmask Solution Problem Understanding The problem asks whether we can divide the given array nums into two non-empty groups such that both groups have the same average. Suppose the array is split into subsets A and B . Let: sum(A) be the sum of elements in A len(A) be the number of elements in A...

Practice › Codeforces Solutions ›

Codeforces Beta Round 83 (Div. 1 Only)

Codeforces Beta Round 83 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1400-2700 | Time: 11m 41s Problem Name Rating Tags Solve Time Verified A Dorm Water Supply 1400 dfs-and-similar, graphs 2m 19s ✓ B Basketball Team 1600 combinatorics, dp, math 2m 22s ✓ C Arrangement 2400 bitmasks, dp 2m 35s ✓ D Crime Management 2400 dp, graphs, matrices 2m 6s ✓ E...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1154 - Day of the Year

LeetCode Problem 1154 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to compute the ordinal day number of a year given a date in the format YYYY-MM-DD . For example, January 1st is always day 1, January 2nd is day 2, and December 31st is either day 365 or 366 depending on whether the year is a leap year. The input is a string that...

Practice › Codeforces Solutions › Unknown Language Round 1 ›

CF 64E - Prime Segment

CF 64E - Prime Segment Rating: 1800 Tags: *special, brute force, math, number theory Solve time: 1m 28s Verified: yes Solution Problem Understanding We are asked to find the closest prime numbers surrounding a given integer n . Concretely, we need two numbers, a and b , such that a ≤ n ≤ b and both a and b are prime. Among all prime intervals containing n , the one...

Practice › Codeforces Solutions › Codeforces Beta Round 30 (Codeforces format) ›

CF 30A - Accounting

CF 30A - Accounting Rating: 1400 Tags: brute force, math Solve time: 1m 23s Verified: yes Solution Problem Understanding We are given three integers, A , B , and n . The task is to find an integer value X such that: $A \cdot X^n = B$ A represents the kingdom's income in year 0 , B represents the income after n years, and X is the yearly growth coefficient....

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1215 - Stepping Numbers

LeetCode Problem 1215 Difficulty: 🟡 Medium Topics: Math, Backtracking, Breadth-First Search Solution Problem Understanding The problem is asking us to find all integers within a given range [low, high] that are stepping numbers . A stepping number is defined as a number in which the absolute difference between every pair of adjacent digits is exactly 1 . For instance, 321 is a stepping number because |3-2| = 1 and |2-1|...

Practice › Codeforces Solutions ›

Codeforces Beta Round 18 (Div. 2 Only)

Codeforces Beta Round 18 (Div. 2 Only) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1200-2000 | Time: 7m 50s Problem Name Rating Tags Solve Time Verified A Triangle 1500 brute-force, geometry 1m 48s ✓ B Platforms 1700 brute-force, math 1m 13s ✓ C Stripe 1200 data-structures, implementation 1m 43s ✓ D Seller Bob 2000 brute-force, dp, greedy 1m 54s ✓ E Flag 2 2000 dp...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 539 - Minimum Time Difference

LeetCode Problem 539 Difficulty: 🟡 Medium Topics: Array, Math, String, Sorting Solution Problem Understanding The problem gives a list of time points in 24-hour clock format , where every time is represented as a string in the form "HH:MM" . Your task is to determine the smallest difference in minutes between any two time points in the list. A key detail is that time is cyclic , meaning the clock...

Practice › Codeforces Solutions ›

Codeforces Beta Round 56

Codeforces Beta Round 56 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1300-2600 | Time: 11m 17s Problem Name Rating Tags Solve Time Verified A Where Are My Flakes? 1300 implementation, two-pointers 1m 40s ✓ B Serial Time! 1400 dfs-and-similar, dsu 2m 8s ✗ C Mushroom Strife 2100 brute-force, dfs-and-similar 2m 15s ✓ D Savior 2500 brute-force, dsu, math 2m 1s ✓ E Mushroom Gnomes 2600 math,...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1307 - Verbal Arithmetic Puzzle

LeetCode Problem 1307 Difficulty: 🔴 Hard Topics: Array, Math, String, Backtracking Solution Problem Understanding The problem gives a collection of words on the left side of an equation and a single result word on the right side. Each distinct uppercase letter must be assigned a unique digit from 0 to 9 . After replacing every letter with its assigned digit, the numerical values represented by the left-side words must sum...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1015 - Smallest Integer Divisible by K

LeetCode Problem 1015 Difficulty: 🟡 Medium Topics: Hash Table, Math Solution Problem Understanding The problem asks us to find the length of the smallest positive integer that satisfies two conditions: The integer contains only the digit 1 The integer is divisible by k Such numbers are commonly called repunits. Examples include: 1 11 111 1111 The key detail is that we do not need to return the number itself. We...

Practice › Codeforces Solutions › Codeforces Beta Round 76 (Div. 1 Only) ›

CF 93E - Lostborn

CF 93E - Lostborn Rating: 2600 Tags: dp, math, number theory Solve time: 1m 5s Verified: yes Solution Problem Understanding We are asked to calculate how many numbers from 1 to n are not divisible by any number in a given set of integers, called hit indicators. Each indicator is guaranteed to be coprime with the others, and there are k of them, each at most 1000. Conceptually, imagine Igor's...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 357 - Count Numbers with Unique Digits

LeetCode Problem 357 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Backtracking Solution Problem Understanding The problem asks us to count how many integers in the range 0 <= x < 10^n contain no repeated digits. For example, when n = 2 , the valid range is: 0 <= x < 100 This means we consider every number from 0 to 99 . Among these numbers, we only count those whose...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 866 - Prime Palindrome

LeetCode Problem 866 Difficulty: 🟡 Medium Topics: Math, Number Theory Solution Problem Understanding This problem asks us to find the smallest number greater than or equal to n that satisfies two properties simultaneously: The number must be a palindrome. The number must be prime. A palindrome is a number that reads the same forward and backward. For example, 121 , 1331 , and 7 are palindromes. A prime number is...

Practice › Codeforces Solutions › Codeforces Beta Round 93 (Div. 1 Only) ›

CF 126A - Hot Bath

CF 126A - Hot Bath Rating: 1900 Tags: binary search, brute force, math Solve time: 2m 1s Verified: yes Solution Problem Understanding We are asked to mix hot and cold water to achieve a target bath temperature as close as possible to a given value, while filling the bath as quickly as possible. The inputs describe the temperature of the cold water tap ( t1 ) and the hot water...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 264 - Ugly Number II

LeetCode Problem 264 Difficulty: 🟡 Medium Topics: Hash Table, Math, Dynamic Programming, Heap (Priority Queue) Solution Problem Understanding The problem asks us to generate the sequence of ugly numbers and return the n th value in that sequence. An ugly number is defined as a positive integer whose only prime factors are 2 , 3 , and 5 . This means every ugly number can be formed by multiplying previous...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 836 - Rectangle Overlap

LeetCode Problem 836 Difficulty: 🟢 Easy Topics: Math, Geometry Solution LeetCode 836, Rectangle Overlap Problem Understanding The problem gives us two axis-aligned rectangles , meaning their sides are parallel to the X-axis and Y-axis. Each rectangle is represented as: [x1, y1, x2, y2] Where: (x1, y1) is the bottom-left corner (x2, y2) is the top-right corner The task is to determine whether these two rectangles overlap with positive area ....

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1006 - Clumsy Factorial

LeetCode Problem 1006 Difficulty: 🟡 Medium Topics: Math, Stack, Simulation Solution Problem Understanding The problem asks us to compute a clumsy factorial for a given positive integer n . A standard factorial multiplies all integers from n down to 1 , but the clumsy factorial modifies the operations: instead of multiplying all numbers, it cycles through '*' , '/' , '+' , and '-' in that order, applying the operations...

Practice › Codeforces Solutions ›

Codeforces Testing Round 2

Codeforces Testing Round 2 Type: Special | Problems: 3 | Verified: 2/3 | Rating range: 1000-1600 | Time: 5m 4s Problem Name Rating Tags Solve Time Verified A Measuring Lengths in Baden 1400 math 1m 18s ✓ B Simple XML 1000 implementation 1m 41s ✓ C Hobbits' Party 1600 constructive-algorithms, greedy 2m 5s ✗

Practice › LeetCode › LeetCode 07xx ›

LeetCode 788 - Rotated Digits

LeetCode Problem 788 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution Problem Understanding The problem asks us to count the number of good integers within a given range [1, n] . An integer is considered good if each of its digits, when rotated 180 degrees, forms another valid digit and the resulting number is different from the original. The digits 0 , 1 , and 8 remain the same when...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1641 - Count Sorted Vowel Strings

LeetCode Problem 1641 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem asks us to count the number of strings of length n composed only of vowels a , e , i , o , u such that each string is lexicographically sorted . Lexicographically sorted means that the characters in the string do not decrease as you move from left to right. For example, ae...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1835 - Find XOR Sum of All Pairs Bitwise AND

LeetCode Problem 1835 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation Solution LeetCode 1835 - Find XOR Sum of All Pairs Bitwise AND Problem Understanding This problem asks us to compute the XOR sum of every possible pairwise bitwise AND between two arrays. More formally, for every pair (i, j) : Take arr1[i] AND arr2[j] Add that result to a conceptual list Compute the XOR of all values in that...

Practice › Codeforces Solutions ›

Codeforces Beta Round 77 (Div. 1 Only)

Codeforces Beta Round 77 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1600-2500 | Time: 7m 52s Problem Name Rating Tags Solve Time Verified A Hockey 1600 implementation, strings 1m 15s ✓ B Lucky Numbers 1800 dp, greedy 1m 52s ✓ C Volleyball 1900 shortest-paths 1m 21s ✓ D Horse Races 2500 dp, math 2m ✓ E Lucky Country 2500 dp, dsu, graphs...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1414 - Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

LeetCode Problem 1414 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to find the minimum number of Fibonacci numbers whose sum equals a given integer k . Fibonacci numbers are a sequence where each number is the sum of the previous two, starting with 1 and 1. The input k is a positive integer up to 1 billion. The output is a single integer representing...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 762 - Prime Number of Set Bits in Binary Representation

LeetCode Problem 762 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation Solution Problem Understanding The problem requires counting the numbers within a given inclusive range [left, right] that have a prime number of set bits in their binary representation. The set bits of a number refer to the number of 1 s in its binary representation. For example, the number 6 in binary is 110 , which has 2 set bits....

Practice › Codeforces Solutions › Codeforces Beta Round 57 (Div. 2) ›

CF 61C - Capture Valerian

CF 61C - Capture Valerian Rating: 2000 Tags: math Solve time: 2m 49s Verified: yes Solution Problem Understanding The problem asks us to convert a number from one base to another, with the twist that the target base may be either a standard positional numeral system (2 through 25) or the Roman numeral system. The input consists of three pieces: a source base a , a target base b (or...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 412 - Fizz Buzz

LeetCode Problem 412 Difficulty: 🟢 Easy Topics: Math, String, Simulation Solution LeetCode 412, Fizz Buzz Problem Understanding The problem asks us to generate a list of strings for all integers from 1 to n . For each number, we apply a set of divisibility rules: If the number is divisible by both 3 and 5 , we append "FizzBuzz" . If the number is divisible only by 3 , we...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 313 - Super Ugly Number

LeetCode Problem 313 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming Solution LeetCode 313 - Super Ugly Number Problem Understanding This problem asks us to find the nth number in a special sequence called "super ugly numbers". A super ugly number is a positive integer whose prime factors come only from the given array primes . That means every factorization of the number can use only primes from this list....

Practice › LeetCode › LeetCode 04xx ›

LeetCode 441 - Arranging Coins

LeetCode Problem 441 Difficulty: 🟢 Easy Topics: Math, Binary Search Solution Problem Understanding The problem asks us to determine how many complete rows of a coin staircase can be formed using exactly n coins. A staircase arrangement follows a very specific structure: The first row contains 1 coin The second row contains 2 coins The third row contains 3 coins Continuing in this pattern, the kth row contains exactly k...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1085 - Sum of Digits in the Minimum Number

LeetCode Problem 1085 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding This problem asks us to examine the smallest number in the input array and determine whether the sum of its digits is odd or even. We are given an integer array nums . The task consists of three clear steps: Find the minimum integer in the array. Compute the sum of its digits . Return: 1 if the...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 369 - Plus One Linked List

LeetCode Problem 369 Difficulty: 🟡 Medium Topics: Linked List, Math Solution Problem Understanding The problem requires us to add one to a non-negative integer that is represented as a singly-linked list. Each node in the list contains a single digit, and the head of the list corresponds to the most significant digit. Essentially, the linked list [1,2,3] represents the integer 123 , and adding one should transform it into [1,2,4]...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 789 - Escape The Ghosts

LeetCode Problem 789 Difficulty: 🟡 Medium Topics: Array, Math Solution LeetCode 789 - Escape The Ghosts Problem Understanding This problem takes place on an infinite two dimensional grid. You begin at coordinate (0, 0) and want to reach a destination called target . At the same time, several ghosts also move on the grid from their own starting positions. During every turn, both you and every ghost may: Move one...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1822 - Sign of the Product of an Array

LeetCode Problem 1822 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to determine the sign of the product of all numbers in an integer array, without necessarily computing the actual product itself. A helper function signFunc(x) is defined as: Return 1 if x > 0 Return -1 if x < 0 Return 0 if x == 0 We are given an array nums , and...

Practice › Codeforces Solutions › Codeforces Beta Round 72 (Div. 1 Only) ›

CF 83B - Doctor

CF 83B - Doctor Rating: 1800 Tags: binary search, math, sortings Solve time: 1m 37s Verified: yes Solution Problem Understanding We have a queue of animals waiting for the doctor. Animal i must visit the doctor exactly a[i] times before leaving forever. Whenever an animal is examined, one of two things happens. If it still needs more visits, it immediately moves to the back of the queue. If that visit...

Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70A - Cookies

CF 70A - Cookies Rating: 1300 Tags: math Solve time: 1m 46s Verified: yes Solution Problem Understanding We have a square box of size 2^n × 2^n . Inside this box, we repeatedly place special triangular cookies. A cookie of size k occupies the upper triangular part of a k × k square, including the main diagonal. Its area is: $$1 + 2 + 3 + \dots + k =...

Practice › Codeforces Solutions › Codeforces Beta Round 72 (Div. 1 Only) ›

CF 83A - Magical Array

CF 83A - Magical Array Rating: 1300 Tags: math Solve time: 1m 28s Verified: yes Solution Problem Understanding We are given an integer array and need to count how many contiguous subarrays are "magical". A subarray is magical when its minimum value is equal to its maximum value. A minimum and maximum can only be equal if every element inside the subarray is the same. That observation completely changes the...

Practice › Codeforces Solutions › Codeforces Beta Round 1 ›

CF 1B - Spreadsheet

Problem Understanding The task gives spreadsheet cell coordinates written in one of two formats, and for every coordinate we must convert it into the other format. The first format is the usual Excel-style notation. A column is written using letters, then the row number follows immediately after it. For example, BC23 means column BC and row 23 . The tricky part is that the column behaves like a base-26 numbering...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 738 - Monotone Increasing Digits

LeetCode Problem 738 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to find the largest integer less than or equal to a given number n , such that its digits are monotone increasing. A number has monotone increasing digits when every digit is less than or equal to the digit that comes after it. For example: 1234 is monotone increasing because 1 <= 2 <=...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1561 - Maximum Number of Coins You Can Get

LeetCode Problem 1561 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Sorting, Game Theory Solution LeetCode 1561 - Maximum Number of Coins You Can Get Problem Understanding The problem gives us an array called piles , where each element represents the number of coins in a pile. The length of the array is always divisible by 3 , meaning there are exactly 3n piles for some integer n . In every...

Practice › Codeforces Solutions ›

School Team Contest 2 (Winter Computer School 2010/11)

School Team Contest 2 (Winter Computer School 2010/11) Type: Special | Problems: 10 | Verified: 6/10 | Rating range: 900-2700 | Time: 21m 26s Problem Name Rating Tags Solve Time Verified A Indian Summer 900 implementation 1m 23s ✓ B Cola 1500 implementation 1m 9s ✓ C Holidays 1300 implementation 1m 24s ✓ D Hyperdrive 1800 math 1m 5s ✓ E Anfisa the Monkey 1400 dp 2m 13s ✗ F...

Practice › Codeforces Solutions › Codeforces Beta Round 56 ›

CF 60E - Mushroom Gnomes

CF 60E - Mushroom Gnomes Rating: 2600 Tags: math, matrices Solve time: 3m 13s Verified: yes Solution Problem Understanding We are given a line of mushrooms, each with a weight, initially sorted in non-decreasing order. Every minute, new mushrooms grow between every pair of neighboring mushrooms, and the weight of each new mushroom equals the sum of the two neighboring mushrooms. After some minutes x , the gnomes sort the...

Practice › Codeforces Solutions ›

School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)

School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) Type: Beta | Problems: 8 | Verified: 6/8 | Rating range: 900-2800 | Time: 15m 12s Problem Name Rating Tags Solve Time Verified A Rock-paper-scissors 900 implementation, schedules 1m 31s ✓ B Land Lot 1200 brute-force, implementation 1m 47s ✓ C The Race 1800 math 1m 54s ✓ D Permutations 1500 greedy 2m 3s ✗...

Practice › Codeforces Solutions › Codeforces Beta Round 17 ›

CF 17A - Noldbach problem

CF 17A - Noldbach problem Rating: 1000 Tags: brute force, math, number theory Solve time: 1m 46s Verified: yes Solution Problem Understanding We are given two integers, n and k . We look at all prime numbers from 2 up to n . Among those primes, we want to count how many can be written in the form: $$p_i + p_{i+1} + 1$$ where p_i and p_{i+1} are neighboring primes,...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1304 - Find N Unique Integers Sum up to Zero

LeetCode Problem 1304 Difficulty: 🟢 Easy Topics: Array, Math Solution Problem Understanding The problem asks us to construct an array containing exactly n unique integers whose total sum is equal to 0 . The keyword any is important here because the problem does not require a specific arrangement or a lexicographically smallest answer. As long as the integers are unique and their sum equals zero, the solution is valid. The...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 423 - Reconstruct Original Digits from English

LeetCode Problem 423 Difficulty: 🟡 Medium Topics: Hash Table, Math, String Solution Problem Understanding The problem asks us to reconstruct digits from a jumbled string of English letters representing numbers from 0 to 9 . The input string s contains only characters from the set ["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"] , which correspond to the letters used in English words for digits ( "zero" , "one" , "two" , etc.). The order of the...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 273 - Integer to English Words

LeetCode Problem 273 Difficulty: 🔴 Hard Topics: Math, String, Recursion Solution Problem Understanding The problem asks us to convert a non-negative integer into its English words representation. Instead of returning digits such as 12345 , we must produce a properly formatted English phrase such as "Twelve Thousand Three Hundred Forty Five" . The input is a single integer num where: 0 <= num <= 2^31 - 1 The maximum possible...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 241 - Different Ways to Add Parentheses

LeetCode Problem 241 Difficulty: 🟡 Medium Topics: Math, String, Dynamic Programming, Recursion, Memoization Solution Problem Understanding The problem gives us a mathematical expression as a string containing integers and arithmetic operators ( + , - , * ). We are asked to compute all possible results that can be obtained by inserting parentheses in every valid way. The key detail is that we are not evaluating the expression using normal...

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11B - Jumping Jack

CF 11B - Jumping Jack Rating: 1600 Tags: math Solve time: 1m 26s Verified: yes Solution Problem Understanding Jack starts at position 0 on a number line. His jumps have fixed lengths: the first jump must have length 1 , the second jump length 2 , the third jump length 3 , and so on. For every jump he may choose either direction. The task is to find the minimum...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 887 - Super Egg Drop

LeetCode Problem 887 Difficulty: 🔴 Hard Topics: Math, Binary Search, Dynamic Programming Solution Problem Understanding The problem asks us to determine the minimum number of moves required to identify a critical floor in a building using a limited number of eggs. We are given two integers: k , the number of identical eggs n , the number of floors in the building There exists some unknown floor f such that:...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1217 - Minimum Cost to Move Chips to The Same Position

LeetCode Problem 1217 Difficulty: 🟢 Easy Topics: Array, Math, Greedy Solution Problem Understanding The problem asks us to move n chips located at various positions along a one-dimensional line so that they all end up at the same position. Each chip can be moved either by 2 units at zero cost or by 1 unit at a cost of 1. The input is an array of integers, position , where...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 382 - Linked List Random Node

LeetCode Problem 382 Difficulty: 🟡 Medium Topics: Linked List, Math, Reservoir Sampling, Randomized Solution Problem Understanding The problem gives us the head of a singly linked list and asks us to return a random node value such that every node in the list has exactly the same probability of being selected. The class has two operations: Solution(head) initializes the object with the linked list. getRandom() returns one node value chosen...

Practice › Codeforces Solutions › Codeforces Testing Round 2 ›

CF 125A - Measuring Lengths in Baden

CF 125A - Measuring Lengths in Baden Rating: 1400 Tags: math Solve time: 1m 18s Verified: yes Solution Problem Understanding In Baden, the unit conversion rules are unusual. One inch equals 3 centimeters, and one foot contains 12 inches. We are given a length in centimeters and must express it as feet and inches. The tricky part is the rounding rule. We first convert centimeters into inches, but the result...

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115C - Plumber

CF 115C - Plumber Rating: 2200 Tags: math Solve time: 2m 56s Verified: no Solution Problem Understanding We have an n × m grid. Every cell must contain one of four corner-shaped pipe pieces. Each piece connects exactly two adjacent sides of the cell. The four pipe types are: type 1 connects top and left type 2 connects top and right type 3 connects bottom and right type 4 connects...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 519 - Random Flip Matrix

LeetCode Problem 519 Difficulty: 🟡 Medium Topics: Hash Table, Math, Reservoir Sampling, Randomized Solution Problem Understanding The problem gives us an m x n matrix where every cell initially contains 0 . We need to design a data structure that supports two operations efficiently: flip() This operation must randomly choose one of the remaining cells that still contains 0 , return its coordinates [row, col] , and then change that...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1040 - Moving Stones Until Consecutive II

LeetCode Problem 1040 Difficulty: 🟡 Medium Topics: Array, Math, Sliding Window, Sorting Solution Problem Understanding The problem gives an array stones representing positions of stones on the X-axis, where each position is unique. The goal is to move the endpoint stones -the stones at the smallest and largest positions-so that eventually all stones occupy consecutive positions on the X-axis. An endpoint stone can only be moved to a position that...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 96 - Unique Binary Search Trees

LeetCode Problem 96 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree Solution LeetCode 96 - Unique Binary Search Trees Problem Understanding This problem asks us to determine how many structurally different Binary Search Trees, or BSTs, can be formed using the integers from 1 to n . A Binary Search Tree has an important property: Every value in the left subtree is smaller than the...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 667 - Beautiful Arrangement II

LeetCode Problem 667 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem asks us to construct a permutation of the integers from 1 to n such that the sequence of absolute differences between adjacent elements contains exactly k distinct values. If the constructed array is: $$[a_1, a_2, a_3, \dots, a_n]$$ then we look at the adjacent absolute differences: $$[|a_1-a_2|, |a_2-a_3|, |a_3-a_4|, \dots, |a_{n-1}-a_n|]$$ The requirement is that this...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1634 - Add Two Polynomials Represented as Linked Lists

LeetCode Problem 1634 Difficulty: 🟡 Medium Topics: Linked List, Math, Two Pointers Solution Problem Understanding This problem asks us to add two polynomials represented as singly linked lists. Each node in the linked list represents a single term of a polynomial, with a coefficient and a power. The linked list is sorted in strictly descending order of powers, and terms with zero coefficients do not appear. For example, the polynomial...

Practice › Codeforces Solutions ›

Codeforces Beta Round 57 (Div. 2)

Codeforces Beta Round 57 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2000 | Time: 14m 51s Problem Name Rating Tags Solve Time Verified A Ultra-Fast Mathematician 800 implementation 2m 4s ✓ B Hard Work 1300 strings 6m 35s ✓ C Capture Valerian 2000 math 2m 49s ✓ D Eternal Victory 1800 dfs-and-similar, graphs, greedy 1m 29s ✓ E Enemy is weak 1900 data-structures,...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 296 - Best Meeting Point

LeetCode Problem 296 Difficulty: 🔴 Hard Topics: Array, Math, Sorting, Matrix Solution Problem Understanding The problem gives us a two-dimensional binary grid where each cell contains either 0 or 1 . A value of 1 represents the home location of a friend, while 0 represents an empty cell. We must choose a single meeting point somewhere in the grid such that the sum of all Manhattan distances from every friend's...

Practice › Codeforces Solutions ›

Yandex.Algorithm Open 2011: Qualification 1

Yandex.Algorithm Open 2011: Qualification 1 Type: Special | Problems: 5 | Verified: 3/5 | Rating range: 1400-2700 | Time: 13m 8s Problem Name Rating Tags Solve Time Verified A Plug-in 1400 implementation 1m 36s ✓ B Sequence Formatting 1700 implementation, strings 1m 43s ✓ C Average Score 1700 greedy, math, sortings 3m 31s ✓ D Polycarp's Picture Gallery 2100 constructive-algorithms, greedy 2m 48s ✗ E Pairs 2700 dfs-and-similar, dp, dsu...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1033 - Moving Stones Until Consecutive

LeetCode Problem 1033 Difficulty: 🟡 Medium Topics: Math, Brainteaser Solution Problem Understanding The problem presents three stones placed on distinct positions along a one-dimensional X-axis, represented by integers a , b , and c . A move consists of taking a stone from one of the endpoints (the leftmost or rightmost stone) and placing it at an unoccupied position strictly between the endpoints. The goal is to determine two numbers:...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 523 - Continuous Subarray Sum

LeetCode Problem 523 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Prefix Sum Solution Problem Understanding The problem asks us to determine whether an array contains a continuous subarray whose sum is a multiple of k , while also satisfying an important constraint: the subarray must contain at least two elements . In simpler terms, we need to find whether there exists some contiguous segment of nums , with length...

Practice › Codeforces Solutions ›

Codeforces Beta Round 17

Codeforces Beta Round 17 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1000-2900 | Time: 16m 51s Problem Name Rating Tags Solve Time Verified A Noldbach problem 1000 brute-force, math, number-theory 1m 46s ✓ B Hierarchy 1500 dfs-and-similar, dsu, greedy 1m 34s ✓ C Balance 2500 dp 6m 37s ✗ D Notepad 2400 number-theory 3m 4s ✓ E Palisection 2900 strings 3m 50s ✓

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1012 - Numbers With Repeated Digits

LeetCode Problem 1012 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution Problem Understanding The problem asks us to count how many integers in the range [1, n] contain at least one repeated digit. A repeated digit means that some digit appears more than once in the number. For example, 11 has a repeated 1 , 100 has repeated 0 , and 121 has repeated 1 . On the other hand,...

Practice › Codeforces Solutions › Codeforces Beta Round 24 ›

CF 24C - Sequence of points

CF 24C - Sequence of points Rating: 1800 Tags: geometry, implementation, math Solve time: 2m 35s Verified: yes Solution Problem Understanding We are given a sequence of points on the 2D integer grid: a starting point M0 and a sequence of n points A0, A1, …, An-1, where n is always odd. We then define a new sequence M1, M2, … where each Mi is the reflection of Mi-1 over...

Practice › Codeforces Solutions › Codeforces Beta Round 5 ›

CF 5D - Follow Traffic Rules

CF 5D - Follow Traffic Rules Rating: 2100 Tags: implementation, math Solve time: 54s Verified: yes Solution Problem Understanding We are asked to compute the minimum travel time for a car moving along a straight road from Berland to Bercouver. The road has length l , and at a distance d from the start there is a speed sign that limits the car's instantaneous speed to w . The car...

Practice › Codeforces Solutions › Codeforces Beta Round 80 (Div. 1 Only) ›

CF 103A - Testing Pants for Sadness

CF 103A - Testing Pants for Sadness Rating: 1100 Tags: greedy, implementation, math Solve time: 1m 39s Verified: yes Solution Problem Understanding The test contains several questions that must be answered in order. Each question has multiple answer choices, and exactly one of them is correct. Vaganych does not know any correct answers in advance, but after making a mistake he remembers which options were wrong. Whenever he clicks a...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2963 - Count the Number of Good Partitions

LeetCode Problem 2963 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Combinatorics Solution Problem Understanding The problem asks us to count the number of ways we can partition a given array nums of positive integers into contiguous subarrays such that no number appears in more than one subarray. Each partition must maintain the original order of elements, and two partitions are considered different if the subarrays are split at different...

Practice › Codeforces Solutions › Codeforces Beta Round 72 (Div. 2 Only) ›

CF 84A - Toy Army

CF 84A - Toy Army Rating: 900 Tags: math, number theory Solve time: 1m 30s Verified: yes Solution Problem Understanding We have two armies, each containing n soldiers. The value of n is always even. The game lasts exactly three turns: Valera attacks Arcady. Arcady attacks Valera. Valera attacks Arcady again. Every surviving soldier from the current player chooses exactly one target from the opposing army. All shots happen simultaneously,...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 902 - Numbers At Most N Given Digit Set

LeetCode Problem 902 Difficulty: 🔴 Hard Topics: Array, Math, String, Binary Search, Dynamic Programming Solution Problem Understanding The problem gives us a set of allowed digits, stored as strings, and an integer n . We may construct any positive integer by repeatedly using digits from the given set. Each digit can be reused any number of times. The goal is to count how many positive integers can be formed such...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1610 - Maximum Number of Visible Points

LeetCode Problem 1610 Difficulty: 🔴 Hard Topics: Array, Math, Geometry, Sliding Window, Sorting Solution Problem Understanding In this problem, we are standing at a fixed position on a 2D plane, represented by location = [posx, posy] . Around us, there are multiple points, each with integer coordinates. We are allowed to rotate in place, but we cannot move. Our vision works like a camera with a limited viewing angle. The...

Practice › Codeforces Solutions ›

Codeforces Beta Round 79 (Div. 1 Only)

Codeforces Beta Round 79 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1200-2500 | Time: 11m 56s Problem Name Rating Tags Solve Time Verified A Homework 1200 greedy 2m 5s ✓ B Buses 1700 binary-search, data-structures, dp 1m 57s ✓ C Vectors 2000 implementation, math 2m 22s ✓ D Castle 2300 dp, greedy, probabilities 2m 6s ✓ E Candies and Stones 2500 divide-and-conquer,...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 972 - Equal Rational Numbers

LeetCode Problem 972 Difficulty: 🔴 Hard Topics: Math, String Solution Problem Understanding The problem asks us to determine whether two strings s and t , each representing a rational number in decimal notation, correspond to the same numerical value. These numbers can be expressed as integers, finite decimals, or decimals with repeating parts denoted by parentheses. For example, 0.1(6) represents 0.1666... repeating indefinitely, while 1. represents the integer 1. The...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 957 - Prison Cells After N Days

LeetCode Problem 957 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Bit Manipulation Solution Problem Understanding The problem presents a simulation scenario with a row of exactly 8 prison cells, where each cell is either occupied (1) or vacant (0). Each day, the state of a cell changes based on the states of its immediate neighbors. Specifically, a cell becomes occupied if both of its neighbors are in the same...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 750 - Number Of Corner Rectangles

LeetCode Problem 750 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Matrix Solution Problem Understanding The problem asks us to count the number of corner rectangles in a binary m x n matrix grid . A corner rectangle is defined as a set of four 1 s in the grid that form the corners of an axis-aligned rectangle. Importantly, only the corners need to be 1 ; the interior cells...

Practice › Codeforces Solutions › Codeforces Beta Round 47 ›

CF 50A - Domino piling

CF 50A - Domino piling Rating: 800 Tags: greedy, math Solve time: 1m 5s Verified: yes Solution Problem Understanding We are asked to place as many standard dominoes as possible on a rectangular board of size M by N . Each domino covers exactly two adjacent squares, and dominoes cannot overlap or extend outside the board. The input gives us two integers, M and N , representing the height and...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 368 - Largest Divisible Subset

LeetCode Problem 368 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Sorting Solution Problem Understanding The problem gives us an array of distinct positive integers and asks us to find the largest subset where every pair of numbers satisfies a divisibility relationship. For any two elements a and b in the subset, either a % b == 0 or b % a == 0 must hold. In other words, every...

Practice › Codeforces Solutions › Codeforces Beta Round 63 (Div. 2) ›

CF 69A - Young Physicist

CF 69A - Young Physicist Rating: 1000 Tags: implementation, math Solve time: 1m 43s Verified: yes Solution Problem Understanding We are given several force vectors acting on a body in three-dimensional space. Each vector has three components: its effect along the x-axis, y-axis, and z-axis. A body is in equilibrium only if the total force acting on it is zero in every direction. That means: the sum of all x-components...

Practice › Codeforces Solutions › Codeforces Beta Round 28 (Codeforces format) ›

CF 28E - DravDe saves the world

CF 28E - DravDe saves the world Rating: 2800 Tags: geometry, math Solve time: 2m 19s Verified: no Solution Problem Understanding We are given a simple polygon on the plane, representing the incubator area. DravDe starts at point $A$, which is guaranteed to lie strictly outside the polygon. The airplane moves with constant 3D velocity $V=(x_v,y_v,z_v)$. Since the plane starts at ground level and $z_v>0$, its altitude after time $t_1$...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1227 - Airplane Seat Assignment Probability

LeetCode Problem 1227 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Brainteaser, Probability and Statistics Solution Problem Understanding This problem involves a scenario with n passengers and n seats on an airplane. Each passenger has a designated seat, but the first passenger has lost their ticket and picks a seat randomly. Every subsequent passenger will either take their own seat if it is unoccupied or select a random available seat if...

Practice › Codeforces Solutions › Codeforces Beta Round 94 (Div. 1 Only) ›

CF 128E - Birthday

CF 128E - Birthday Rating: 2900 Tags: geometry, math Solve time: 1m 35s Verified: yes Solution Problem Understanding We are asked to determine the maximum number of banana pieces Maria can produce from a birthday cake decorated with n non-overlapping circular banana pieces using exactly k straight-line cuts. Each circle has a center coordinate (x, y) and a radius r . The goal is not to divide the cake evenly...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 528 - Random Pick with Weight

LeetCode Problem 528 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Prefix Sum, Randomized Solution Problem Understanding The problem asks us to design a data structure that supports weighted random sampling . You are given an array w , where each element represents the weight of an index. Instead of choosing every index with equal probability, the selection probability depends on its weight. For example: If w = [1, 3]...

Practice › Codeforces Solutions › Codeforces Beta Round 86 (Div. 2 Only) ›

CF 114A - Cifera

CF 114A - Cifera Rating: 1000 Tags: math Solve time: 1m 58s Verified: yes Solution Problem Understanding We are given two integers, k and l . The task is to determine whether l can be written as an exact power of k . In other words, we need to check whether there exists a non-negative integer n such that: $l = k^n$ If such an n exists, we print "YES"...

Practice › Codeforces Solutions ›

Codeforces Beta Round 9 (Div. 2 Only)

Codeforces Beta Round 9 (Div. 2 Only) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2300 | Time: 8m 20s Problem Name Rating Tags Solve Time Verified A Die Roll 800 math, probabilities 2m 43s ✓ B Running Student 1200 brute-force, geometry, implementation 1m 26s ✓ C Hexadecimal's Numbers 1200 brute-force, implementation, math 1m 10s ✓ D How many trees? 1900 combinatorics, divide-and-conquer, dp 1m 13s...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 573 - Squirrel Simulation

LeetCode Problem 573 Difficulty: 🟡 Medium Topics: Array, Math Solution LeetCode 573 - Squirrel Simulation Problem Understanding This problem models a squirrel collecting nuts in a 2D garden grid. The garden has a fixed tree position, a starting squirrel position, and multiple nuts scattered around the grid. The squirrel can move one cell at a time in the four cardinal directions, so the distance between two positions is the Manhattan...

Practice › Codeforces Solutions › Codeforces Beta Round 53 ›

CF 57E - Chess

CF 57E - Chess Rating: 3000 Tags: math, shortest paths Solve time: 2m 3s Verified: yes Solution Problem Understanding We start on an infinite chessboard at square (0, 0) . A knight moves using the usual chess move, two cells in one direction and one in the perpendicular direction. Some squares are removed from the board, and the knight is never allowed to stand on them. The task is to...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 258 - Add Digits

LeetCode Problem 258 Difficulty: 🟢 Easy Topics: Math, Simulation, Number Theory Solution Problem Understanding The problem asks us to repeatedly transform a number by summing its digits until only a single digit remains. The final single digit should then be returned. For example, if the input is 38 , we first compute 3 + 8 = 11 . Since 11 still has more than one digit, we repeat the process...

Practice › Codeforces Solutions › Yandex.Algorithm 2011: Round 2 ›

CF 86A - Reflection

CF 86A - Reflection Rating: 1600 Tags: math Solve time: 2m 9s Verified: yes Solution Problem Understanding We are given two integers, l and r . For every number n inside this interval, we build another number called its reflection. The reflection is created digit by digit. Every decimal digit d becomes 9 - d . For example: 192 → 807 10 → 89 91 → 08 → 8 The...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1271 - Hexspeak

LeetCode Problem 1271 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to convert a decimal number given as a string into its Hexspeak representation. Hexspeak is derived from the hexadecimal representation of the number, with a simple character substitution: '0' becomes 'O' and '1' becomes 'I' . A valid Hexspeak string can only contain the characters {'A', 'B', 'C', 'D', 'E', 'F', 'I', 'O'} ....

Practice › Codeforces Solutions ›

Codeforces Beta Round 58

Codeforces Beta Round 58 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1300-2700 | Time: 8m 15s Problem Name Rating Tags Solve Time Verified A A Student's Dream 1300 greedy, math 1m 13s ✓ B Tyndex.Brome 1800 binary-search, implementation 1m 18s ✓ C Inquisition 2300 geometry, implementation, sortings 1m 32s ✓ D Wormhouse 2300 dfs-and-similar, graphs 2m 15s ✗ E World Evil 2700 dp, flows 1m 57s...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 365 - Water and Jug Problem

LeetCode Problem 365 Difficulty: 🟡 Medium Topics: Math, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem gives us two water jugs with capacities x and y . We can perform only three types of operations: Fill a jug completely Empty a jug completely Pour water from one jug into the other until either the source jug becomes empty or the destination jug becomes full Our goal is to determine...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 840 - Magic Squares In Grid

LeetCode Problem 840 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Matrix Solution Problem Understanding The problem asks us to count the number of 3 x 3 magic squares inside a larger grid. A magic square is defined as a square where all numbers are distinct integers from 1 to 9 and the sum of each row, column, and the two diagonals is the same. The input is a 2D...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2029 - Stone Game IX

LeetCode Problem 2029 Difficulty: 🟡 Medium Topics: Array, Math, Greedy, Counting, Game Theory Solution Problem Understanding The problem describes a turn-based game between Alice and Bob with a row of stones, each having a numeric value. On each turn, a player removes any stone of their choice. The game has a losing condition based on the sum of removed stones: if the cumulative sum of all removed stones becomes divisible...

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 2 Only) ›

CF 108B - Datatypes

CF 108B - Datatypes Rating: 1400 Tags: math, sortings Solve time: 4m 7s Verified: yes Solution Problem Understanding We are given several unsigned integer datatypes, each defined by its bit length. A datatype with a bits can store every integer from 0 up to 2^a - 1 . We want to know whether there exists some integer x and two datatypes with sizes a[i] < a[j] such that: x fits...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1232 - Check If It Is a Straight Line

LeetCode Problem 1232 Difficulty: 🟢 Easy Topics: Array, Math, Geometry Solution Problem Understanding The problem asks us to determine whether a given set of points in a 2D Cartesian plane all lie on a single straight line. The input is a list of integer coordinates, where each coordinate [x, y] represents a point. The expected output is a boolean: true if all the points lie on a straight line, and...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 462 - Minimum Moves to Equal Array Elements II

LeetCode Problem 462 Difficulty: 🟡 Medium Topics: Array, Math, Sorting Solution Problem Understanding This problem asks us to determine the minimum number of moves required to make all elements in an integer array equal, where a move consists of incrementing or decrementing a single element by 1 . In other words, we want to find a single target value that, when all elements are adjusted to it, requires the fewest...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1088 - Confusing Number II

LeetCode Problem 1088 Difficulty: 🔴 Hard Topics: Math, Backtracking Solution Problem Understanding In this problem, we are given an integer n , and we must count how many numbers in the range [1, n] are considered confusing numbers. A number becomes a confusing number if, after rotating every digit by 180 degrees, the resulting number is both: Valid after rotation Different from the original number Only five digits remain valid...

Practice › Codeforces Solutions ›

Codeforces Beta Round 46 (Div. 2)

Codeforces Beta Round 46 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2300 | Time: 8m 21s Problem Name Rating Tags Solve Time Verified A Sleuth 800 implementation 1m 21s ✓ B Sum 1500 math 1m 24s ✓ C Disposition 1700 constructive-algorithms, math 1m 48s ✓ D Game 1800 brute-force, dp, implementation 1m 47s ✓ E Common ancestor 2300 dp 2m 1s ✓

Practice › LeetCode › LeetCode 05xx ›

LeetCode 509 - Fibonacci Number

LeetCode Problem 509 Difficulty: 🟢 Easy Topics: Math, Dynamic Programming, Recursion, Memoization Solution Problem Understanding This problem asks us to compute the n th Fibonacci number. The Fibonacci sequence is defined recursively. The first two numbers are fixed: F(0) = 0 F(1) = 1 Every value after that is calculated as the sum of the previous two values: F(n) = F(n - 1) + F(n - 2) Given an integer...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2001 - Number of Pairs of Interchangeable Rectangles

LeetCode Problem 2001 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Counting, Number Theory Solution LeetCode 2001 - Number of Pairs of Interchangeable Rectangles Problem Understanding This problem asks us to count how many pairs of rectangles are interchangeable. Each rectangle is represented by two integers, width and height . Two rectangles are considered interchangeable if their width-to-height ratios are exactly the same. In mathematical terms, rectangles i and j...

Practice › Codeforces Solutions › Codeforces Beta Round 15 ›

CF 15B - Laser

CF 15B - Laser Rating: 1800 Tags: math Solve time: 2m 54s Verified: yes Solution Problem Understanding We have a rectangular grid with n columns and m rows. Two lasers point at two different cells. Both lasers always move together, meaning their relative offset never changes. If one laser moves by (dx, dy) , the other must move by exactly the same vector. Every time the lasers stand on two...

Practice › Codeforces Solutions ›

Codeforces Beta Round 86 (Div. 2 Only)

Codeforces Beta Round 86 (Div. 2 Only) Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1500 | Time: 4m 17s Problem Name Rating Tags Solve Time Verified A Cifera 1000 math 1m 58s ✓ B PFAST Inc. 1500 bitmasks, brute-force, graphs 2m 19s ✓

Practice › LeetCode › LeetCode 03xx ›

LeetCode 343 - Integer Break

LeetCode Problem 343 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming Solution Problem Understanding The problem asks us to split a positive integer n into the sum of at least two positive integers, then maximize the product of those integers. In other words, we are not allowed to keep the number as-is. We must break it into multiple parts, and among all possible valid splits, we want the one whose multiplication...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 294 - Flip Game II

LeetCode Problem 294 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Backtracking, Memoization, Game Theory Solution Problem Understanding This problem describes a two-player impartial game played on a string consisting only of '+' and '-' characters. A valid move consists of selecting any pair of consecutive "++" characters and flipping them into "--" . The players alternate turns. If a player cannot make a valid move on their turn, they lose...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 43 - Multiply Strings

LeetCode Problem 43 Difficulty: 🟡 Medium Topics: Math, String, Simulation Solution Problem Understanding The problem asks us to multiply two non-negative integers where each integer is provided as a string instead of a numeric type. The result must also be returned as a string. The important restriction is that we cannot directly convert the strings into integers or use any built-in big integer library. In other words, we must manually...

Practice › Codeforces Solutions ›

Codeforces Beta Round 50

Codeforces Beta Round 50 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1300-2700 | Time: 8m 47s Problem Name Rating Tags Solve Time Verified A Presents 1300 implementation 1m 19s ✓ B Cutting Jigsaw Puzzle 1800 hashing, implementation 1m 29s ✓ C First Digit Law 2000 dp, math, probabilities 1m 10s ✓ D Writing a Song 2100 brute-force, dp, strings 1m 3s ✓ E Vacuum \u0421leaner 2700...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1739 - Building Boxes

LeetCode Problem 1739 Difficulty: 🔴 Hard Topics: Math, Binary Search, Greedy Solution Problem Understanding The problem gives us n identical unit cubes that must be placed inside a cubic room. The goal is to minimize how many boxes directly touch the floor. The placement rule is the important part of the problem. A box can only support another box on top of it if all four of its vertical sides...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 592 - Fraction Addition and Subtraction

LeetCode Problem 592 Difficulty: 🟡 Medium Topics: Math, String, Simulation Solution Problem Understanding The problem requires computing the result of a mathematical expression containing fractions with addition and subtraction operators. The input is a single string, expression , which consists of positive or negative fractions in the format numerator/denominator . The output must be an irreducible fraction, represented as a string in the same format. If the result is an...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 710 - Random Pick with Blacklist

LeetCode Problem 710 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Binary Search, Sorting, Randomized Solution Problem Understanding The problem asks us to design a data structure that can repeatedly return a random integer from the range [0, n - 1] , while excluding all integers that appear in a blacklist. Every valid number must have exactly the same probability of being chosen. The challenge is not simply filtering numbers....

Practice › LeetCode › LeetCode 03xx ›

LeetCode 391 - Perfect Rectangle

LeetCode Problem 391 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Geometry, Sweep Line Solution Problem Understanding This problem asks whether a collection of smaller axis-aligned rectangles perfectly forms one larger rectangle, with no gaps and no overlaps. Each rectangle is represented as: [xi, yi, ai, bi] where: (xi, yi) is the bottom-left corner (ai, bi) is the top-right corner Because the rectangles are axis-aligned, their sides are parallel to...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2028 - Find Missing Observations

LeetCode Problem 2028 Difficulty: 🟡 Medium Topics: Array, Math, Simulation Solution Problem Understanding The problem gives us the results of some dice rolls and asks us to reconstruct the missing ones. We have a total of n + m rolls of a standard 6-sided die. Out of those rolls: m values are known and stored in the array rolls n values are missing the average of all n + m...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1363 - Largest Multiple of Three

LeetCode Problem 1363 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Greedy, Sorting Solution I can do that, but the guide will be very long and may get truncated in a single message because of the required depth and sections. To preserve quality and include everything comprehensively, I recommend splitting it into 2 parts : Part 1 Problem Understanding Approaches Algorithm Walkthrough Python Solution Go Solution Part 2 Worked Examples...

Practice › Codeforces Solutions ›

Codeforces Beta Round 11

Codeforces Beta Round 11 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 900-2800 | Time: 8m 46s Problem Name Rating Tags Solve Time Verified A Increasing Sequence 900 constructive-algorithms, implementation, math 1m 24s ✓ B Jumping Jack 1600 math 1m 26s ✓ C How Many Squares? 2200 implementation 2m 42s ✓ D A Simple Task 2200 bitmasks, dp, graphs 1m 29s ✓ E Forward, march! 2800 binary-search,...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1037 - Valid Boomerang

LeetCode Problem 1037 Difficulty: 🟢 Easy Topics: Array, Math, Geometry Solution Problem Understanding This problem asks us to determine whether three given points in a 2D Cartesian plane form a valid boomerang. A boomerang is defined as a set of three points that are all distinct and not in a straight line . In other words, the points must not coincide and must not be collinear. The input is always...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1131 - Maximum of Absolute Value Expression

LeetCode Problem 1131 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem gives us two integer arrays, arr1 and arr2 , both having the same length. We must compute the maximum possible value of the following expression across every pair of indices (i, j) : $$|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|$$ The task is not asking for the indices themselves, only the largest...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 779 - K-th Symbol in Grammar

LeetCode Problem 779 Difficulty: 🟡 Medium Topics: Math, Bit Manipulation, Recursion Solution Problem Understanding The problem defines a special binary grammar sequence that grows row by row. The first row contains only a single value: 0 Every later row is generated from the previous one using these rules: Replace every 0 with 01 Replace every 1 with 10 This means the rows evolve like this: Row 1: 0 Row 2:...

Practice › Codeforces Solutions › Codeforces Beta Round 95 (Div. 2) ›

CF 131C - The World is a Theatre

CF 131C - The World is a Theatre Rating: 1400 Tags: combinatorics, math Solve time: 1m 35s Verified: yes Solution Problem Understanding We have a theatre club with n boys and m girls. A performance group must contain exactly t people, with two extra restrictions: at least 4 of them must be boys, and at least 1 must be a girl. The task is to count how many different valid...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1185 - Day of the Week

LeetCode Problem 1185 Difficulty: 🟢 Easy Topics: Math Solution LeetCode 1185 - Day of the Week Problem Understanding This problem asks us to determine which day of the week corresponds to a given calendar date. The input consists of three integers: day , representing the day within the month month , representing the month number from 1 to 12 year , representing the year We must return the correct weekday...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 808 - Soup Servings

LeetCode Problem 808 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Probability and Statistics Solution Problem Understanding The problem gives us two soups, A and B, each starting with exactly n milliliters. At every turn, one of four serving operations is chosen uniformly at random. Each operation removes different amounts from A and B simultaneously. The four possible operations are: Remove 100 mL from A and 0 mL from B Remove...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1073 - Adding Two Negabinary Numbers

LeetCode Problem 1073 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem asks us to add two numbers that are represented in negabinary , which is base -2 . Unlike standard binary (base 2), each bit in negabinary contributes a value multiplied by powers of -2. For example, the array [1,1,0,1] represents: 1 * (-2)^3 + 1 * (-2)^2 + 0 * (-2)^1 + 1 * (-2)^0 =...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1067 - Digit Count in Range

LeetCode Problem 1067 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming Solution Problem Understanding This problem asks us to count how many times a given digit d appears in every integer within a range [low, high] . For instance, if d = 1 and the range is [1, 13] , we count all occurrences of the digit 1 in the numbers 1 through 13. Numbers like 11 contribute two occurrences, while...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1330 - Reverse Subarray To Maximize Array Value

LeetCode Problem 1330 Difficulty: 🔴 Hard Topics: Array, Math, Greedy Solution LeetCode 1330 - Reverse Subarray To Maximize Array Value Problem Understanding The problem gives us an integer array nums and defines the "value" of the array as the sum of the absolute differences between every pair of adjacent elements. Formally, the value is: $$\sum_{i=0}^{n-2} |nums[i] - nums[i+1]|$$ We are allowed to reverse exactly one subarray, or equivalently choose any...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1524 - Number of Sub-arrays With Odd Sum

LeetCode Problem 1524 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Prefix Sum Solution Problem Understanding The problem asks us to count the number of subarrays within a given integer array arr whose sums are odd. A subarray is defined as a contiguous segment of the original array. The input is a list of integers, and we need to return the count of subarrays whose total sum is odd. The...

Practice › Codeforces Solutions ›

Codeforces Beta Round 53

Codeforces Beta Round 53 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1300-3000 | Time: 8m 25s Problem Name Rating Tags Solve Time Verified A Square Earth? 1300 dfs-and-similar, greedy, implementation 1m 22s ✓ B Martian Architecture 1600 implementation 1m 37s ✓ C Array 1900 combinatorics, math 1m 21s ✓ D Journey 2500 dp, math 2m 2s ✓ E Chess 3000 math, shortest-paths 2m 3s ✓

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1093 - Statistics from a Large Sample

LeetCode Problem 1093 Difficulty: 🟡 Medium Topics: Array, Math, Probability and Statistics Solution Problem Understanding This problem asks us to compute several descriptive statistics-minimum, maximum, mean, median, and mode-from a very large sample of integers ranging from 0 to 255. The key challenge is that the sample size can be up to 1 billion elements, so it is not feasible to explicitly generate the full array . Instead, we are...

Practice › Codeforces Solutions › Codeforces Alpha Round 21 (Codeforces format) ›

CF 21B - Intersection

CF 21B - Intersection Rating: 2000 Tags: implementation, math Solve time: 1m 21s Verified: yes Solution Problem Understanding Each input line describes a geometric object in the plane. The equation $$Ax + By + C = 0$$ represents a line. The task is to determine how many points belong to both lines at the same time. Two different non-parallel lines intersect at exactly one point. Two parallel but distinct lines...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 996 - Number of Squareful Arrays

LeetCode Problem 996 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask Solution Problem Understanding The problem asks us to count all permutations of a given integer array nums such that the array is squareful , meaning that the sum of every pair of adjacent elements is a perfect square . In other words, for a permutation [a1, a2, a3, ..., an] , each a[i]...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1238 - Circular Permutation in Binary Representation

LeetCode Problem 1238 Difficulty: 🟡 Medium Topics: Math, Backtracking, Bit Manipulation Solution LeetCode 1238 - Circular Permutation in Binary Representation Problem Understanding This problem asks us to construct a special ordering of all integers from 0 to 2^n - 1 . The ordering must satisfy the properties of a circular Gray code sequence. We are given two integers: n , which determines how many numbers exist in the permutation start...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1648 - Sell Diminishing-Valued Colored Balls

LeetCode Problem 1648 Difficulty: 🟡 Medium Topics: Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue) Solution Here is the complete, detailed technical solution guide for LeetCode 1648 - Sell Diminishing-Valued Colored Balls following your requested structure and formatting rules. Problem Understanding The problem asks us to sell orders number of balls from an inventory of different colored balls in a way that maximizes the total value obtained . Each...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2005 - Subtree Removal Game with Fibonacci Tree

LeetCode Problem 2005 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Tree, Binary Tree, Game Theory Solution LeetCode 2005 - Subtree Removal Game with Fibonacci Tree Problem Understanding The problem defines a special kind of binary tree called a Fibonacci tree. The structure is recursive: order(0) is an empty tree. order(1) is a single node. order(n) has: a root node, a left subtree equal to order(n - 2) , a right...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 166 - Fraction to Recurring Decimal

LeetCode Problem 166 Difficulty: 🟡 Medium Topics: Hash Table, Math, String Solution Problem Understanding This problem asks us to convert a fraction, represented by an integer numerator and an integer denominator , into its decimal string representation. If the decimal expansion contains a repeating fractional sequence, we must enclose the repeating part in parentheses. For example, the fraction 1/2 produces "0.5" because it terminates. The fraction 1/3 produces "0.(3)" because...

Practice › Codeforces Solutions › Codeforces Beta Round 56 ›

CF 60D - Savior

CF 60D - Savior Rating: 2500 Tags: brute force, dsu, math Solve time: 2m 1s Verified: yes Solution Problem Understanding Each lawn contains a distinct positive integer. Two lawns are considered connected if their numbers can appear together in some primitive Pythagorean triple. A primitive Pythagorean triple is a triple of pairwise coprime integers satisfying: $x^2+y^2=z^2$ The word "primitive" matters because the numbers must also be pairwise coprime. If lawn...

Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 2 Only) ›

CF 92A - Chips

CF 92A - Chips Rating: 800 Tags: implementation, math Solve time: 3m 15s Verified: yes Solution Problem Understanding We have n walruses arranged in a circle. The presenter starts with m chips and distributes them in order. Walrus 1 receives 1 chip, walrus 2 receives 2 chips, and so on up to walrus n , after which the cycle repeats again from walrus 1 . The process continues as long...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1643 - Kth Smallest Instructions

LeetCode Problem 1643 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Combinatorics Solution Problem Understanding This problem asks us to generate a specific path for Bob from the top-left corner (0, 0) to a destination (row, column) on a grid. Bob can only move right ( 'H' ) or down ( 'V' ). Any sequence of moves that respects these directions and reaches the destination is a valid instruction. The...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 970 - Powerful Integers

LeetCode Problem 970 Difficulty: 🟡 Medium Topics: Hash Table, Math, Enumeration Solution LeetCode 970 - Powerful Integers Problem Understanding This problem asks us to generate all integers that can be written in the form: $x^i + y^j$ where: i >= 0 j >= 0 the resulting value is less than or equal to bound The inputs are three integers: x , the base of the first exponential term y ,...

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 1) ›

CF 135B - Rectangle and Square

CF 135B - Rectangle and Square Rating: 1600 Tags: brute force, geometry, math Solve time: 2m 3s Verified: yes Solution Problem Understanding We are given eight distinct points on the plane. The task is to split them into two disjoint groups of four points each. One group must form a square. The other group must form a rectangle. A square is also allowed for the rectangle group, so the second...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1569 - Number of Ways to Reorder Array to Get Same BST

LeetCode Problem 1569 Difficulty: 🔴 Hard Topics: Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Tree Solution Problem Understanding The problem gives us a permutation of integers from 1 to n , and we insert the numbers into an initially empty Binary Search Tree (BST) in the exact order they appear in the array. A BST has the following property: Values smaller than...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 263 - Ugly Number

LeetCode Problem 263 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine whether a given integer n is an ugly number. An ugly number is defined as a positive integer whose prime factors are limited to only 2 , 3 , and 5 . This means that after completely factoring the number into primes, every prime factor must belong to the set {2, 3, 5}...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 62 - Unique Paths

LeetCode Problem 62 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Combinatorics Solution Unique Paths Problem Understanding The problem describes a robot moving on a rectangular m x n grid. The robot starts at the top left corner of the grid and wants to reach the bottom right corner. At every step, the robot is only allowed to move either one cell to the right or one cell downward. The input...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1812 - Determine Color of a Chessboard Square

LeetCode Problem 1812 Difficulty: 🟢 Easy Topics: Math, String Solution LeetCode 1812 - Determine Color of a Chessboard Square Problem Understanding This problem asks us to determine whether a given chessboard square is white or black based on its coordinate. The input is a string of length two, where the first character is a lowercase letter from 'a' to 'h' , representing the column, and the second character is a...

Practice › Codeforces Solutions › Codeforces Beta Round 70 (Div. 2) ›

CF 78D - Archer's Shot

CF 78D - Archer's Shot Rating: 2300 Tags: binary search, geometry, math, two pointers Solve time: 2m 7s Verified: yes Solution Problem Understanding We are asked to calculate how many hexagonal cells a single archer can fully cover with a circular attack of radius k , where the archer is positioned at the center of a cell. Each hexagon has side length 1. A cell counts as covered only if...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 800 - Similar RGB Color

LeetCode Problem 800 Difficulty: 🟢 Easy Topics: Math, String, Enumeration Solution Problem Understanding The problem is asking us to find the shorthand RGB color that is most similar to a given full-length RGB color string. An RGB color is represented as a hexadecimal string of the form "#RRGGBB" , where each pair of characters ( RR , GG , BB ) represents the red, green, and blue components, respectively, using...

Practice › Codeforces Solutions ›

Codeforces Beta Round 93 (Div. 1 Only)

Codeforces Beta Round 93 (Div. 1 Only) Type: Div. 1 | Problems: 2 | Verified: 2/2 | Rating range: 1700-1900 | Time: 4m 5s Problem Name Rating Tags Solve Time Verified A Hot Bath 1900 binary-search, brute-force, math 2m 1s ✓ B Password 1700 binary-search, dp, hashing 2m 4s ✓

Practice › LeetCode › LeetCode 08xx ›

LeetCode 810 - Chalkboard XOR Game

LeetCode Problem 810 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation, Brainteaser, Game Theory Solution LeetCode 810, Chalkboard XOR Game Problem Understanding This problem describes a two player game played on an array of integers. The numbers are written on a chalkboard, and players take turns erasing exactly one number. Alice moves first, then Bob, and both players play optimally. The key rule is unusual. A player loses immediately if...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1573 - Number of Ways to Split a String

LeetCode Problem 1573 Difficulty: 🟡 Medium Topics: Math, String Solution LeetCode 1573 - Number of Ways to Split a String Problem Understanding The problem gives us a binary string s , meaning the string contains only the characters '0' and '1' . We must split this string into exactly three non-empty parts: s1 s2 s3 These three parts must concatenate back into the original string: s1 + s2 + s3...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 168 - Excel Sheet Column Title

LeetCode Problem 168 Difficulty: 🟢 Easy Topics: Math, String Solution Problem Understanding The problem asks us to convert a positive integer into the column naming format used by Microsoft Excel. Excel labels columns alphabetically instead of numerically. The sequence begins as: 1 -> A 2 -> B ... 26 -> Z 27 -> AA 28 -> AB The input, columnNumber , represents a 1-based column index. Our goal is to...

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11A - Increasing Sequence

CF 11A - Increasing Sequence Rating: 900 Tags: constructive algorithms, implementation, math Solve time: 1m 24s Verified: yes Solution Problem Understanding We have an array of integers, and we want every element to become strictly larger than the one before it. The only operation allowed is choosing a single element and increasing it by exactly d . Every use of this operation counts as one move. The task is to...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1742 - Maximum Number of Balls in a Box

LeetCode Problem 1742 Difficulty: 🟢 Easy Topics: Hash Table, Math, Counting Solution Problem Understanding The problem describes a scenario in which you have a sequence of balls numbered consecutively from lowLimit to highLimit , inclusive. Each ball must be placed into a box, where the box number is determined by the sum of the digits of the ball’s number. For example, ball 321 goes into box 3 + 2 +...

Practice › Codeforces Solutions › Codeforces Beta Round 24 ›

CF 24D - Broken robot

CF 24D - Broken robot Rating: 2400 Tags: dp, math, probabilities Solve time: 1m 34s Verified: yes Solution Problem Understanding The board has N rows and M columns. A robot starts at cell (i, j) and repeatedly performs one random move. From an interior cell it has four equally likely choices: stay in place, move left, move right, or move down. On the left border, moving left is impossible, so...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1390 - Four Divisors

LeetCode Problem 1390 Difficulty: 🟡 Medium Topics: Array, Math Solution Problem Understanding The problem asks us to calculate the sum of divisors for numbers in a given integer array nums , but only for those numbers that have exactly four divisors . For each number n in nums , we need to determine all its divisors, check if there are exactly four, and if so, sum them up. The output...

Practice › Codeforces Solutions › Codeforces Beta Round 86 (Div. 1 Only) ›

CF 113E - Sleeping

CF 113E - Sleeping Rating: 2700 Tags: combinatorics, implementation, math Solve time: 1m 59s Verified: yes Solution Problem Understanding We are asked to count the number of times a digital clock shows a moment where at least k digits change simultaneously while Vasya is watching it. The clock is not necessarily 24-hour or 60-minute - it has h hours and m minutes, where both are arbitrary integers up to 10^9....

Practice › Codeforces Solutions ›

Codeforces Beta Round 13

Codeforces Beta Round 13 Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1000-2700 | Time: 7m 43s Problem Name Rating Tags Solve Time Verified A Numbers 1000 implementation, math 1m 3s ✓ B Letter A 2000 geometry, implementation 1m 45s ✓ C Sequence 2200 dp, sortings 1m 24s ✓ D Triangles 2600 dp, geometry 1m 38s ✓ E Holes 2700 data-structures, dsu 1m 53s ✓

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40C - Berland Square

CF 40C - Berland Square Rating: 2300 Tags: implementation, math Solve time: 1m 38s Verified: yes Solution Problem Understanding We have two families of circles on the infinite plane. The first family contains circles centered at (x, 0) with radii 1, 2, ..., N . The second family contains circles centered at (y, 0) with radii 1, 2, ..., M . All circles are drawn simultaneously, and we need to...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 728 - Self Dividing Numbers

LeetCode Problem 728 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to find all numbers within a given inclusive range [left, right] that satisfy the definition of a self-dividing number. A self-dividing number has two important properties: Every digit inside the number must divide the number evenly. The number cannot contain the digit 0 . For example, consider the number 128 . 128 % 1 ==...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1362 - Closest Divisors

LeetCode Problem 1362 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem gives us an integer num , and asks us to find two integers whose product equals either num + 1 or num + 2 , such that the absolute difference between the two integers is as small as possible. In simpler terms, we are looking for a factor pair of either num + 1 or num +...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 356 - Line Reflection

LeetCode Problem 356 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math Solution Problem Understanding The problem gives us a collection of points on a 2D plane, where each point is represented as [x, y] . We need to determine whether there exists a vertical line, meaning a line parallel to the y-axis, such that reflecting every point across that line produces the exact same set of points. A vertical reflection...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 458 - Poor Pigs

LeetCode Problem 458 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Combinatorics Solution Problem Understanding The problem gives us a set of buckets where exactly one bucket contains poison. We need to determine which bucket is poisonous using the fewest number of pigs possible, under a strict time limit. Each pig can participate in multiple rounds of testing. A pig dies exactly minutesToDie minutes after drinking poison. The total testing window...

Practice › Codeforces Solutions › Unknown Language Round 3 ›

CF 100E - Lamps in a Line

CF 100E - Lamps in a Line Rating: 1600 Tags: *special, math Solve time: 1m 35s Verified: yes Solution Problem Understanding We have a row of n lamps, each initially either on or off. Each lamp has a number from 1 to n . We also have n keys numbered the same way. Pressing key i toggles every lamp whose number is divisible by i . After a sequence of...

Practice › Codeforces Solutions › Codeforces Beta Round 1 ›

CF 1C - Ancient Berland Circus

Problem Understanding We are given the coordinates of three vertices of some regular polygon. The polygon itself is unknown: we do not know how many sides it has, where its center is, or which vertices the three points correspond to. Among all regular polygons that could contain these three points as vertices, we must find the one with the smallest area. The key geometric fact is that every regular polygon...

Practice › Codeforces Solutions ›

Codeforces Alpha Round 21 (Codeforces format)

Codeforces Alpha Round 21 (Codeforces format) Type: Special | Problems: 4 | Verified: 3/4 | Rating range: 1900-2400 | Time: 5m 6s Problem Name Rating Tags Solve Time Verified A Jabber ID 1900 implementation, strings 1m 37s ✗ B Intersection 2000 implementation, math 1m 21s ✓ C Stripe 2 2000 binary-search, dp, sortings 1m 26s ✓ D Traveling Graph 2400 bitmasks, graph-matchings, graphs 42s ✓

Practice › LeetCode › LeetCode 06xx ›

LeetCode 668 - Kth Smallest Number in Multiplication Table

LeetCode Problem 668 Difficulty: 🔴 Hard Topics: Math, Binary Search Solution Problem Understanding The problem gives us an m x n multiplication table where each cell contains the product of its row index and column index, using 1-based indexing. That means the value at position (i, j) is simply i * j . For example, when m = 3 and n = 3 , the multiplication table looks like this:...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 625 - Minimum Factorization

LeetCode Problem 625 Difficulty: 🟡 Medium Topics: Math, Greedy Solution Problem Understanding The problem asks us to find the smallest positive integer x such that the product of all of its digits equals the given integer num . In other words, we want to decompose num into a multiplication of decimal digits from 1 to 9 , then arrange those digits to form the numerically smallest possible integer. For example:...

Practice › Codeforces Solutions › Codeforces Beta Round 78 (Div. 1 Only) ›

CF 98E - Help Shrek and Donkey

CF 98E - Help Shrek and Donkey Rating: 2700 Tags: dp, games, math, probabilities Solve time: 2m 25s Verified: yes Solution Problem Understanding There are m + n + 1 distinct cards in total. Shrek initially knows his own m cards, Donkey knows his own n cards, and one card is hidden on the table. Nobody knows the hidden card directly. Players alternate turns, with Shrek moving first. On each...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 507 - Perfect Number

LeetCode Problem 507 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding This problem asks us to determine whether a given positive integer num is a perfect number . A perfect number is defined as a number whose sum of positive divisors, excluding the number itself , equals the number. In other words, we must find all integers that divide num evenly, excluding num , sum them up, and check whether...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1183 - Maximum Number of Ones

LeetCode Problem 1183 Difficulty: 🔴 Hard Topics: Math, Greedy, Sorting, Heap (Priority Queue) Solution LeetCode 1183, Maximum Number of Ones Problem Understanding The problem gives us a binary matrix M with dimensions height x width . Every cell in the matrix must contain either 0 or 1 . There is one important restriction: Every square submatrix of size sideLength x sideLength may contain at most maxOnes cells equal to 1...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 537 - Complex Number Multiplication

LeetCode Problem 537 Difficulty: 🟡 Medium Topics: Math, String, Simulation Solution Problem Understanding This problem asks us to multiply two complex numbers represented as strings and return the result in the same string format. A complex number is written as: "real+imaginaryi" For example: "1+1i" represents $1 + i$ "1+-1i" represents $1 - i$ The input strings always follow a valid format, meaning we do not need to worry about malformed...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1104 - Path In Zigzag Labelled Binary Tree

LeetCode Problem 1104 Difficulty: 🟡 Medium Topics: Math, Tree, Binary Tree Solution Problem Understanding This problem describes an infinite binary tree where nodes are normally arranged level by level, but with a twist in how labels are assigned. In a standard binary tree, nodes in each level are labeled from left to right. Here, the labeling alternates direction depending on the row number. Odd numbered rows, such as row 1,...

Practice › Codeforces Solutions ›

Codeforces Beta Round 92 (Div. 1 Only)

Codeforces Beta Round 92 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1300-2500 | Time: 14m 53s Problem Name Rating Tags Solve Time Verified A Prime Permutation 1300 implementation, number-theory, strings 2m 19s ✗ B Squares 1800 math 5m 4s ✓ C Brackets 2300 combinatorics, dp, greedy 2m 19s ✓ D String 2300 string-suffix-structures 2m 32s ✓ E Maze 2500 dfs-and-similar, dp, probabilities...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 367 - Valid Perfect Square

LeetCode Problem 367 Difficulty: 🟢 Easy Topics: Math, Binary Search Solution Problem Understanding The problem asks us to determine whether a given positive integer num is a perfect square without using built in square root functions such as sqrt() . A perfect square is a number that can be written as: $n = k^2$ where k is an integer. For example, 16 is a perfect square because 4 * 4...

Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117A - Elevator

CF 117A - Elevator Rating: 1300 Tags: implementation, math Solve time: 2m 31s Verified: yes Solution Problem Understanding The elevator follows a completely deterministic cycle. It starts at floor 1 at time 0 , climbs one floor per second until it reaches floor m , then immediately reverses direction and goes back down to floor 1 , again moving one floor per second. After reaching floor 1 , the same...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 964 - Least Operators to Express Number

LeetCode Problem 964 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Memoization Solution Problem Understanding This problem asks us to construct a mathematical expression using only the number x repeatedly, combined with the operators + , - , * , and / , such that the final expression evaluates exactly to target . The challenge is not simply reaching the target value, but doing so with the minimum number of operators....

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76E - Points

CF 76E - Points Rating: 1700 Tags: implementation, math Solve time: 1m 53s Verified: yes Solution Problem Understanding We are given up to one hundred thousand points on a 2D plane. For every unordered pair of points, we must compute the squared Euclidean distance between them and add all those values together. For two points (x1, y1) and (x2, y2) , the squared distance is $(x_1-x_2)^2 + (y_1-y_2)^2$ The task...

Practice › Codeforces Solutions ›

Codeforces Beta Round 73 (Div. 1 Only)

Codeforces Beta Round 73 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1500-2600 | Time: 9m 48s Problem Name Rating Tags Solve Time Verified A Trains 1500 implementation, math 1m 15s ✓ B Vasya and Types 1800 implementation, strings 1m 56s ✓ C Interesting Game 2000 dp, games, math 1m 9s ✓ D Beautiful Road 2300 dfs-and-similar, dp, dsu 2m 12s ✓ E...

Practice › Codeforces Solutions ›

Yandex.Algorithm 2011: Round 2

Yandex.Algorithm 2011: Round 2 Type: Special | Problems: 5 | Verified: 5/5 | Rating range: 1600-2700 | Time: 11m 50s Problem Name Rating Tags Solve Time Verified A Reflection 1600 math 2m 9s ✓ B Tetris revisited 2200 constructive-algorithms, graph-matchings, greedy 2m 5s ✓ C Genetic engineering 2500 dp, string-suffix-structures, trees 2m 12s ✓ D Powerful array 2200 data-structures, implementation, math 3m 46s ✓ E Long sequence 2700 brute-force, math,...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 360 - Sort Transformed Array

LeetCode Problem 360 Difficulty: 🟡 Medium Topics: Array, Math, Two Pointers, Sorting Solution Problem Understanding The problem gives us a sorted integer array nums and a quadratic transformation function: $$f(x) = ax^2 + bx + c$$ We must apply this function to every element in the array and return the transformed values in sorted order. The important detail is that the original array is already sorted in ascending order, but...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1342 - Number of Steps to Reduce a Number to Zero

LeetCode Problem 1342 Difficulty: 🟢 Easy Topics: Math, Bit Manipulation Solution LeetCode 1342, Number of Steps to Reduce a Number to Zero Problem Understanding The problem gives us a non-negative integer num and asks us to compute how many operations are required to reduce it all the way down to 0 . At every step, we apply one of two rules: If the current number is even, divide it by...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 70 - Climbing Stairs

LeetCode Problem 70 Difficulty: 🟢 Easy Topics: Math, Dynamic Programming, Memoization Solution LeetCode 70 - Climbing Stairs Problem Understanding The problem describes a staircase with n total steps. You start at the bottom and want to reach the top. At every move, you are allowed to climb either 1 step or 2 steps. The goal is to determine how many distinct sequences of moves can take you from the bottom...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 679 - 24 Game

LeetCode Problem 679 Difficulty: 🔴 Hard Topics: Array, Math, Backtracking Solution Problem Understanding The problem is asking us to determine whether it is possible to use exactly four numbers, each between 1 and 9 inclusive, to form a mathematical expression that evaluates to exactly 24. The numbers are given in an array called cards of length 4. We can use the four basic arithmetic operations + , - , *...

Practice › Codeforces Solutions › Unknown Language Round 3 ›

CF 100I - Rotation

CF 100I - Rotation Rating: 1500 Tags: *special, geometry, math Solve time: 4m 21s Verified: yes Solution Problem Understanding We are given a point $(x, y)$ on the 2D plane and an angle $k$ in degrees. The task is to rotate the point counter-clockwise around the origin by exactly $k$ degrees and print the coordinates of the new point. A rotation around the origin preserves the distance from the origin...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 372 - Super Pow

LeetCode Problem 372 Difficulty: 🟡 Medium Topics: Math, Divide and Conquer Solution Problem Understanding The problem asks us to compute: $a^b \bmod 1337$ The complication is that the exponent b is extremely large. Instead of being given as a normal integer, it is provided as an array of digits. For example, if: b = [1, 0, 2, 4] then the exponent actually represents the number: 1024 The goal is to...

Practice › Codeforces Solutions › Yandex.Algorithm 2011: Finals ›

CF 97C - Winning Strategy

CF 97C - Winning Strategy Rating: 2400 Tags: binary search, graphs, math, shortest paths Solve time: 1m 44s Verified: yes Solution Problem Understanding Each year the university sends a team of exactly n students to the finals. Some of those students may already have participated once before, and the rest are newcomers. If exactly i members already have previous finals experience, the probability of winning a medal that year is...

Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 1 Only) ›

CF 95D - Horse Races

CF 95D - Horse Races Rating: 2500 Tags: dp, math Solve time: 2m Verified: yes Solution Problem Understanding We are given several intervals of integers. For every interval $[l, r]$, we must count how many numbers contain two lucky digits, either 4 or 7 , whose positions differ by at most k . Positions are counted inside the decimal representation of the number. If two lucky digits appear close enough,...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1823 - Find the Winner of the Circular Game

LeetCode Problem 1823 Difficulty: 🟡 Medium Topics: Array, Math, Recursion, Queue, Simulation Solution Problem Understanding The problem describes a variation of the classic Josephus problem. We have n friends sitting in a circle, numbered 1 through n clockwise. Starting from the first friend, we count k friends clockwise (inclusive of the starting friend). The friend at the k -th position is removed from the circle. The counting then resumes from...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 464 - Can I Win

LeetCode Problem 464 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Bit Manipulation, Memoization, Game Theory, Bitmask Solution LeetCode 464 - Can I Win Problem Understanding This problem describes a two-player turn-based game. Players take turns choosing a number from a shared pool of integers ranging from 1 to maxChoosableInteger . Once a number is chosen, it cannot be used again for the rest of the game. Each chosen number is...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 415 - Add Strings

LeetCode Problem 415 Difficulty: 🟢 Easy Topics: Math, String, Simulation Solution Problem Understanding The problem asks us to add two non-negative integers where each integer is given as a string instead of a numeric type. The goal is to return the resulting sum as another string. For example, if the inputs are "11" and "123" , we should return "134" . The important restriction is that we are not allowed...

Practice › Codeforces Solutions ›

Codeforces Round 933 (Div. 3)

Codeforces Round 933 (Div. 3) Type: Div. 3 | Problems: 7 | Verified: 6/7 | Rating range: 800-2000 | Time: 12m 58s Problem Name Rating Tags Solve Time Verified A Rudolf and the Ticket 800 brute-force, math 1m 23s ✓ B Rudolf and 121 1000 brute-force, dp, greedy 2m 47s ✓ C Rudolf and the Ugly String 900 dp, greedy, strings 2m 41s ✓ D Rudolf and the Ball Game...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 202 - Happy Number

LeetCode Problem 202 Difficulty: 🟢 Easy Topics: Hash Table, Math, Two Pointers Solution Problem Understanding This problem asks us to determine whether a given positive integer n is a happy number . A happy number is defined through a repeated transformation process. Starting with the original number, we repeatedly replace it with the sum of the squares of its digits . Eventually, one of two things happens: The number becomes...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 13 - Roman to Integer

LeetCode Problem 13 Difficulty: 🟢 Easy Topics: Hash Table, Math, String Solution Problem Understanding The problem gives a Roman numeral string and asks us to convert it into its corresponding integer value. Roman numerals use seven symbols: Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 Most Roman numerals follow a simple additive rule. Symbols are written from largest to smallest, and we...

Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941A - Rudolf and the Ticket

CF 1941A - Rudolf and the Ticket Rating: 800 Tags: brute force, math Solve time: 1m 23s Verified: yes Solution Problem Understanding The problem gives us two arrays of coin values. The first array represents coins in Rudolf's left pocket, and the second array represents coins in his right pocket. Rudolf must choose exactly one coin from each pocket, meaning we need to consider every possible pair formed by one...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 204 - Count Primes

LeetCode Problem 204 Difficulty: 🟡 Medium Topics: Array, Math, Enumeration, Number Theory Solution Problem Understanding The problem asks us to count how many prime numbers exist that are strictly smaller than a given integer n . A prime number is a positive integer greater than 1 that has exactly two divisors: 1 and itself. Examples of prime numbers include 2 , 3 , 5 , 7 , and 11 ....

Practice › LeetCode › LeetCode 00xx ›

LeetCode 2 - Add Two Numbers

LeetCode Problem 2 Difficulty: 🟡 Medium Topics: Linked List, Math, Recursion Solution Add Two Numbers Problem Understanding The problem gives us two non empty singly linked lists. Each linked list represents a non negative integer, but the digits are stored in reverse order. That means the head node contains the least significant digit. For example: [2,4,3] represents the number 342 [5,6,4] represents the number 465 The task is to add...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 7 - Reverse Integer

LeetCode Problem 7 Difficulty: 🟡 Medium Topics: Math Solution Problem Understanding The problem asks us to reverse the digits of a signed 32-bit integer. Given an integer x , we must return a new integer whose digits appear in reverse order while preserving the sign. For example, if the input is 123 , reversing the digits produces 321 . If the input is -123 , the reversed result becomes -321...

Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941B - Rudolf and 121

CF 1941B - Rudolf and 121 Rating: 1000 Tags: brute force, dp, greedy, math Solve time: 2m 47s Verified: yes Solution Problem Understanding We are given an array of non-negative integers. In one operation, we choose an index $i$ such that $2 \le i \le n-1$, and decrease three consecutive elements in the following way: $$a_{i-1} \mathrel{-}= 1,\quad a_i \mathrel{-}= 2,\quad a_{i+1} \mathrel{-}= 1$$ The operation may be used any...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 9 - Palindrome Number

LeetCode Problem 9 Difficulty: 🟢 Easy Topics: Math Solution Problem Understanding The problem asks us to determine whether a given integer reads the same forward and backward. Such numbers are called palindromes. For example, the number 121 is a palindrome because reversing its digits still produces 121 . On the other hand, 123 is not a palindrome because reversing it produces 321 . The input consists of a single integer...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1067: Digit Count in Range

Problem Restatement We are given a digit d (0-9) and a range [low, high] . Return the number of times digit d appears in all integers in [low, high] . The official constraints state that 0 <= d <= 9 and 1 <= low <= high <= 2 * 10^8 . Input and Output Item Meaning Input Digit d , range [low, high] Output Total occurrences of d in all...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1037: Valid Boomerang

Problem Restatement We are given three points in the 2D plane: points[0] , points[1] , points[2] . A boomerang is a set of three points that are all distinct and not collinear. Return true if the three points form a boomerang. The official constraints state that points.length == 3 and 0 <= points[i][j] <= 100 . Input and Output Item Meaning Input Three 2D points [[x1,y1],[x2,y2],[x3,y3]] Output true if points...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1012: Numbers With Repeated Digits

Problem Restatement We are given an integer n . We need to return the count of positive integers up to n (inclusive) that have at least one repeated digit. The official constraints state that 1 <= n <= 10^9 . Input and Output Item Meaning Input Integer n Output Count of integers in [1, n] with at least one repeated digit Function shape: def numDupDigitsAtMostN(n: int) -> int: ... Examples...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1073: Adding Negative Numbers

Problem Restatement We are given two arrays arr1 and arr2 representing two non-positive integers in base 10. Each array has -1 as the first element (sign) followed by the digits. We need to return the sum of the two numbers, also in the same format. The official constraints are similar to LeetCode 66 (Plus One) but for non-positive integers. Input and Output Item Meaning Input Two arrays representing negative integers...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1058: Minimize Rounding Error to Meet Target

Problem Restatement We are given an array of price strings (floating-point) and an integer target . We must round each price either up ( ceil ) or down ( floor ). We need the rounded prices to sum exactly to target . Return the minimum total rounding error, or "-1" if it is impossible. The official constraints state that 1 <= prices.length <= 500 . Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1025: Divisor Game

Problem Restatement Alice and Bob play a game. They start with the number n . On each turn, the current player chooses a number x such that: 0 < x < n n % x == 0 Then n is replaced by n - x . The player who cannot make a move loses. Alice always goes first. Both players play optimally. Return true if Alice wins, false if Bob...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1071: Greatest Common Divisor of Strings

Problem Restatement We say string t divides string s if s is formed by concatenating t one or more times. We are given two strings str1 and str2 . Return the largest string t that divides both str1 and str2 . The official constraints state that 1 <= str1.length, str2.length <= 1000 . Input and Output Item Meaning Input Strings str1 and str2 Output Largest common divisor string Function shape:...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1056: Confusing Number

Problem Restatement A confusing number is a number that when rotated 180 degrees becomes a different valid number. The valid rotations are: 0 → 0 , 1 → 1 , 6 → 9 , 8 → 8 , 9 → 6 . Digits 2 , 3 , 4 , 5 , 7 are invalid — rotating them produces no valid digit. We are given a number n . Return true...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1085: Sum of Digits in the Minimum Number

Problem Restatement We are given an integer array A . Let S be the sum of the digits of the minimum element of A . Return 0 if S is odd, and 1 if S is even. The official constraints state that 1 <= A.length <= 100 and 1 <= A[i] <= 100 . Input and Output Item Meaning Input Array A Output 1 if digit sum of minimum is...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1017: Convert to Base -2

Problem Restatement We are given a non-negative integer n . We need to return its representation in base -2 as a string (without leading zeros unless the answer is "0" ). In base -2 , each digit is 0 or 1 , and the place values are (-2)^0 = 1 , (-2)^1 = -2 , (-2)^2 = 4 , (-2)^3 = -8 , and so on. The official constraints state...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1030: Matrix Cells in Distance Order

Problem Restatement We are given an rows x cols matrix and a center cell (rCenter, cCenter) . We need to return all cells of the matrix sorted by their distance from the center, where distance is defined as: abs(r - rCenter) + abs(c - cCenter) (Manhattan distance). Ties can be broken in any order. The official constraints state that 1 <= rows, cols <= 100 and 0 <= rCenter <...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1088: Confusing Number II

Problem Restatement A confusing number rotated 180 degrees gives a different valid number (see LeetCode 1056). Valid digit rotations: 0→0 , 1→1 , 6→9 , 8→8 , 9→6 . We are given a positive integer n . Count all confusing numbers in [1, n] . The official constraints state that 1 <= n <= 10^9 . Input and Output Item Meaning Input Integer n Output Count of confusing numbers in...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1015: Smallest Integer Divisible by K

Problem Restatement We need to find the smallest positive integer N consisting only of the digit 1 (a repunit) such that N is divisible by k . In other words, find the smallest n such that: N = 111...1 (n ones) N % k == 0 Return n , or -1 if no such positive integer exists. The official constraints state that 1 <= k <= 10^5 . Input and...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1040: Moving Stones Until Consecutive II

Problem Restatement We have n stones at distinct positions on an infinite line. In one move, we pick the leftmost or rightmost stone and move it to any unoccupied position between the leftmost and rightmost stones. We need to return [min_moves, max_moves] . The official constraints state that 3 <= stones.length <= 10^4 and 1 <= stones[i] <= 10^9 . Input and Output Item Meaning Input Array stones (distinct positions)...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1006: Clumsy Factorial

Problem Restatement The clumsy factorial of a positive integer n is defined as follows: Start from n and apply operators * , / , + , - in a fixed cyclic order, descending through integers. For example, clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1 . Division is integer division truncated toward zero. We need to return...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1093: Statistics from a Large Sample

Problem Restatement We are given a sample of integers. The sample is represented as a count array count where count[k] is the number of times integer k appears. We need to compute: minimum : the minimum value in the sample. maximum : the maximum value in the sample. mean : the average value, as a floating-point number. median : the middle value (or average of two middle values if even...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1041: Robot Bounded In Circle

Problem Restatement A robot starts at the origin facing north and follows a sequence of instructions: 'G' : move one step forward. 'L' : turn left 90 degrees. 'R' : turn right 90 degrees. We need to determine if the robot stays within a bounded circle (i.e., the robot's path is bounded) when the instructions are repeated indefinitely. The official constraints state that 1 <= instructions.length <= 100 . Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1033: Moving Stones Until Consecutive

Problem Restatement Three stones are at positions a , b , c on a number line where a < b < c . In one move, we pick the leftmost or rightmost stone and move it to an open position between the other two stones. We need to return an array of two integers: result[0] : minimum number of moves. result[1] : maximum number of moves. The official constraints state...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 973: K Closest Points to Origin

Problem Restatement We are given an array points , where each item is a point on the 2D plane: [x, y] We are also given an integer k . Return the k points closest to the origin: (0, 0) The distance is Euclidean distance. The answer may be returned in any order, and the answer is guaranteed to be unique except for order. The official constraints are 1 <= k...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 972: Equal Rational Numbers

Problem Restatement We are given two strings s and t . Each string represents a non-negative rational number. A number may be written in one of these forms: "123" "123.456" "123.456(789)" Parentheses mark the repeating decimal part. Return true if both strings represent the same rational number. Otherwise, return false . Examples of equivalent forms: "0.1(6)" == "0.1666(6)" "0.9(9)" == "1." The official note says the integer part length is...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 970: Powerful Integers

Problem Restatement We are given three integers: x y bound An integer is powerful if it can be written as: x ** i + y ** j where: i >= 0 j >= 0 Return all powerful integers less than or equal to bound . Each value should appear at most once, and the answer may be returned in any order. The constraints are 1 <= x, y <= 100...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 899: Orderly Queue

Problem Restatement We are given a string s and an integer k . In one operation: Choose one of the first k characters of s . Remove it from its current position. Append it to the end of the string. Return the lexicographically smallest string we can get after any number of operations. Input and Output Item Meaning Input String s Input Integer k Output Lexicographically smallest reachable string Operation...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 920: Number of Music Playlists

Problem Restatement We have n different songs. We need to create a playlist of length goal . The playlist must satisfy two rules: Rule Meaning Use every song Each of the n songs must appear at least once Replay restriction A song can be replayed only after at least k other songs have been played Return the number of valid playlists modulo: 10**9 + 7 The official problem asks for...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 964: Least Operators to Express Number

Problem Restatement We are given two integers: x target We may build expressions using only the number x and the operators: + - * / Division is real division, and standard operator precedence applies. We cannot use unary negation. So: -x is not allowed directly. We want to express target using the minimum number of operators. Return that minimum number. The official constraints are: Constraint Value 2 <= x <=...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 800: Similar RGB Color

Problem Restatement We are given a color string in this format: "#ABCDEF" The color has three hexadecimal components: Component Meaning AB Red CD Green EF Blue A color has shorthand form if each component has two equal hexadecimal digits. For example: "#AABBCC" can be written as: "#ABC" because: AA -> A BB -> B CC -> C We need to return a 7-character color string that has shorthand form and...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 775: Global and Local Inversions

Problem Restatement We are given an array nums . The array is a permutation of all integers from 0 to n - 1 . A global inversion is a pair of indices (i, j) such that: i < j nums[i] > nums[j] A local inversion is an index i such that: nums[i] > nums[i + 1] Return True if the number of global inversions is equal to the number of...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 963: Minimum Area Rectangle II

Problem Restatement We are given a list of unique points in the x-y plane. Each point is: [x, y] We need to find the minimum area of any rectangle formed by four of these points. The rectangle sides do not need to be parallel to the axes. A rotated rectangle is allowed. If no rectangle can be formed, return 0 . Answers within 10^-5 of the actual answer are accepted....

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 869: Reordered Power of 2

Problem Restatement We are given a positive integer n . We may reorder its digits in any way. The reordered number: Cannot have leading zeroes. Must use exactly the same digits. We need to return True if some reordering forms a power of two. Otherwise, return False . Input and Output Item Meaning Input Positive integer n Output True if some digit reordering forms a power of two Constraint No...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 818: Race Car

Problem Restatement We have a race car on an infinite number line. The car starts at: position = 0 speed = 1 There are two possible instructions. Instruction Effect "A" position += speed , then speed *= 2 "R" If speed is positive, set speed to -1 ; otherwise set speed to 1 The "R" instruction changes only the direction and resets speed magnitude to 1 . It does not...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 991: Broken Calculator

Problem Restatement We are given two integers: startValue target A broken calculator starts by displaying startValue . It supports only two operations: Operation Effect Double Multiply the current number by 2 Decrement Subtract 1 from the current number We need to return the minimum number of operations needed to display target . The official constraints are: Constraint Value startValue 1 <= startValue <= 10^9 target 1 <= target <= 10^9...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 892: Surface Area of 3D Shapes

Problem Restatement We are given an n x n grid. Each value: grid[i][j] represents a tower of grid[i][j] unit cubes placed on cell (i, j) . After placing the cubes, directly adjacent cubes are glued together. We need to return the total exposed surface area of the resulting 3D shape. The bottom face counts as part of the surface area. LeetCode defines each cube as 1 x 1 x 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 50: Pow(x, n)

Problem Restatement We need to implement pow(x, n) . Given a floating-point number x and an integer n , return x raised to the power n . The official problem asks us to calculate x raised to n , written as x^n . Example inputs include x = 2.00000, n = 10 , which returns 1024.00000 , and x = 2.00000, n = -2 , which returns 0.25000 . For...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 891: Sum of Subsequence Widths

Problem Restatement We are given an integer array nums . For any non-empty subsequence, its width is: maximum value - minimum value Return the sum of widths of all non-empty subsequences. Because the answer can be very large, return it modulo: 10**9 + 7 A subsequence is formed by deleting zero or more elements without changing the order of the remaining elements. The problem asks for the sum of widths...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 866: Prime Palindrome

Problem Restatement We are given an integer n . We need to return the smallest integer greater than or equal to n that is both: Prime A palindrome A prime number has exactly two divisors: 1 and itself A palindrome reads the same from left to right and right to left. For example: 101 131 929 The answer is guaranteed to exist in the range: [2, 2 * 10^8] Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 770: Basic Calculator IV

Problem Restatement We are given an algebraic expression as a string. The expression may contain: integers variables + - * parentheses We are also given some variable values through: evalvars evalints For example: evalvars = ["e"] evalints = [1] means: e = 1 We need to simplify the expression after substituting known variables. The result should be returned as a list of string terms. The official format requires variable factors...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 793: Preimage Size of Factorial Zeroes Function

Problem Restatement Define: f(x) as the number of trailing zeroes in: x! We are given an integer k . We need to return how many integers x satisfy: f(x) == k This count is called the size of the preimage of k . Input and Output Item Meaning Input Integer k Output Number of integers x such that f(x) == k f(x) Number of trailing zeroes in x! Important property...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 48: Rotate Image

Problem Restatement We are given an n x n matrix representing an image. We need to rotate the matrix by 90 degrees clockwise. The rotation must be done in-place. That means we must modify the input matrix directly and must not allocate another matrix for the rotated result. The official problem states this in-place requirement directly. Example: matrix = [ [1, 2, 3], [4, 5, 6], [7, 8, 9], ]...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 989: Add to Array-Form of Integer

Problem Restatement We are given an integer num in array form. That means each element of num is one digit, ordered from most significant to least significant. For example: num = [1, 3, 2, 1] represents: 1321 We are also given an integer k . We need to return the array-form of: num + k The official constraints include 1 <= num.length <= 10^4 , each digit is between 0...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 625: Minimum Factorization

Problem Restatement We are given a positive integer num . We need to find the smallest positive integer x such that the product of the digits of x equals num . If no such integer exists, return 0 . If the answer does not fit in a 32-bit signed integer, return 0 . The official examples are: num = 48 Output: 68 because: 6 * 8 == 48 Another example:...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 43: Multiply Strings

Problem Restatement We are given two non-negative integers num1 and num2 , but they are stored as strings. We need to return their product, also as a string. We cannot use a built-in big integer library, and we cannot directly convert the whole input strings into integers. The official problem states this string multiplication requirement and restriction directly. Example: num1 = "2" num2 = "3" The product is: "6" Another...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 790: Domino and Tromino Tiling

Problem Restatement We are given an integer n . We need to count how many ways there are to tile a 2 x n board using two tile types: Tile Shape Domino Covers 2 squares in a straight line Tromino Covers 3 squares in an L shape Both tile types may be rotated. Return the number of tilings modulo: 10**9 + 7 Every square must be covered exactly once. Two...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 789: Escape The Ghosts

Problem Restatement We start at point: [0, 0] We want to reach: target = [target_x, target_y] There are several ghosts. Each ghost starts at: ghosts[i] = [ghost_x, ghost_y] Each turn, we and all ghosts may move one step north, south, east, or west. Everyone moves at the same speed. We escape only if we reach the target before any ghost can reach us. If we and a ghost arrive at...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 914: X of a Kind in a Deck of Cards

Problem Restatement We are given an integer array deck . Each value represents the number written on one card. We need to decide whether we can split the entire deck into groups such that: Rule Meaning Same group size Every group has exactly x cards Minimum group size x > 1 Same card value All cards in one group have the same integer Return True if such a partition is...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 888: Fair Candy Swap

Problem Restatement Alice and Bob each have several candy boxes. aliceSizes[i] is the number of candies in Alice's i th box. bobSizes[j] is the number of candies in Bob's j th box. They want to exchange exactly one box each so that after the swap, they have the same total number of candies. Return: [alice_box, bob_box] where alice_box is the size of the box Alice gives to Bob, and bob_box...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 788: Rotated Digits

Problem Restatement We are given an integer n . We need to count how many integers x in the range: 1 <= x <= n are good numbers. A number is good if, after rotating every digit by 180 degrees, we get: A valid number. A different number from the original. The valid digit rotations are: Digit Rotates to 0 0 1 1 2 5 5 2 6 9 8...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 837: New 21 Game

Problem Restatement Alice starts with 0 points. While her score is less than k , she keeps drawing a random number from 1 to maxPts . Each draw is independent, and every number from 1 to maxPts has the same probability. Alice stops drawing as soon as her score is at least k . Return the probability that Alice ends with n or fewer points. Answers within 10^-5 of the...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 738: Monotone Increasing Digits

Problem Restatement We are given a non-negative integer n . We need to return the largest integer less than or equal to n whose digits are monotone increasing. A number has monotone increasing digits when every adjacent digit pair satisfies: left_digit <= right_digit For example: 1234 is valid 1119 is valid 332 is not valid The official constraint is: 0 <= n <= 10^9 Input and Output Item Meaning Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 887: Super Egg Drop

Problem Restatement We are given k identical eggs and a building with n floors. There is some unknown floor f such that: Drop floor Result Floor <= f Egg does not break Floor > f Egg breaks We need to determine the exact value of f . Each move lets us drop one unbroken egg from any floor. If the egg breaks, it cannot be used again. If it does...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 836: Rectangle Overlap

Problem Restatement We are given two axis-aligned rectangles, rec1 and rec2 . Each rectangle is represented as: [x1, y1, x2, y2] where: Coordinate Meaning (x1, y1) Bottom-left corner (x2, y2) Top-right corner We need to return True if the two rectangles overlap. Overlap means their intersection has positive area. If two rectangles only touch at an edge or corner, they do not overlap. Input and Output Item Meaning Input Two...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 650: 2 Keys Keyboard

Problem Restatement We start with one character: "A" We can perform two operations: Operation Meaning Copy All Copy the entire current text Paste Paste the copied text We need to produce exactly n characters "A" using the minimum number of operations. Return that minimum number. The initial "A" already exists and does not count as an operation. Input and Output Item Meaning Input Integer n Output Minimum operations needed to...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 812: Largest Triangle Area

Problem Restatement We are given an array of unique points on the X-Y plane. Each point is written as: [x, y] We need to choose any three different points and form a triangle. Return the largest possible triangle area. Answers within 10^-5 of the actual answer are accepted. The constraints are small: 3 <= points.length <= 50 , and each coordinate is between -50 and 50 . Input and Output...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 762: Prime Number of Set Bits in Binary Representation

Problem Restatement We are given two integers: left right We need to count how many integers x in the inclusive range: left <= x <= right have a prime number of set bits in their binary representation. A set bit is a bit equal to 1 . For example: 21 = 10101 The binary representation of 21 has three 1 bits. Since 3 is prime, 21 should be counted. Also,...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 710: Random Pick with Blacklist

Problem Restatement We need to design a class that randomly returns an integer from the range: [0, n - 1] Some values are blacklisted and cannot be returned. Every allowed value must have the same probability. The class supports: Operation Meaning Solution(n, blacklist) Initialize the picker pick() Return a uniformly random allowed value The challenge is to make pick() efficient. Input and Output Item Meaning Input Integer n Input Array...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 810: Chalkboard XOR Game

Problem Restatement We are given an array nums of non-negative integers written on a chalkboard. Alice and Bob take turns erasing exactly one number. Alice moves first. After a player erases a number, if the XOR of all remaining numbers becomes 0 , that player loses. There is one special rule: if a player starts their turn and the XOR of all numbers is already 0 , that player wins...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 645: Set Mismatch

Problem Restatement We are given an array nums of length n . Originally, the array should contain every number from 1 to n exactly once. But an error happened: Error Meaning One number appears twice This is the duplicate number One number is missing This is the missing number We need to return: [duplicate, missing] in that exact order. The official examples include nums = [1, 2, 2, 4] ,...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 672: Bulb Switcher II

Problem Restatement There are n bulbs labeled from 1 to n . All bulbs are initially on. There are four buttons: Button Operation Button 1 Flip all bulbs Button 2 Flip bulbs with even labels Button 3 Flip bulbs with odd labels Button 4 Flip bulbs with labels 3k + 1 , such as 1, 4, 7, 10, ... We must press buttons exactly presses times. For each press, we...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 908: Smallest Range I

Problem Restatement We are given an integer array nums and an integer k . For each index, we may change nums[i] by adding some integer x , where: -k <= x <= k Each index can be changed at most once. After the changes, the score of the array is: max(nums) - min(nums) Return the minimum possible score. The official examples include [0, 10] with k = 2 , where...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 670: Maximum Swap

Problem Restatement We are given a non-negative integer num . We may swap two digits at most once. Return the maximum possible value we can get after doing zero or one swap. The official statement asks us to swap two digits at most once to get the maximum valued number. Input and Output Item Meaning Input A non-negative integer num Output The maximum integer possible after at most one digit...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 640: Solve the Equation

Problem Restatement We are given a linear equation as a string. The equation contains: Token Meaning x The variable integers Constant terms or coefficients + and - Operations = Separates left and right sides We need to solve for x . Return one of three possible answers: Case Return Exactly one solution "x=#value" No solution "No solution" Infinite solutions "Infinite solutions" If there is exactly one solution, the problem guarantees...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 858: Mirror Reflection

Problem Restatement We have a square room with mirrored walls. The side length of the room is p . A laser starts from the southwest corner. It first hits the east wall at a distance q from receptor 0 . There are three receptors: Receptor Corner 0 Southeast corner 1 Northeast corner 2 Northwest corner The southwest corner has no receptor. The laser reflects from the mirrors until it reaches...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 932: Beautiful Array

Problem Restatement We are given an integer n . We need to return any array nums of length n such that: nums is a permutation of integers from 1 to n . For every i < j , there is no index k with i < k < j such that: 2 * nums[k] == nums[i] + nums[j] In other words, no middle-position value may be the arithmetic average of...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 668: Kth Smallest Number in Multiplication Table

Problem Restatement We are given three integers m , n , and k . Imagine an m x n multiplication table where each cell is: table[i][j] = i * j using 1-based indexing. We need to return the k th smallest number in this multiplication table. The table may contain duplicates, and duplicates count separately. For example, in a 3 x 3 table: 1 2 3 2 4 6 3...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 782: Transform to Chessboard

Problem Restatement We are given an n x n binary board. Each cell is either 0 or 1 . In one move, we may do one of these operations: Move Meaning Swap two rows Exchange any two complete rows Swap two columns Exchange any two complete columns We need to return the minimum number of moves required to transform the board into a chessboard. A chessboard means no two 4-directionally...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 634: Find the Derangement of An Array

Problem Restatement We are given an integer n . We need to count how many permutations of the numbers: [1, 2, 3, ..., n] have no fixed positions. A fixed position means: perm[i] == i for some index. A permutation with no fixed positions is called a derangement. Because the answer can be very large, return it modulo: 10**9 + 7 Input and Output Item Meaning Input Integer n Output...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 781: Rabbits in Forest

Problem Restatement We are given an array answers . Each value answers[i] is the answer from one rabbit. If a rabbit says x , it means: There are x other rabbits with the same color as me. So that rabbit belongs to a color group of size: x + 1 We need to return the minimum possible number of rabbits in the forest. Some rabbits in the forest may not...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 906: Super Palindromes

Problem Restatement A positive integer is called a super-palindrome if: The number itself is a palindrome. It is the square of another palindrome. We are given two positive integers left and right as strings. Return how many super-palindromes are in the inclusive range: [left, right] For example, 9 is a super-palindrome because: 9 = 3 * 3 and both 9 and 3 are palindromes. The official problem uses string inputs...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 633: Sum of Square Numbers

Problem Restatement We are given a non-negative integer c . We need to determine whether there exist two integers a and b such that: a * a + b * b == c If such integers exist, return True . Otherwise, return False . Input and Output Item Meaning Input A non-negative integer c Output True if c = a² + b² for some integers a and b , otherwise...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 880: Decoded String at Index

Problem Restatement We are given an encoded string s and an integer k . The string is decoded from left to right using these rules: Character Meaning Letter Append the letter to the tape Digit d Repeat the entire current tape d - 1 more times Return the k th character of the final decoded string, using 1-based indexing. The decoded string can be extremely large, so we must not...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 780: Reaching Points

Problem Restatement We are given four integers: sx, sy, tx, ty The starting point is: (sx, sy) The target point is: (tx, ty) From any point (x, y) , we may perform one of two moves: (x, y) -> (x + y, y) (x, y) -> (x, x + y) Return True if we can reach (tx, ty) from (sx, sy) . Otherwise, return False . Input and Output Item...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 829: Consecutive Numbers Sum

Problem Restatement We are given a positive integer n . We need to count how many different ways n can be written as the sum of consecutive positive integers. For example: 15 = 15 15 = 7 + 8 15 = 4 + 5 + 6 15 = 1 + 2 + 3 + 4 + 5 So the answer for 15 is: 4 Input and Output Item Meaning Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 805: Split Array With Same Average

Problem Restatement We are given an integer array nums . We need to split every element into one of two arrays, A and B , such that: A is non-empty B is non-empty average(A) == average(B) Return True if such a split is possible. Otherwise, return False . The array length is at most 30 , and each value is between 0 and 10000 . The official examples include nums...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 779: K-th Symbol in Grammar

Problem Restatement We build a table of rows. The first row is: 0 To build the next row, every symbol is replaced: Symbol Becomes 0 01 1 10 So the first few rows are: row 1: 0 row 2: 01 row 3: 0110 row 4: 01101001 Given integers n and k , return the k -th symbol in row n . The position k is 1-indexed. Input and Output Item...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 612: Shortest Distance in a Plane

Problem Restatement We are given a table called Point2D . Each row represents one point in a 2D plane. Column Type Meaning x decimal x-coordinate y decimal y-coordinate We need to find the shortest Euclidean distance between any two distinct points. The result should contain one column: Column Meaning shortest Minimum distance between any pair of points The final answer should be rounded to two decimal places. The official problem...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 754: Reach a Number

Problem Restatement We start at position 0 on an infinite number line. There is a destination at position target . On move 1 , we must move exactly 1 step. On move 2 , we must move exactly 2 steps. On move 3 , we must move exactly 3 steps. In general, on move i , we must move exactly i steps. For every move, we can choose either direction:...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 679: 24 Game

Problem Restatement We are given exactly four cards. Each card contains an integer from 1 to 9 . We need to decide whether we can arrange all four numbers into a mathematical expression that evaluates to 24 . We may use: Allowed item Meaning + Addition - Subtraction * Multiplication / Real division Parentheses Control operation order There are also important restrictions: Rule Meaning Use every card exactly once All...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 878: Nth Magical Number

Problem Restatement A positive integer is called magical if it is divisible by either a or b . Given three integers n , a , and b , return the n th magical number. Because the answer can be very large, return it modulo: 10**9 + 7 The constraints are large: n can be up to 10^9 , while a and b can be up to 4 * 10^4 ....

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 660: Remove 9

Problem Restatement We imagine the positive integers after removing every number that contains the digit 9 . The remaining sequence begins like this: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, ... Notice that: 9 19 29 90 ... are all removed because they contain digit 9 . We are given an integer n . Return the n th positive integer in the filtered sequence. Input and...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 523: Continuous Subarray Sum

Problem Restatement We are given: nums k We need to determine whether there exists a continuous subarray of length at least 2 whose sum is a multiple of k . That means we need some subarray sum satisfying: $$ subarray_sum = n \cdot k $$ for some integer n . Equivalently: $$ subarray_sum \bmod k = 0 $$ The official problem asks whether such a subarray exists, with the subarray...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 610: Triangle Judgement

Problem Restatement We are given a table called Triangle . Each row contains three integer side lengths: Column Type Meaning x int First side length y int Second side length z int Third side length For each row, we need to report whether the three side lengths can form a valid triangle. The result should contain the original side lengths and a new column called triangle , whose value is...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 598: Range Addition II

Problem Restatement We are given an m x n matrix initialized with all zeroes. We are also given a list of operations ops . Each operation has the form: [a, b] This means we increment every cell (x, y) where: 0 <= x < a 0 <= y < b In other words, each operation increments a rectangle starting from the top-left corner. After performing all operations, return the number...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 573: Squirrel Simulation

Problem Restatement We are given a garden grid with a tree, a squirrel, and several nuts. The squirrel must collect all nuts and put them under the tree one by one. The squirrel can carry at most one nut at a time. It can move one cell at a time in four directions: up, down, left, and right. Return the minimum total distance the squirrel must move. The problem gives...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 593: Valid Square

Problem Restatement We are given four points in 2D space: p1, p2, p3, p4 Each point is represented as: [x, y] We need to return True if these four points form a valid square. The points are not given in any particular order. A valid square has four equal sides with positive length and four right angles. The coordinates satisfy -10^4 <= x_i, y_i <= 10^4 . ( leetcode.com ,...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 592: Fraction Addition and Subtraction

Problem Restatement We are given a string expression representing additions and subtractions of fractions. Each fraction has the form: numerator/denominator A fraction may have a leading + or - . We need to evaluate the whole expression and return the final result as an irreducible fraction string. If the result is an integer, we still return it with denominator 1 . For example: 2 must be returned as: "2/1" The...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 509: Fibonacci Number

Problem Restatement The Fibonacci sequence is defined as: F(0) = 0 F(1) = 1 For all n > 1 : $$ F(n)=F(n-1)+F(n-2) $$ We are given an integer n . We need to return the value of F(n) . The official problem asks us to compute the n th Fibonacci number using the standard recurrence definition. Input and Output Item Meaning Input An integer n Output The n th Fibonacci...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 629: K Inverse Pairs Array

Problem Restatement We are given two integers n and k . We need to count how many different arrays can be formed using the numbers from 1 to n exactly once, such that the array has exactly k inverse pairs. An inverse pair is a pair of indices (i, j) where: i < j and nums[i] > nums[j] Because the answer can be very large, return it modulo: 10**9 +...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 564: Find the Closest Palindrome

Problem Restatement We are given a string n representing an integer. Return the closest integer palindrome to n . The returned palindrome must not be n itself. If there are two palindromes with the same distance from n , return the smaller one. The input length is at most 18 , so the number can be too large for some fixed-width integer languages, but Python can handle it directly. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 507: Perfect Number

Problem Restatement A positive integer is called a perfect number if the sum of its positive divisors excluding itself equals the number. We are given an integer num . We need to determine whether num is a perfect number. The official problem defines a perfect number as a positive integer equal to the sum of all its positive divisors excluding itself. Input and Output Item Meaning Input An integer num...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 728: Self Dividing Numbers

Problem Restatement We are given two integers, left and right . We need to return all self-dividing numbers in the inclusive range: [left, right] A self-dividing number is divisible by every digit it contains. For example, 128 is self-dividing because: 128 % 1 == 0 128 % 2 == 0 128 % 8 == 0 A self-dividing number cannot contain the digit 0 , because division by zero is not...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 628: Maximum Product of Three Numbers

Problem Restatement We are given an integer array nums . We need to choose three numbers from the array so that their product is as large as possible. Return that maximum product. The three numbers do not need to be next to each other. We only care about choosing any three different elements. Input and Output Item Meaning Input An integer array nums Output The maximum product of any three...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 504: Base 7

Problem Restatement We are given an integer num . We need to return its representation in base 7 as a string. The official problem asks us to convert an integer from base 10 into base 7. Negative numbers should keep the negative sign. Input and Output Item Meaning Input An integer num Output A string Goal Return the base 7 representation of num Function shape: class Solution: def convertToBase7(self, num:...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 952: Largest Component Size by Common Factor

Problem Restatement We are given an array nums of unique positive integers. Each number is a node in a graph. There is an undirected edge between two numbers if they share a common factor greater than 1 . Return the size of the largest connected component in this graph. For example, 6 and 15 are connected because they share factor 3 . The constraints are: Constraint Value nums.length 1 <=...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 902: Numbers At Most N Given Digit Set

Problem Restatement We are given: A set of allowed digits as strings. An integer n . We may use the given digits any number of times to build positive integers. We need to count how many numbers are less than or equal to n . For example: digits = ["1", "3", "5", "7"] n = 100 Valid numbers include: 1, 3, 5, 7, 11, 13, 15, 17, 31, 33, ......

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 537: Complex Number Multiplication

Problem Restatement We are given two strings representing complex numbers. The format is: "real+imaginaryi" For example: "1+1i" represents: 1 + i We need to multiply the two complex numbers and return the result in the same string format. The imaginary unit satisfies: i^2 = -1 Input and Output Item Meaning Input Two strings representing complex numbers Output Their product as a complex-number string Format "a+bi" Values Integers, possibly negative Function...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 651: 4 Keys Keyboard

Problem Restatement We have a special keyboard with four operations: Key Operation A Print one A on the screen Ctrl-A Select all text on the screen Ctrl-C Copy the selected text into a buffer Ctrl-V Paste the buffer after the current text Given an integer n , we can press keys at most n times. Return the maximum number of A characters we can print on the screen. The problem...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 556: Next Greater Element III

Problem Restatement We are given a positive integer n . We need to rearrange its digits to form the smallest integer that is greater than n . The new integer must use exactly the same digits as n . If no greater integer can be formed, return -1 . If the answer is greater than the 32-bit signed integer limit, return -1 . The official constraint is: 1 <= n...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 553: Optimal Division

Problem Restatement We are given an integer array nums . The numbers are used in order, with division between adjacent numbers. For example, if: nums = [2, 3, 4] then the default expression is: "2/3/4" Division is evaluated from left to right unless parentheses change the order. We may add parentheses anywhere to change the evaluation order. Our goal is to return the expression with the maximum possible value. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 400: Nth Digit

Problem Restatement We are given an integer n . Consider the infinite sequence formed by writing positive integers one after another: 123456789101112131415... We need to return the n th digit in this sequence. The position is 1-indexed. For example: n = 3 The third digit is 3 . For: n = 11 The sequence begins: 12345678910... The 11th digit is 0 , from the number 10 . Input and Output...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 398: Random Pick Index

Problem Restatement We are given an integer array nums . The array may contain duplicate values. We need to implement a class with one operation: pick(target) This operation returns a random index i such that: nums[i] == target If the target appears at multiple indices, each valid index must have equal probability of being returned. The problem guarantees that target exists in nums . The constraints allow nums.length <= 2...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 470: Implement Rand10() Using Rand7()

Problem Restatement We are given an API: rand7() It returns a uniformly random integer from 1 to 7 . We need to implement: rand10() It must return a uniformly random integer from 1 to 10 . We may only call rand7() . We should not use any other random API. The official problem asks for a uniform random integer in [1, 10] using only rand7() . Input and Output Item...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 397: Integer Replacement

Problem Restatement We are given a positive integer n . We need to turn n into 1 using the fewest operations. The allowed operations are: Case Operation n is even Replace n with n / 2 n is odd Replace n with either n + 1 or n - 1 Return the minimum number of operations needed. For example: n = 8 The best path is: 8 -> 4 ->...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 372: Super Pow

Problem Restatement We are given: Variable Meaning a Positive integer base b Very large exponent represented as an array of digits We need to compute: a^b mod 1337 The exponent can be extremely large, so we cannot convert the entire digit array into a normal integer directly. The problem statement defines: b = [1, 2, 3] as the exponent: 123 The modulus is always: 1337 The official examples include: a...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 396: Rotate Function

Problem Restatement We are given an integer array nums of length n . For each rotation k , define F(k) as: F(k) = 0 * arr[k][0] + 1 * arr[k][1] + ... + (n - 1) * arr[k][n - 1] where arr[k] is nums rotated clockwise by k positions. We need to return the maximum value among: F(0), F(1), ..., F(n - 1) The answer is guaranteed to fit in...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 469: Convex Polygon

Problem Restatement We are given a list of points in the 2D plane. The points are already ordered around the polygon. Connecting them sequentially forms a simple polygon. That means the edges do not cross each other except at shared vertices. We need to return whether the polygon is convex. A polygon is convex if it always turns in the same direction as we walk around its boundary. The problem...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 447: Number of Boomerangs

Problem Restatement We are given a list of distinct points on a 2D plane. Each point is represented as: [x, y] A boomerang is an ordered tuple of points: (i, j, k) such that the distance from i to j equals the distance from i to k . The order matters. So: (i, j, k) and: (i, k, j) are counted as two different boomerangs. The official problem states that...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 371: Sum of Two Integers

Problem Restatement Given two integers a and b , return their sum without using the + or - operators. The problem is asking us to implement integer addition using bit operations. The official statement gives examples such as a = 1, b = 2 , with output 3 . Input and Output Item Meaning Input Two integers a and b Output The integer sum of a and b Restriction Do...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 319: Bulb Switcher

Problem Restatement There are n bulbs in a row. All bulbs are initially off. We perform n rounds: Round Operation 1 Turn on every bulb 2 Toggle every second bulb 3 Toggle every third bulb i Toggle every i th bulb n Toggle only the n th bulb Return how many bulbs are on after all rounds. The official constraints are 0 <= n <= 10^9 . Input and Output...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 445: Add Two Numbers II

Problem Restatement We are given two non-empty linked lists. Each linked list represents a non-negative integer. Each node stores one digit, and the digits are stored in forward order. That means the most significant digit comes first. For example: 7 -> 2 -> 4 -> 3 represents: 7243 We need to add the two numbers and return the sum as a linked list, also in forward order. The numbers have...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 369: Plus One Linked List

Problem Restatement We are given the head of a non-empty singly linked list. The linked list represents a non-negative integer. Each node stores one digit from 0 to 9 . The digits are stored in normal order, so the most significant digit is at the head. For example: 1 -> 2 -> 3 represents the number: 123 We need to add 1 to this number and return the head of...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 368: Largest Divisible Subset

Problem Restatement We are given a set of distinct positive integers nums . Return the largest subset answer such that for every pair of numbers in answer , one number divides the other. For any pair: answer[i], answer[j] at least one of these must be true: answer[i] % answer[j] == 0 or: answer[j] % answer[i] == 0 If there are multiple valid largest subsets, return any one of them. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 492: Construct the Rectangle

Problem Restatement We are given a positive integer area . We need to find two positive integers: Name Meaning L Length W Width They must satisfy three rules: Rule Meaning L * W == area The rectangle area must match exactly L >= W Length must be at least width L - W is minimized The rectangle should be as close to a square as possible Return: [L, W] The...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 367: Valid Perfect Square

Problem Restatement Given a positive integer num , return True if it is a perfect square. A perfect square is an integer that can be written as: x * x where x is also an integer. We must not use built-in square root functions such as sqrt . The constraint is 1 <= num <= 2^31 - 1 . Input and Output Item Meaning Input Positive integer num Output True...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 415: Add Strings

Problem Restatement We are given two non-negative integers as strings: num1 num2 Return their sum as a string. We cannot use a built-in big integer library. We also cannot directly convert the whole input strings into integers. So this is manual addition, the same way we add numbers on paper. The source problem states that num1 and num2 contain only digits, have no leading zeroes except "0" itself, and each...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 296: Best Meeting Point

Problem Restatement We are given a 2D grid containing only 0 and 1 . Each 1 marks the home of one person. A group of people wants to meet at one grid cell while minimizing the total travel distance. Distance is measured by Manhattan distance: distance = abs(r1 - r2) + abs(c1 - c2) We need to return the minimum possible total distance. The source statement says there are two...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 223: Rectangle Area

Problem Restatement We are given two axis-aligned rectangles in a 2D plane. The first rectangle is defined by: (ax1, ay1) (ax2, ay2) The second rectangle is defined by: (bx1, by1) (bx2, by2) Each pair represents the bottom-left corner and top-right corner of a rectangle. We need to return the total area covered by both rectangles. If the rectangles overlap, the overlapping region should be counted only once. The official statement...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 441: Arranging Coins

Problem Restatement We are given n coins. We want to arrange them into a staircase shape. The staircase must follow this rule: Row Number of Coins 1st row 1 2nd row 2 3rd row 3 ... ... Each row must contain exactly one more coin than the previous row. We need to return the number of complete rows that can be formed. The last row may be incomplete, and incomplete...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 413: Arithmetic Slices

Problem Restatement We are given an integer array nums . An arithmetic array is a subarray with at least 3 elements where the difference between consecutive elements is the same. We must return the total number of arithmetic subarrays inside nums . A subarray must be contiguous. The official examples include [1,2,3,4] -> 3 and [1] -> 0 . The constraints include 1 <= nums.length <= 5000 and -1000 <=...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 440: K-th Smallest in Lexicographical Order

Problem Restatement We are given two integers n and k . We need to return the k -th smallest integer in lexicographical order among all integers from 1 to n . Lexicographical order means dictionary order, as if every number were compared as a string. For example, when: n = 13 the numbers in lexicographical order are: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 365: Water and Jug Problem

Problem Restatement We are given two jugs with capacities x liters and y liters. There is an infinite water supply. We need to decide whether it is possible to measure exactly target liters using the two jugs. At the end, the total amount of water in both jugs must be exactly target . Allowed operations: Operation Meaning Fill Fill either jug completely Empty Empty either jug completely Pour Pour from...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 390: Elimination Game

Problem Restatement We start with a sorted list of integers: [1, 2, 3, ..., n] Then we repeatedly remove numbers until only one number remains. The removal process alternates direction: From left to right, remove the first number and every other number after it. From right to left, remove the rightmost number and every other number before it. Keep alternating directions. Return the last remaining number. For example, when n...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 273: Integer to English Words

Problem Restatement We are given a non-negative integer num . Return its English words representation. Examples: 123 -> "One Hundred Twenty Three" 12345 -> "Twelve Thousand Three Hundred Forty Five" 1234567 -> "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven" 0 -> "Zero" The constraint is: 0 <= num <= 2^31 - 1 So the largest possible number is less than 2.15 billion. We only need scale...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 292: Nim Game

Problem Restatement We are given a heap with n stones. Two players take turns removing stones from the heap. On each turn, a player must remove: 1, 2, or 3 stones. You go first. The player who removes the last stone wins. We need to return True if we can force a win assuming both players play optimally. Otherwise, return False . The source statement gives the same rules: there...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 268: Missing Number

Problem Restatement We are given an array nums containing n distinct numbers from the range: 0, 1, 2, ..., n Exactly one number from this range is missing. Return the missing number. For example, if: nums = [3, 0, 1] then n = 3 , so the full range should be: [0, 1, 2, 3] The missing number is: 2 The problem asks for an algorithm with linear runtime. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 150: Evaluate Reverse Polish Notation

Problem Restatement We are given an array of strings representing an arithmetic expression in Reverse Polish Notation (RPN). Evaluate the expression and return the integer result. Valid operators are: Operator Meaning + Addition - Subtraction * Multiplication / Division Each operand may be an integer or another expression. Division truncates toward zero. LeetCode guarantees that: the input is always valid there is no division by zero the final answer fits...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 149: Max Points on a Line

Problem Restatement We are given a list of 2D points: points[i] = [xi, yi] Return the maximum number of points that lie on the same straight line. A line may be horizontal, vertical, diagonal, or any slope. LeetCode constrains the number of points to at most 300 , which allows an O(n^2) solution. Examples Example 1: points = [[1,1],[2,2],[3,3]] All three points lie on: y = x Output: 3 Example...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 96: Unique Binary Search Trees

Problem Restatement We are given an integer n . We need to count how many structurally unique binary search trees can be built using exactly the values: 1, 2, 3, ..., n Each value must be used exactly once. The official problem asks for the number of structurally unique BSTs with exactly n nodes and unique values from 1 to n . The constraint is 1 <= n <= 19...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 172: Factorial Trailing Zeroes

Problem Restatement We are given a non-negative integer: n We need to return the number of trailing zeroes in: n! where: n! = 1 * 2 * 3 * ... * n A trailing zero is a zero at the end of the decimal representation. For example: 1200 has: 2 trailing zeroes. The problem asks us to compute the answer without explicitly calculating the factorial. The constraints allow values up...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 171: Excel Sheet Column Number

Problem Restatement We are given an Excel column title: columnTitle We need to return its corresponding column number. Excel columns are labeled like this: Title Number "A" 1 "B" 2 "Z" 26 "AA" 27 "AB" 28 "ZY" 701 This problem is the reverse of LeetCode 168. The input contains only uppercase English letters. The constraints guarantee the answer fits in a 32-bit integer. Input and Output Item Meaning Input Excel...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 119: Pascal's Triangle II

Problem Restatement We are given an integer: rowIndex We need to return the row at index rowIndex from Pascal's Triangle. The rows are zero-indexed: Index Row 0 [1] 1 [1,1] 2 [1,2,1] 3 [1,3,3,1] The official problem asks for the row at the given index. For example: rowIndex = 3 The answer is: [1, 3, 3, 1] Input and Output Item Meaning Input Integer rowIndex Output Pascal's Triangle row at...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 118: Pascal's Triangle

Problem Restatement We are given an integer: numRows We need to generate the first numRows rows of Pascal's Triangle. In Pascal's Triangle: The first and last number of every row are 1 . Every interior value equals the sum of the two numbers directly above it. The official problem asks us to return the first numRows rows. For example: numRows = 5 The output is: [ [1], [1, 1], [1,...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 70: Climbing Stairs

Problem Restatement We are given an integer n . There is a staircase with n steps. Each time, we may climb either: 1 step 2 steps We need to return how many distinct ways there are to reach the top. The official constraint is 1 <= n <= 45 . ( leetcode.com ) Input and Output Item Meaning Input An integer n Output Number of distinct ways to reach step...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 142: Linked List Cycle II

Problem Restatement We are given the head of a linked list. If the linked list contains a cycle, return the node where the cycle begins. If there is no cycle, return None . LeetCode internally represents the cycle using an index pos , where the tail points back to the node at index pos . This value is not passed into the function. Examples Example 1: 3 -> 2 ->...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 69: Sqrt(x)

Problem Restatement We are given a non-negative integer x . We need to return the square root of x rounded down to the nearest integer. We cannot use built-in exponent functions or operators such as pow(x, 0.5) or x ** 0.5 . The official constraint is: 0 <= x <= 2**31 - 1 Input and Output Item Meaning Input A non-negative integer x Output The integer part of sqrt(x) Rounding...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 168: Excel Sheet Column Title

Problem Restatement We are given a positive integer: columnNumber We need to return the corresponding Excel column title. Excel columns are labeled like this: Number Title 1 "A" 2 "B" 26 "Z" 27 "AA" 28 "AB" 701 "ZY" The problem asks us to convert an integer into this Excel-style column label. The constraint is 1 <= columnNumber <= 2^31 - 1 . Input and Output Item Meaning Input Positive integer...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 166: Fraction to Recurring Decimal

Problem Restatement We are given two integers: numerator denominator They represent the fraction: numerator / denominator We need to return the decimal representation as a string. If the fractional part repeats forever, we put the repeating part inside parentheses. For example: 1 / 2 = "0.5" 2 / 1 = "2" 2 / 3 = "0.(6)" 4 / 333 = "0.(012)" The denominator is never zero, and the result string...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 67: Add Binary

Problem Restatement We are given two binary strings, a and b . Each string contains only characters "0" and "1" . We need to return their sum as a binary string. The official constraints are 1 <= a.length, b.length <= 10^4 , both strings contain only binary digits, and neither string has leading zeroes except the string "0" itself. Input and Output Item Meaning Input Two binary strings a and...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 89: Gray Code

Problem Restatement We are given an integer n . We need to return any valid n -bit Gray code sequence. A valid Gray code sequence has these rules: Rule Meaning Length The sequence contains 2^n integers Range Every integer is between 0 and 2^n - 1 Start The first integer must be 0 No duplicates Each integer appears at most once Adjacent rule Adjacent integers differ by exactly one bit...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 66: Plus One

Problem Restatement We are given a large integer represented as an array of digits. The digits are ordered from most significant to least significant. This means the leftmost digit is the largest place value. We need to add one to the integer and return the resulting digits as an array. The input has no leading zeroes, and each element is a single digit from 0 to 9 . The official...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 412: Fizz Buzz

Problem Restatement We are given an integer n . Return a string array answer of length n . For every integer i from 1 to n : Condition Output i is divisible by both 3 and 5 "FizzBuzz" i is divisible by 3 "Fizz" i is divisible by 5 "Buzz" None of the above i as a string The array is 1-indexed in the problem description, meaning answer[i] describes the...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 343: Integer Break

Problem Restatement We are given an integer n . We must break n into the sum of at least two positive integers. Among all possible breaks, return the maximum product of those integers. For example: 10 = 3 + 3 + 4 The product is: 3 * 3 * 4 = 36 So for n = 10 , the answer is 36 . The constraints are: 2 <= n <=...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 264: Ugly Number II

Problem Restatement We are given an integer n . Return the n th ugly number. An ugly number is a positive integer whose prime factors are limited to: 2, 3, 5 The sequence starts with: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, ... 1 is treated as an ugly number. The constraint is: 1 <= n <= 1690 The official examples include n = 10 -> 12...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 313: Super Ugly Number

Problem Restatement A super ugly number is a positive integer whose prime factors all come from the array primes . We are given: n primes Return the n th super ugly number. The sequence starts with 1 . The number 1 is included even though it has no prime factors. The official statement says the n th super ugly number is guaranteed to fit in a 32-bit signed integer. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 342: Power of Four

Problem Restatement We are given an integer n . Return true if n is a power of four. Otherwise return false . A number is a power of four if there exists an integer x such that: n = 4^x Examples: 1 = 4^0 4 = 4^1 16 = 4^2 64 = 4^3 are powers of four. The official problem asks whether n is a power of four and includes...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 462: Minimum Moves to Equal Array Elements II

Problem Restatement We are given an integer array nums . In one move, we can either increment or decrement one element by 1 . We need to return the minimum number of moves required to make all array elements equal. The official statement defines the move as incrementing or decrementing one array element by 1 . For example: nums = [1, 2, 3] We can make all values equal to...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 263: Ugly Number

Problem Restatement We are given an integer n . Return True if n is an ugly number. An ugly number is a positive integer whose prime factors are limited to: 2, 3, 5 So a number is ugly if, after removing all factors of 2 , 3 , and 5 , nothing remains except 1 . The problem constraints are: -2^31 <= n <= 2^31 - 1 1 is considered...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 60: Permutation Sequence

Problem Restatement We are given two integers, n and k . The set is: [1, 2, 3, ..., n] This set has n! unique permutations. If we list all permutations in sorted order, we need to return the k th permutation as a string. The official constraints are 1 <= n <= 9 and 1 <= k <= n! . Input and Output Item Meaning Input Two integers n and...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 360: Sort Transformed Array

Problem Restatement We are given a sorted integer array nums and three integers a , b , and c . For every number x in nums , apply this function: f(x) = a * x * x + b * x + c Return all transformed values in sorted order. The input array is already sorted in ascending order. The follow-up asks for an O(n) solution, rather than transforming everything...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 233: Number of Digit One

Problem Restatement We are given a non-negative integer n . We need to count how many times the digit: 1 appears in all integers from: 0 to n inclusive. Example: n = 13 Numbers: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 Digit 1 appears in: 1 10 11 11 12 13 Total count: 6 LeetCode examples include: Input: n = 13 Output: 6...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 458: Poor Pigs

Problem Restatement We are given buckets buckets of liquid. Exactly one bucket is poisonous. A pig dies minutesToDie minutes after drinking poison. We have minutesToTest total minutes to determine which bucket is poisonous. We need to return the minimum number of pigs needed to guarantee that we can identify the poisonous bucket within the time limit. The official problem asks for the minimum number of pigs needed given buckets ,...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 258: Add Digits

Problem Restatement We are given a non-negative integer num . Repeatedly add all of its digits until the result has only one digit. Return that final one-digit number. Example: num = 38 First add its digits: 3 + 8 = 11 The result still has two digits, so add again: 1 + 1 = 2 Now the result has one digit. Answer: 2 The follow-up asks for an O(1) solution...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 483: Smallest Good Base

Problem Restatement We are given an integer n as a string. We need to return the smallest base k such that the representation of n in base k contains only digit 1 . For example: 13 in base 3 = 111 because: 13 = 1 * 3^2 + 1 * 3^1 + 1 * 3^0 So for n = "13" , the answer is: "3" A good base must satisfy...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 231: Power of Two

Problem Restatement We are given an integer n . We need to determine whether n is a power of two. That means we must check whether there exists an integer x such that: $$ n = 2^x $$ where: x >= 0 Examples of powers of two: 1 = 2^0 2 = 2^1 4 = 2^2 8 = 2^3 16 = 2^4 Examples that are not powers of two: 3...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 384: Shuffle an Array

Problem Restatement We are given an integer array nums . We need to design a class with two operations: Operation Meaning reset() Return the array to its original configuration shuffle() Return a random permutation of the array The important requirement is that every possible permutation must be equally likely. For an array of length n , there are n! possible permutations. A correct shuffle gives each one the same probability....

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 335: Self Crossing

Problem Restatement We are given an integer array distance . We start at point (0, 0) on a 2D plane. The movement directions repeat in this order: north -> west -> south -> east -> north -> ... After each move, the direction turns counter-clockwise. Return true if the path crosses itself. Otherwise, return false . The problem asks for a one-pass algorithm using O(1) extra space. The official statement...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 357: Count Numbers with Unique Digits

Problem Restatement Given an integer n , count how many integers x satisfy: 0 <= x < 10**n and have no repeated digits. A number has unique digits if every digit appears at most once. Examples: 123 has unique digits 102 has unique digits 11 does not have unique digits 100 does not have unique digits The range includes 0 . The range does not include 10^n . The problem...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 405: Convert a Number to Hexadecimal

Problem Restatement We are given a 32-bit signed integer num . We must return its hexadecimal representation as a lowercase string. The hexadecimal digits are: 0 1 2 3 4 5 6 7 8 9 a b c d e f We must not use built-in conversion functions such as: hex() Negative numbers use two's complement representation. If the number is 0 , return: "0" Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 204: Count Primes

Problem Restatement We are given an integer n . We need to count how many prime numbers are strictly less than n . A prime number is a number greater than 1 that has exactly two positive divisors: 1 itself The official statement says: given an integer n , return the number of prime numbers that are strictly less than n . Input and Output Item Meaning Input Integer n...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 279: Perfect Squares

Problem Restatement We are given an integer n . We need to return the least number of perfect square numbers whose sum is exactly n . A perfect square is a number like: 1, 4, 9, 16, 25 because: 1 = 1 * 1 4 = 2 * 2 9 = 3 * 3 16 = 4 * 4 25 = 5 * 5 For example, for n = 12...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 382: Linked List Random Node

Problem Restatement We are given the head of a singly linked list. We need to implement a class with one main operation: getRandom() This operation returns the value of a random node from the linked list. Every node must have the same probability of being chosen. The linked list has at least one node, so getRandom() always has a valid value to return. The follow-up asks whether we can solve...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 479: Largest Palindrome Product

Problem Restatement We are given an integer n . We need to find the largest palindrome that can be written as the product of two n -digit integers. Because the answer may be very large, we return the palindrome modulo 1337 . For example, when n = 2 , the two-digit numbers are from 10 to 99 . The largest palindrome product is: 99 * 91 = 9009 Then we...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 254: Factor Combinations

Problem Restatement We are given a positive integer n . We need to return all possible ways to write n as a product of factors. Each factor must be between 2 and n - 1 . For example: 8 = 2 * 2 * 2 8 = 2 * 4 So for n = 8 , valid answers are: [[2, 2, 2], [2, 4]] We may return the combinations in...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 453: Minimum Moves to Equal Array Elements

Problem Restatement We are given an integer array nums . In one move, we can increment exactly n - 1 elements by 1 , where n is the length of the array. That means each move leaves one element unchanged and increases every other element. We need to return the minimum number of moves required to make all elements equal. The official statement defines this move as incrementing n -...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 478: Generate Random Point in a Circle

Problem Restatement We are given a circle defined by: Value Meaning radius Radius of the circle x_center x-coordinate of the center y_center y-coordinate of the center We need to implement a class with two parts: Method Meaning Solution(radius, x_center, y_center) Stores the circle randPoint() Returns a random point inside or on the circle The returned point must be uniformly distributed inside the circle. A point on the circumference is allowed....

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 29: Divide Two Integers

Problem Restatement We are given two integers, dividend and divisor . We need to compute the integer quotient of: dividend / divisor But we cannot use multiplication, division, or modulo operators. The result should truncate toward zero. That means we remove the fractional part. Examples: 10 / 3 = 3.333... -> 3 7 / -3 = -2.333... -> -2 The answer must stay inside the 32-bit signed integer range: [-2^31,...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 202: Happy Number

Problem Restatement We are given a positive integer n . We repeatedly replace n with the sum of the squares of its digits. If this process eventually reaches 1 , then n is a happy number. If the process enters a cycle that never reaches 1 , then n is not a happy number. Return True if n is happy. Otherwise, return False . The official problem defines the process...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 227: Basic Calculator II

Problem Restatement We are given a string s representing a mathematical expression. The expression contains: Non-negative integers Operators: + , - , * , / Spaces We must evaluate the expression and return the integer result. Division truncates toward zero. LeetCode examples: Input: "3+2*2" Output: 7 Input: " 3/2 " Output: 1 Input: " 3+5 / 2 " Output: 5 The expression is always valid. Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 13: Roman to Integer

Problem Restatement We are given a Roman numeral string s . We need to convert it into an integer. Roman numerals use seven symbols: Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 Usually, Roman numerals are written from largest to smallest. For example: VIII = 5 + 1 + 1 + 1 = 8 But there are six subtractive cases: Roman Value...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 326: Power of Three

Problem Restatement We are given an integer n . Return true if n is a power of three. Otherwise, return false . A number is a power of three when it can be written as: n = 3^x where x is an integer. Examples: 27 = 3^3 9 = 3^2 3 = 3^1 1 = 3^0 So 27 , 9 , 3 , and 1 are powers of three. Numbers...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 12: Integer to Roman

Problem Restatement We are given an integer num . We need to convert it into a Roman numeral string. Roman numerals use seven base symbols: Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 The input satisfies: 1 <= num <= 3999 The LeetCode statement also defines the subtractive forms: Value Roman 4 IV 9 IX 40 XL 90 XC 400 CD 900...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 9: Palindrome Number

Problem Restatement We are given an integer x . Return true if x is a palindrome integer. Return false otherwise. A palindrome reads the same forward and backward. For example: 121 is a palindrome because it reads the same from both directions. But: -121 is not a palindrome, because reversing it gives: 121- The follow-up asks whether we can solve the problem without converting the integer to a string. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 7: Reverse Integer

Problem Restatement We are given a signed 32-bit integer x . We need to reverse its digits. Examples: 123 -> 321 -123 -> -321 120 -> 21 If the reversed value goes outside the signed 32-bit integer range, we return 0 . The valid range is: [-2^31, 2^31 - 1] which means: [-2147483648, 2147483647] The official problem also says to assume the environment does not allow storing 64-bit integers. Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 2: Add Two Numbers

Problem Restatement We are given two non-empty linked lists. Each linked list represents a non-negative integer. The digits are stored in reverse order. For example: 2 -> 4 -> 3 actually represents the number: 342 because the least significant digit comes first. We need to add the two numbers together and return the result as a linked list in the same reversed format. Each node contains exactly one digit. Input...

#math

Codeforces Round 1091 (Div. 2) and CodeCraft 26

CF 2217G - Down the Pivot

CF 2217D - Flip the Bit (Hard Version)

Codeforces Round 1090 (Div. 4)

CF 2218D - The 67th OEIS Problem

CF 2218A - The 67th Integer Problem

CF 168A - Wizards and Demonstration

Codeforces Round 114 (Div. 2)

CF 2219A - Grid L

Codeforces Round 1093 (Div. 1)

CF 2227A - Koshary

CF 2222C - Median Partition

CF 2226E - Mental Monumental (Hard Version)

CF 2226A - Disturbing Distribution

CF 2226B - Everything Everywhere

Codeforces Round 1096 (Div. 3)

CF 2226D - Reserved Reversals

Codeforces Round 1095 (Div. 2)

Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)

CF 2227F - It Just Keeps Going Sideways

Educational Codeforces Round 189 (Rated for Div. 2)

CF 2226F - Inversion Invasion

CF 2227G - Drowning

CF 2226C - Mental Monumental (Easy Version)

CF 2225E - Covering Points with Circles

CF 2222A - A Wonderful Contest

CF 2225D - Exceptional Segments

CF 2227C - Snowfall

LeetCode 3761 - Minimum Absolute Distance Between Mirror Pairs

LeetCode 3430 - Maximum and Minimum Sums of at Most Size K Subarrays

LeetCode 3671 - Sum of Beautiful Subsequences

LeetCode 3669 - Balanced K-Factor Decomposition

LeetCode 3621 - Number of Integers With Popcount-Depth Equal to K I

LeetCode 3610 - Minimum Number of Primes to Sum to Target

LeetCode 3602 - Hexadecimal and Hexatrigesimal Conversion

CF 495B - Modular Equations

CF 1955G - GCD on a grid

CF 1946B - Maximum Sum

CF 1975F - Set

CF 1945B - Fireworks

CF 1955A - Yogurt Sale

CF 1956D - Nene and the Mex Operator

CF 1954B - Make It Ugly

CF 1958B - Clock in the Pool

CF 1950C - Clock Conversion

CF 491B - New York Hotel

Codeforces Round 279 (Div. 2)

CF 1949K - Make Triangle

CF 1955F - Unfair Game

CF 1942C1 - Bessie's Birthday Cake (Easy Version)

Codeforces Round 935 (Div. 3)

Codeforces Round 934 (Div. 2)

CF 1973B - Cat, Fox and the Lonely Array

Codeforces Round 276 (Div. 1)

CF 1975B - 378QAQ and Mocha's Array

CF 1952G - Mathematician Takeover

CF 1956E1 - Nene vs. Monsters (Easy Version)

CF 1956E2 - Nene vs. Monsters (Hard Version)

CF 1942A - Farmer John's Challenge

CF 486E - LIS of Sequence

Codeforces Round 947 (Div. 1 + Div. 2)

Educational Codeforces Round 164 (Rated for Div. 2)

CF 1942B - Bessie and MEX

CF 1951G - Clacking Balls

CF 1956C - Nene's Magical Matrix

CF 1967A - Permutation Counting

CF 1942C2 - Bessie's Birthday Cake (Hard Version)

CF 1967E1 - Again Counting Arrays (Easy Version)

CF 1944A - Destroying Bridges

CF 1951D - Buying Jewels

CF 1973E - Cat, Fox and Swaps

Codeforces Round 941 (Div. 1)

CF 1954D - Colored Balls

CF 486D - Valid Sets

CF 1955C - Inhabitant of the Deep Sea

Testing Round 11

CF 1951C - Ticket Hoarding

CF 493E - Vasya and Polynomial

CF 1967B2 - Reverse Card (Hard Version)