COMPETITIVE PROGRAMMING & DSA

3 Beautiful Problems:
Chemistry (Codeforces 1883B): The problem reduces to checking whether character frequencies can be balanced using at most k removals so that the remaining string can form a palindrome.

Vasilije in Cacak (Codeforces 1878C): The task is to determine if a target sum can be formed using k distinct integers from 1 to n by verifying minimum and maximum possible sums.

Asteroid Collision (LeetCode): A stack is used to simulate collisions because an incoming left moving asteroid