Index of Competitive_Prog_Studies_CN #

• 1. CP - intro and tools
  • 1. Intro to Competitive Programming
    • 1. What is CP
    • 2. Why CP
    • 3. Various Types of Errors
    • 4. How to approach a problem in a competitive programming contest
      • a. Reading problem statements
      • b. IO Format
      • c. Constraints
  • 2. Time and Space Complexity
    • Problems
      • 1. Kadane’s Algorithm
      • 2. LeftRight Sum
  • 3. IO Techniques
    • 1. Console streams
    • 2. C++ File streams
      • 1. Writing to a file
      • 2. Reading from a file
      • 3. Serialization
    • 3. General tricks
  • 4. Language Tools
    • 1. STL - Data Structures
      • 0. Conveniences
        • 1. pair
        • 2. tuple
      • 1. Physical Data Structures
        • 1. Vector
        • 2. List
      • 2. ADTs
        • 2. String
        • 4. Stack
        • 5. Queue
        • 6. Map
        • 7. Set
        • 8. Prioirty Queue
    • 2. Functions
      • 1. Sorting
      • 2. Searching
      • 3. Math functions
      • 4. Utility functions
    • 3. Hussain Set
• 2. Unconventional use of Searching And Sorting
  • 1. Aggressive Cows
  • 2. Inversion Count
  • 3. chef
  • 4. Variation
  • 5. Murder
  • 6. Momos Market
  • 7. Distribute Candies
  • 8. Taj Mahal Entry
• 3. RecursionX
  • 1. BackTracking
    • 1. N Queens Problem - Exercise
    • 2. Rat And Maze problem
    • 3. Sudoku Puzzle
    • 4. Crossword Problem
  • 2. BackTracking Assignment - BackTracking, Binary Search And Merge Sort Problems
    • 1. Find Power of number
    • 2. Sorting the Skills
    • 3. Collecing the balls
    • 4. Sudoku Solver
• 4. Bit Manipulation
  • 1. Shift Operators
  • 2. Remaining Bitwise Operators
  • 3. ith bit
  • 4. Flipping a specific bit
  • 5. Check if oddeven
  • 6. Check if number is power of 2
  • 7. First Set bit
  • 8. Clear all bits from the LSB
• 5. Adhoc Problems
  • 1. Equalize CodeForces
  • 2. Rectangular Area
  • 3. Light up the bulbs
  • 4. Circular List of students
  • 5. Interesting Sequences
  • 6. Winning Strategy
• 6. Dynamic ProgrammingX
  • 1. Classic problems
    • 1. DP Basics - Fibonacci Number
    • 2. AlphaCode
    • 3. Longest Increasing subsequence
    • 4. Largest Bitonic Subsequence
    • 5. Coin change and stair case
    • 6. Minimum Cost
    • 7. Magic Grid
    • Assignments 1
      • 1. Loot Houses - 80
      • 2. Maximum Square Matrix With All Zeros - 80
      • 3. Count BSTs - 80
      • 4. Boredom - 80
      • 5. Minimum Number of Chocolates - 80
      • 6. Minimum Count - 80
    • Assignments 2
      • 1. Hasan and Trip - 40
      • 2. Vanya and GCD - 40
      • 3. Adjacent Bit Counts - 80
      • 4. Roy and Coin Boxes - 80
      • 5. Jon Snow and his favourite number - 80
      • 6. Alyona and Spreadsheet - 80
      • 7. Angry Children - 80
  • 2. Practice Problems
    • Assignment 1
      • 1. LCS - Problem - 80
      • 2. Edit Distance - Problem - 80
      • 3. Balika Vadhu- Problem - 120
      • 4. Knapsnack - Problem - 120
      • 5. PARTY - Problem - 80
      • 6. Subset Sum - Problem - 40
    • Assignment 2
      • 1. Miser Man - 40
      • 2. Trader Profit - 80
      • 3. Charlie and Pilots - 80
      • 4. Square Brackets - 80
      • 5. Distinct Subsequences - 120
      • 6. Smallest Super-Sequence - 80
      • 7. Shortest Subsequence - 80
  • 3. DP & Bitmasking
    • 1. What is bitmasking
    • 2. More about Bitmasking
    • 3. Dynamic Programming with Bitmasking
    • 4. Code Memoization and Recursion
    • 5. Code Iterative
