Skip to content

Latest commit

 

History

History
91 lines (56 loc) · 3.9 KB

README.md

File metadata and controls

91 lines (56 loc) · 3.9 KB
Raw

🎯 CP Circus - Competitive Programming Sessions

Welcome to CP Circus, the ultimate spot for all things Competitive Programming! 🎉 Whether you're here to sharpen your skills, revisit past sessions, or just explore some cool code, you've landed at the right place. Let's dive into the magic of algorithms and data structures together! 💻✨

📅 What's this Repository?

This repository is home to all the code, resources, and materials for our weekly Competitive Programming sessions. Every week, we deep dive into a new topic, solve problems, and discuss strategies to crack even the toughest challenges. If you missed a session or want to practice more, you’ll find everything you need right here! 🏆

🛠️ Structure

The repo is structured by session topics, with each topic having its own directory. Here's a quick rundown:

  • Divide_and_Conquer_Segment_Tree/
    Dive into Divide & Conquer techniques and master the Segment Tree! 🌳

  • Sparse_Table/
    Conquer range queries with the power of Sparse Tables! 📊

  • DP_Memoization_Building_Table/
    All about Dynamic Programming - from memoization to table building! 🧠

  • DP_Digits_Masks/
    Level up your DP skills with digit and bitmask tricks! 🔢🔣

  • DP_Optimization_DS_Cumulative_Sum/
    Optimize DP with Data Structures and cumulative sums! 🚀

  • Trie_Prefix_Tree/
    Get comfy with Tries for efficient string manipulations! 🌲

  • KMP_Prefix_Function_DP/
    Learn to search strings efficiently with KMP and prefix functions! 🔍

  • DSU_Persistent_DS_MST/
    Master Disjoint Set Union with persistence and explore MSTs! 🔗

  • SQRT_Decomposition_MO/
    Tackle range queries with SQRT Decomposition and Mo's Algorithm! 🧮

  • Binary_Lifting_LCA_Optimization/
    Optimize Lowest Common Ancestor problems using Binary Lifting! 🔝

  • Queries_on_Trees_Euler_Walk_MO/
    Queries on Trees? Euler Walk and Mo on trees got you covered! 🌳🏃

  • DSU_on_Trees_Sack_HLD/
    Dive deep into DSU on Trees, Sack, and Heavy-Light Decomposition! 🧩

  • Matrix_Expo_DP_Optimization/
    Optimize DP using Matrix Exponentiation! 🧠💥

  • Xor_Basis/
    Explore the power of XOR in Competitive Programming! 💡

Each directory contains:

  • Code snippets used in the session.
  • Problem solutions with explanations.
  • Additional resources to deepen your understanding.

🚀 Getting Started

  1. Clone the repo:

    git clone https://github.com/YourUsername/CP-Circus.git
cd CP-Circus

  2. Navigate to the topic you’re interested in and explore the code and resources!

📚 Resources

Did you miss a session? No worries! Check out the session recordings on our YouTube Channel and join the discussion on our Discord Server. On the Discord server, you can find channels for announcements, material, and discussion on problems.

💬 Join the Community

We’re all about learning and growing together. Do you have questions, suggestions, or want to hang out with fellow CP enthusiasts? Join our Telegram Channel and be part of the CP Circus family! 🎪

🤝 Contributing

We welcome contributions from everyone! Whether solving a new problem, optimizing existing code, or adding more resources, your input is valuable. Just fork the repo, make your changes, and submit a pull request. Let’s build this knowledge base together! 🤗

⭐️ Show Your Support

If you find this repository helpful, please give it a ⭐️! It helps more people discover our work and join the CP Circus community.

📂 Judge Group for Sheets

Check out our Vjudge Group for access to session sheets and other useful materials.

🎉 Happy Coding & Keep Conquering! 🚀