Posts from the Repovive community.
Featured
Latest
Featured
Latest
Hello Repovive!
In this blog, I want to introduce the different contest series we run. For now, we have two series in our plan:
Repovive Premier Round: a global contest series designed to be suitable for all participants.
Repovive Standard Round: a slightly easier series, roughly intended for Codeforces rating <= 2600 participants.
We will do our best to keep our problems creative and well-polished, regardless of their difficulty. We also aim to write statements that are short, clear, an
Graphs come up in about 35-40% of coding interviews at major tech companies. Social networks, map routing, dependency chains, web crawlers. If you don't know graph patterns, you'll easily fail the interview.
I've seen candidates stuck on problems like "Number of Islands" because they hadn't practiced grid traversal. These problems become straightforward once you know the patterns.
In this post, I'll show you 7 graph algorithms that cover about 85% of graph-related interview questions. For each
I'm a newbie on Repovive, and recently I participated in Repovive Premier Round 9. To be honest, I used AI to solve some problems during the contest (Most probably D, E and F which was TLE) in terms of hints and generationme code genration, and because of that, I got removed from the rankings.
But honestly, it's okay! I understand that contests have rules, and fair competition matters. I accept the decision, and I'll try to follow the rules i
Because it saves time and show user how much he has done.
Hey everyone, welcome to my corner of the internet!
I’m Aditya, and this is my very first post here. I’ve always been fascinated by coding, problem-solving, and creative projects, so I decided to start this blog as a way to share my journey.
Expect posts about algorithms, debugging adventures, and maybe even some thoughts on entrepreneurship and creativity. My goal is to make this space both useful and fun—for myself and anyone who drops by.
Thanks for reading, and I’m excited to see whe
We are excited to announce support for Interactive Problems on Repovive! Unlike traditional problems where you read all input at once, interactive problems require your solution to "talk" to the judge in real-time. Think of it as a conversation where each side reacts to the other's messages.
In a standard problem, the judge pipes a file into your program. In an interactive problem, the judge runs a second program called an Interactor alongside your solution.
In this post, I'll show you how to get the most out of Repovive.
Press : or Cmd/Ctrl + K to open the command bar. Type a command and hit Enter.
| Command | Action | Command | Action |
|---|---|---|---|
: or ⌘K | Open Bar | :help | All Commands |
:gh | Home | :gu | Profile |
:gc | Contests | :gp | Problems |
:gr | Roadmaps | :ge | Editor |
:t | Theme | :q | Back |
More commands:
:s — Select mode: navigate lists with ↑/↓, Enter to clickJust sort both arrays and then take the absolute sum of the differences between corresponding elements. This is optimal because any swap from this configuration will only increase the cost.
Iterate through every subarray in O(n^2). Within the loop, keep track of the frequency using a count[] array and its maximum value using an mx variable.
We have a graph composed of sparse roads and dense teleport-devices. We can model the dense edges