Hello Codeforces, yesterday I have submitted various solutions for problem C. Although I have estimated my time and memory complexity to be O(n log n) I was surprised to see that it gave time limit exceeded, can you help me? 188111812

Hello Codeforces, today is the last day for middle school national olympiad of informatics and as to support a beloved companion, I am writing this blog, we expect all your best wishes! nicecoder37

Hi, I am a high school student trying to improve in order to compete in the IOI. Yesterday, after 4 months of practice, I have become a specialist on codeforces. Now that I have somewhat got used to how I should practice constructive and greedy algorithms, I have a question for you. What topics should I focus on studying next? By topics I mean stuff like graphs,dp (etc.). Please assist me with your knowledge. Thank you in advance.

Hello, I am a student from Turkey who wants to improve in order to compete in IOI. I have reached green after 2,5 months of learning but I have a big question on my mind. What should I priortise to reach specialist? I humbly request your advise. Good day to everyone.

Thanks for your attention.(https://codeforces.com/contest/723/submission/167961664) [here]

Hello everybody, recently I have been studying graphs and trees and have acquired basic graphs knowledge such as BFS,DFS,Prim's Algorithm for MST, Topological Sort and DSU. But I feel like I am not following a very good syllabus since I study whatever I encounter in problems rated 1500-1600 or so. I would be very happy if anyone helped me by providing a curriculum or a playlist or something like that. Thank you very much for your attention. If interested, Number_72 use this link to check out my recent submissions. There are about a dozen accepted graph questions. Thank you.

Hello everyone, I am a beginner coder who works hard to improve. Recently, I have noticed that I need to solve more binary search questions to improve. So I filtered the problemset with binary search and set the difficulty range to 1400-1500. But, most problems only use binary search algorithm to only improve the time complexity. Could anyone suggest a resource that I could use just to improve my binary search? Thank you for your interest.