[CS Academy] Ricocheting Balls|PSCS Academy|Problem Solving-Math

Ricocheting Balls

Read more
[CS Academy] Points Matching|PSCS Academy|Segment Tree-Problem Solving

Points Matching

Read more
[CS Academy] Pitmutation|PSCS Academy|Problem Solving-Dynamic Programming

Pitmutation

Read more
[Codeforces] Round 805 (Div. 3) G2. Passable Paths (hard version)|PSCodeforces|Lowest Common Ancestor-Problem Solving-Graph Theory

Codeforces Round 805 (Div. 3) G2. Passable Paths (hard version)

Read more
[Codeforces] Round 805 (Div. 3) G1. Passable Paths (easy version)|PSCodeforces|Lowest Common Ancestor-Problem Solving-Graph Theory

Codeforces Round 805 (Div. 3) G1. Passable Paths (easy version)

Read more
[Codeforces] CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) D. Magical Array|PSCodeforces|Problem Solving-Math-Greedy

CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) D. Magical Array

Read more
[Codeforces] Round 808 (Div. 1) B. Difference Array|PSCodeforces|Problem Solving-Math

Codeforces Round 808 (Div. 1) B. Difference Array

Read more
[Codeforces] Round 811 (Div. 3) F. Build a Tree and That Is It|PSCodeforces|Problem Solving-Graph Theory-Math

Codeforces Round 811 (Div. 3) F. Build a Tree and That Is It

Read more
[LeetCode] Buddy Strings|PSLeetCode|Problem Solving

859. Buddy Strings

Given two strings s and goal, return true if you can swap two letters in s so the result is equal to goal, otherwise, return false.

Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters at s[i] and s[j].

  • For example, swapping at indices 0 and 2 in "abcd" results in "cbad".
Read more
[Codeforces] Round 816 (Div. 2) D. 2+ doors|PSCodeforces|Problem Solving-Greedy-Bit Manipulation

Codeforces Round 816 (Div. 2) D. 2+ doors

Read more