Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Competitive Programming: Newbie to Expert
·
Module 1
Competitive Programming Fundamentals
1
Big O Complexity of Algorithms
Determine the Big O time and space complexity of standard algorithms.
2
Estimating Time Complexity: N-Rules for Codeforces
Estimate algorithm time complexity based on Codeforces problem constraints (N-rules).
3
Brute-Force Verification
Describe the role of a naive (brute-force) solution for verifying an optimized solution.
4
Random Test Case Generation with Constraints
Implement a program to generate random test cases that adhere to a problem's constraints.
5
Automated Stress Testing: Main vs. Naive Solutions
Write a script to automate stress testing by comparing a main solution against a naive solution.
6
Binary Search Interactive Problems
Solve a standard binary search interactive problem, correctly flushing output to interact with the judge.
Next module isn't ready yet,
Back to course
Previous module
Next module