• 7. Greedy Method
  • 1. Introduction to Greedy technique
  • 2. Minimum Absolute difference in an array
  • Assignment 1
    • 1. Min. Absolute Difference In Array - 40
    • 2. Nikunj and Donuts - 40
    • 3. Activity Selection - 80
    • 4. Fractional Knapsack - 40
    • 5. Weighted Job Scheduling - 80
  • Assignment 2
    • 1. Perimeter with conditions - 40
    • 2. Problem discussion - 40
    • 3. Winning Lottery - 40
• 8. GraphsX
  • 1. Connected Components
  • 2. Permutation Swaps
  • 3. Connected Horses
  • 4. Strongly connected components
  • 5. Bottom of the graph
  • 6. Bipartite Graph
  • 7. Fill Matrix
• 9. String Algorithms
  • 1. Pattern Matching Basics
  • 2. KMP algorithm
  • 3. Z-algorithm for pattern matching
• 10. TreesX
  • 1. Tries
    • 1. Tries and XOR
    • 2. Maximum XOR value of subarray
  • 2. Segment Tree
    • 1. Introduction To Segment Tree
    • 2. Building a segment tree
    • 3. Update on a segment tree
    • 4. Query on a Segment Tree
    • 5. Size of a segment tree
    • Assignments
      • 1. Minimum In SubArray - 40
      • 2. Maximum Pair Sum - 80
      • 3. Maximum Sum In Subarray - 120
      • 4. Sum Of Squares - 120
    • zAssignments
      • 1. Counting EvenOdd - 40
      • 2. Vasya vs Rhezo - 40
      • 3. 2 vs 3 - 80
      • 4. Horrible Queries - 120
  • 3. Fenwick Tree
• 11. Number Theory
  • 1. Modulo Arithmetic
    • 1. Modulo operation
    • 2. Modulo properties
    • 3. Modulo properties continued
    • 4. Exercise - number of Binary Trees
  • 2. Prime generator and GCD
    • 1. Primes
      • 1. Find prime numbers between 1 and N
      • 2. Sieve of Eratosthenes
      • 3. Complexity of Sieve of Eratosthenes
    • 2. Euclid’s Algo
      • 1. GCD - Euclid’s Algorithm
      • 2. Complexity of Euclid’s GCD algorithm
      • 3. Diophantine Equations
      • 4. Extended Euclidean Algorithm
    • 3. Multiplicative Modulo Inverse
    • 4. Applications Of NT - 1
      • 1. Sachin and Varun
      • 2. Advanced GCD
  • 3. Totient Function
    • 1. Euler’s Totient Function
    • 2. LCM Sum
  • 4. Solving equations using NT
    • 1. Optimized Power Function
    • 2. Modular exponentiation
    • 3. Matrix Exponentiation
      • 1. Matrix Exponentiation - More Recurrence Relation
      • 2. Matrix Expo Fibonacci Sum
    • 4. Fermat’s Little Theorem
    • 5. Wilson’s Theorem
    • 6. Income on the Nth day
• 12. Game Theory
  • 1. Intro to Game Theory
  • 2. Game of Nim
  • 3. Proof of Nim Formula
  • 4. Grundy Numbers
  • 5. Sprague-Grundy Theorem
  • 6. MinMax Algorithm
• 13. Computational Geometry
  • 1. Intro to Computational Geometry
  • 2. Distance betwn point and line
  • 3. Area of a polygon
  • 4. Intersection of two lines
  • 5. Convex Hull
• 14. FFT
• 15. HLD
  • 1. Intro to HLD
  • 2. Basics of HLD
  • 3. Importance of HLD
  • 4. Complexity of operations
• Home
  • 1. Motivation
  • 2. Roadmap
  • 3. Resources
  • cpbook.net