Hi every one. Happy new year! I wish you all the best in 2023.

What do you think will be the most important event of 2023?

Hi!

How to solve the following problem if each enemy be a circle with a known radius.

In that case the enemy will be killed if we shot any part of its body.

Han Solo and Lazer Gun

I want a greedy and a divide and conquer algorithm.

Hi everybody! Can any one help me solving this problem.

Given an array of n integers in range 1 to 10⁶ (1 ≤ n ≤ 10³), find the minimum steps to make the absolute difference of every two numbers less than or equal to one?

At each step we can subtract 1 from one number and add 1 to an adjacent number.

For example if we do one step on 2nd element of this array: 1,2,3. It can become 2,1,3 or can become 1,1,4 ?