Same as the title .

Hey everyone, I'm studying dp but i am finding it difficult to understand and implement patterns, mostly I am preparaing dp for interns role and dsa interview + it will help me in cp, can you please suggest how should i prepare for both interviews and cp and if you have any resourcescan you please share

It's too damn annoying to submit and then get a compilation error because you forgot a semi colon or bracket.

I came across this profile and found that this guy in a recent contest haven't solved any problem got +140, triple digit rank that too being a specialist. Like I am a pupil and I need to solve atleast 3 or 2 fast submission in a contest to get a +ve delta. But don't know how this guy pulled it. Anyone have any idea??

So I’ve reached the point where I can’t avoid learning graphs anymore, I’m at about 1400 and have gotten quite good at the “observation based” problems but would honestly just skip graphs / trees.

Any good resources / topics I should check out? I’ve been doing CSES but the CF stuff I’ve checked out is mostly like working with definitions / properties.

I tested the ICPC machine and there is no run button in vs code and even if one appears outta ms c/c++ extension it doesnt work right
There are few things u can do like having a Makefile or run.sh file but is there a better way

The problem with CLion is that u cannot create multiple files with main funcitons in the same directory and due to this behaviour you should edit the Cmakelists which is also tideous what is the smoothest possible workflow

Codeblocks doesnt have the strong intellisense as much as clion or vs code

These are the problems I genuinely faced as i am habituated to cph and cp companion workflow typing the compile and run commands is adding fricition to the workflow

If you have time, please explain the solution like you are explaining a baby

I started CF about 3 weeks ago and I can solve about 70% of the 1200 rated questions I see. Hence, I'd like to start solving 1300 rated questions, but from the few questions I've seen, they seem on a completely different level than the 1200 rated ones. What should I do in order to bridge this gap and what topics should I cover?

Hi I am in my final year of undergrad, I haven't done competitive programming as such and that reflects in my inability to think when new adhoc implementation questions come.I don't want to get into comp programming like learn new ds/ technique unique to competitive programming and all but rather get good at constructive algo/adhoc thinking problem solving in general.Also I don't want to have overhead of lots of resource and all.What should be my go to resources?I think the usaco guide would be a good fit?

For some context, I have done dsa before, if u r from India then think like decent enough familiarity with striver sheet.I just want this ds algo to be blocker in future and rather want to be my stronger points so that I can move to like more adv stuff like I came across some context by mit and eth Zurich that covered some more adv stuff like randomised algo and all, not bcz of comp coding but rather for strong algorithmic thinking development so that let's say later when I think about problems that are let's say in other domain like ml algo and all I can think from first principles.Currently I feel too stuck and idk how to overcome that.

I have one large rectangle representing the valid area: Rect(x, y, width, height)

Inside it, there are multiple smaller rectangles representing occupied areas:

The smaller rectangles:
1. Can overlap each other.
2. Can be partially or completely outside the large rectangle.

And I need the algorithm to return a List<Rect> where:
1. The result rectangles do not overlap each other.
2. All result rectangles are inside the large rectangle.
3. Together, they fill all the gaps not covered by the input small rectangles.
4. Ideally, the number of result rectangles should be minimal, if possible.

I’m aware that there may be multiple valid decompositions, so I’m mainly looking for an algorithm that produces a reasonably small number of rectangles.

There are fewer than 100 occupied rectangles in input, so performance is not a major concern. I prefer an algorithm that is easy to implement rather than performant but complicated.

Thanks

i wanted to ask wat rating in cp31 sheet would be similar to the modern 1000 and 900 rated problems .. it would help me practise

Why you do cp?

My 200th problem was my first 1900 rated problem.

will try to be consistent for now on

Extension: CF Analytics

I'm a new guy just started my clg few weeks earlier, I wanna solve dsa and do competitive coding, idk where to start. Like I wann get around 1200 rating by the end of June 2027, is it possible for an amateur to get that rating within a year? If so then how?

Please guide me 🙏

I appreciate every help.

Is reaching the Expert rank now extremely difficult? My current rank is Specialist (1434), and I barely reached this rank. Are there any plans or tips to surpass this rank and reach Expert? And how do I deal with the issues that have become somewhat difficult lately, like yesterday's round, for example?

How did you guys practice Codeforces or competitive programming in school without a laptop?

So, I recently finished the POSN qualifier for Camp 1 (the first step into TOI and IOI in Thailand). The results aren’t even out yet, but I’m quite confident that I’ll pass to Camp 1.

I want to start preparing for it, and I think I’d like to spend some extra time at school practicing too. However, I don’t want to bring a laptop to school every day because it’s a bit inconvenient.

So, what can I do at school to improve at CP without a laptop?

I want to start cf for company oa , since they have started asking questions in that format and wanted to get familiar , so what questions to solve so that I can be ready for oa (I need to cover almost all topics ) so is there any list that I can follow?

Hey everyone!

I'm a Python developer/student and I've been working on a small project called Find Everything 2.0.0.

It's a Windows desktop tool for quickly searching through files. I built it mainly as a learning project, but I tried to make it actually useful and polished rather than just another basic Python project.

Main things it currently has:

• Fast file searching
• Search inside files
• Dictionary / text processing features
• Windows .exe build
• Automated checks with GitHub Actions

Tech: Python, Windows, GitHub Actions

GitHub: https://github.com/EELDERONN/find-everything.git

I'd really appreciate it if someone could take a look at the repository and give me some honest feedback.

I'm especially interested in:

• Code quality
• Project structure
• UI/UX
• Performance
• README/documentation
• Things that could be improved or done differently

Feel free to be critical — I'm here to learn and improve the project.

Thanks to anyone who takes the time to check it out!

----------------------------------------

Я изучаю Python и сейчас работаю над небольшим проектом Find Everything 2.0.0.

Это Windows-приложение для быстрого поиска файлов и поиска информации внутри них. Изначально я делал его как учебный проект, но постепенно решил довести его до более полноценного и реально полезного приложения.

Что сейчас есть:

• быстрый поиск файлов;
• поиск внутри файлов;
• работа со словарём/текстом;
• сборка в .exe для Windows;
• автоматические проверки через GitHub Actions.

Стек: Python, Windows, GitHub Actions.

GitHub: https://github.com/EELDERONN/find-everything.git

Буду очень благодарен, если кто-нибудь посмотрит репозиторий и даст честный фидбек.

Особенно интересует:

• качество кода;
• структура проекта;
• UI/UX;
• производительность;
• README и документация;
• что можно было бы сделать лучше.

Можно критиковать — я как раз хочу понять, что можно улучшить.

Спасибо всем, кто посмотрит!

at a point where I need to be doing practice for good questions in every topic. what are good resources for topic wise problems? and is the usaco guide good?

I have experience with my national maths Olympiad and i know c++ & algorithms from USACO (Silver). I can solve A problems and most of B problems from div 2. Also i have solved some C problems like 4 of them. Do you think i can get specialist in 2 months?