a-liut/CompetitiveProgramming

CompetitiveProgramming

Problems (55>)

• Introduction

• Leaders in array (http://practice.geeksforgeeks.org/problems/leaders-in-an-array/0)

• Kadane's algorithm (http://practice.geeksforgeeks.org/problems/kadanes-algorithm/0)

• Missing number in array (http://practice.geeksforgeeks.org/problems/missing-number-in-array/0)

• Trapping rain water (http://practice.geeksforgeeks.org/problems/trapping-rain-water/0)

• Sliding window maximum (http://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k/0)

• Next larger element (http://practice.geeksforgeeks.org/problems/next-larger-element/0)

• Towers (http://codeforces.com/problemset/problem/37/A?locale=en)

• Finding team member (http://codeforces.com/problemset/problem/579/B?locale=en)

• Searching and sorting

• Inversion count (http://www.spoj.com/problems/INVCNT/)

• Largest even number (http://practice.geeksforgeeks.org/problems/largest-even-number/0)

• Trees

• Firing employees (http://practice.geeksforgeeks.org/problems/firing-employees/0)

• Check for BST (http://practice.geeksforgeeks.org/problems/check-for-bst/1)

• Preorder traversal and BST (http://practice.geeksforgeeks.org/problems/preorder-traversal-and-bst/0)

• Maximum path sum (http://practice.geeksforgeeks.org/problems/maximum-path-sum/1)

• Prefix sum: Binary indexed tree

• Ilya and Queries (http://codeforces.com/problemset/problem/313/B?locale=en)

• Alice, Bob and chocolate (http://codeforces.com/problemset/problem/6/C?locale=en)

• Number of ways (http://codeforces.com/problemset/problem/466/C?locale=en)

• Little girl and maximum sum (http://codeforces.com/problemset/problem/276/C?locale=en)

• Update the array (http://www.spoj.com/problems/UPDATEIT/)

• STL

• Megacity (http://codeforces.com/problemset/problem/424/B?locale=en)

• Find pair (http://codeforces.com/problemset/problem/160/C?locale=en)

• Two heaps (http://codeforces.com/problemset/problem/353/B?locale=en)

• Segment Trees

• Circular RMQ (http://codeforces.com/problemset/problem/52/C)

• BIT and sparse table for static RMQ

• Nested segments (http://codeforces.com/problemset/problem/652/D?locale=en)

• Pashmak and Parmida's problem (http://codeforces.com/problemset/problem/459/D?locale=en)

• Mo's algorithm

• Powerful array (http://codeforces.com/contest/86/problem/D)

• Tree and queries (http://codeforces.com/contest/375/problem/D)

• Graphs: BFS, DFS, Topological sort

• X total shapes (http://practice.geeksforgeeks.org/problems/x-total-shapes/0)

• isBipartite (http://practice.geeksforgeeks.org/problems/bipartite-graph/1)

• Fox and names (http://codeforces.com/problemset/problem/510/C?locale=en)

• Graphs: SCC, Single-Source shortest path

• Learning languages (http://codeforces.com/problemset/problem/277/A?locale=en)

• Checkposts (http://codeforces.com/problemset/problem/427/C?locale=en)

• HLD and Centroid Decomposition of Trees

• OPTIONAL: Xenia and Tree (http://codeforces.com/problemset/problem/342/E?locale=en)

• Graphs: Minimum spanning tree

• Minimum spanning tree (http://www.spoj.com/problems/MST/)

• Greedy algorithms

• N meetings in one room (http://practice.geeksforgeeks.org/problems/n-meetings-in-one-room/0)

• Magic numbers (http://codeforces.com/problemset/problem/320/A?locale=en)

• Wilbur and array (http://codeforces.com/problemset/problem/596/B?locale=en)

• Alternative thinking (http://codeforces.com/problemset/problem/603/A?locale=en)

• Lexicographically maximum subsequence (http://codeforces.com/problemset/problem/196/A?locale=en)

• Woodcutters (http://codeforces.com/contest/545/problem/C?locale=en)

• Queue (http://codeforces.com/problemset/problem/141/C?locale=en)

• Dynamic programming

• Longest common subsequence (https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0)

• 0-1 Knapsack (http://www.practice.geeksforgeeks.org/problem-page.php?pid=909)

• Longest increasing subsequence (https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence/0)

• Minimum number of jumps (https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0)

• Edit distance (https://practice.geeksforgeeks.org/problems/edit-distance/0)

• Longest bitonic subsequence (https://practice.geeksforgeeks.org/problems/longest-bitonic-subsequence/0)

• Subset sum (https://practice.geeksforgeeks.org/problems/subset-sum-problem/0)

• Vertex cover (http://www.spoj.com/problems/PT07X/)

• Longest palindromic subsequence (https://practice.geeksforgeeks.org/problems/longest-palindromic-subsequence/0)

• String algorithms

• *Longest prefix suffix (https://practice.geeksforgeeks.org/problems/longest-prefix-suffix/0)

• Shift the string (https://www.codechef.com/problems/TASHIFT)

• Others:

• Array copy (https://github.com/rossanoventurini/CompetitiveProgramming/blob/master/Exams/Text23012018.pdf)

• Triplets (https://github.com/rossanoventurini/CompetitiveProgramming/blob/master/Exams/Text14022018.pdf)