Leetcode — 3289. The Two Sneaky Numbers of Digitville,It’s an easy problem with description being: In the town of Digitville, there was a list of numbers called nums containing i...

Leetcode — 3190. Find Minimum Operations to Make All Elements Divisible by Three,This is an easy problem with description being: You are given an integer array nums. In one operat...

Leetcode — 2769. Find the Maximum Achievable Number,This is an easy problem with description being: Given two integers, num and t. A number is achievable if it can become equal to...