I analyzed problem ratings from the last ~40 Codeforces Div. 2 contests and plotted the distribution of each problem index.

This visualization can help users rated <= 1600 understand where each problem type usually sits on the rating scale and plan training more effectively.

• Data collected using the Codeforces API
• Useful for estimating problem difficulty before contests

How to solve the problem below in O(log2n) C++: You have the i'th element of an unsorted array. you have to find the nearest(absolute difference of the values is as small as possible) element of the i'th element from the right side.