Practice & Learning

Master data structures and algorithms with curated resources that lead to external practice platforms.

12
Topics
50+
Resources
3
Learning Paths
5+
Platforms
πŸ—ΊοΈ

Learning Paths

Structured journeys to master competitive programming

Beginner Track

Complete Beginner

Complete journey from zero to competitive programmer

6-8 weeks5 topics
Arrays, Strings, Sorting, Basic Math, Brute Force

Intermediate Track

6 months experience

Master essential data structures and algorithms

12-16 weeks5 topics
Trees, Graphs, DP, Binary Search, Bit Manipulation

Advanced Track

Expert

Prepare for ICPC, Codeforces Div. 1, and top-rated contests

Ongoing5 topics
Advanced Graphs, String Algorithms, Geometry, Game Theory, Heavy DP
πŸ“¦

Data Structures

Essential building blocks for problem solving

Arrays & Strings

Beginner

Basic building blocks - arrays, strings, 2D arrays

Sliding WindowPrefix SumsTwo PointersSubstrings

Linked Lists

Easy

Singly, doubly, circular linked lists and operations

Fast & Slow PointersCycle DetectionReversalMerging

Stacks & Queues

Easy

LIFO and FIFO operations, monotonic stacks

Monotonic StackCustom QueueInfix/PostfixTwo Stacks

Trees & BST

Medium

Binary trees, BST, traversals, balanced trees

DFS/BFSHeight/DepthBST ValidationLowest Common Ancestor

Graphs & Trees (Advanced)

Hard

Graph traversals, shortest paths, connectivity

BFS/DFSDijkstraFloyd-WarshallTopological SortUnion-Find

Hash Tables & Sets

Easy

Hashing, collision resolution, frequency counting

Hash MapsSet OperationsTwo SumSubarray Sum
βš™οΈ

Algorithms

Powerful techniques to solve complex problems efficiently

Searching & Sorting

Easy-Medium

Binary search, merge sort, quicksort, custom comparators

Binary SearchTwo PointersMerge SortHeapsort

Dynamic Programming

Hard

Optimization problems with overlapping subproblems

1D DP2D DPKnapsackLCSKnuth Optimization

Greedy Algorithms

Medium

Local optimal choices leading to global optimum

Activity SelectionFractional KnapsackInterval Scheduling

Backtracking & Recursion

Medium

DFS-based problem solving, permutation generation

N-QueensSubset GenerationPermutationsGame Theory

Binary Search on Answer

Medium

When brute force is too slow, use binary search

Fixed PointPrecision ProblemsOptimization

String Algorithms

Hard

KMP, Trie, Suffix Arrays, Z-algorithm

Pattern MatchingTriesString HashingSuffix Array
🌐

Practice Platforms

External resources to test your skills

Codeforces

The gold standard for competitive programming practice with official contests

All LevelsLive ContestsProblem SetGymEducational Roundsdiv1/div2/div3
Visit β†’

LeetCode

Great for interview prep and weekly practice contests

Beginner-MediumDaily ChallengeTop Interview QsWeekly Contests
Visit β†’

AtCoder

Japanese platform with high-quality problems

Medium-HardABC/ARC/AGC contestsHard problemsEducational DP
Visit β†’

CSES Problem Set

Classic problem collection with step-by-step solutions

IntermediateSortingGraphDynamic ProgrammingString Algorithms
Visit β†’

USACO Guide

Comprehensive training guide with curated problems

All LevelsBronze/Silver/Gold/PlatinumDetailed explanationsPractice problems
Visit β†’

HackerRank

Practice domains with structured tracks

Beginner-IntermediateAlgorithmsData StructuresSQLInterview Prep
Visit β†’

πŸ’‘ Practice Tips

Daily Routine

  • β€’ Solve 2-3 problems daily
  • β€’ Focus on one topic at a time
  • β€’ Keep a problem-solving journal
  • β€’ Review wrong submissions

Contest Strategy

  • β€’ Read all problems first
  • β€’ Start with easier ones
  • β€’ Mock contests regularly
  • β€’ Analyze after each contest

Ready to Start Practicing?

Pick a topic and dive into practice using the external resources above

Note: These resources redirect to external platforms. We're providing curated links to help you practice efficiently. ContestRadar doesn't host problems or judge submissions.