Akram-Fahim/Specialist-Plan

Summer 2022 Specialist Plan

The included topics so far are:

Dynamic Programming

• Fibonacci
• Knapsack DP
• Knapsack Trace
• Digit DP
• Bitmask DP
• LCS(Longest Common Subsequence)
• LIS(Longest Increasing Subsequence)
• Kadane(Maximum Subarray Sum)
• Minimising Coins

Segment Tree

• Segment Tree
• Segment Tree Node
• Kth One Segment Tree
• Max Subarray Sum Segment Tree

Fenwick Tree/BIT

• Fenwick Tree

Sparse Table/RMQ

• Sparse Table

DSU

• DSU

Number Theory

• Number Theory

Plan by Abdelrahman Fathy, Karim ElMosalamy and Omar Mohammad