https://github.com/abuelhassan/competitive-programming-golang
https://github.com/abuelhassan/competitive-programming-golang
algorithms competitive-programming golang leetcode
Last synced: about 1 month ago
JSON representation
- Host: GitHub
- URL: https://github.com/abuelhassan/competitive-programming-golang
- Owner: abuelhassan
- Created: 2020-04-18T02:33:43.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2026-03-18T04:10:36.000Z (3 months ago)
- Last Synced: 2026-03-18T20:29:11.682Z (3 months ago)
- Topics: algorithms, competitive-programming, golang, leetcode
- Language: Go
- Homepage:
- Size: 64.5 KB
- Stars: 4
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## The Inclusion-Exclusion Principle
##### Problems
- [X] SPOJ: [EASYMATH](https://www.spoj.com/problems/EASYMATH/)
- [X] SPOJ: [KPRIMESB](https://www.spoj.com/problems/KPRIMESB/)
- [X] SPOJ: [NGM2](https://www.spoj.com/problems/NGM2/)
- [X] SPOJ: [SQFREE](https://www.spoj.com/problems/SQFREE/) (Hint: Use Mobius function)
- [ ] SPOJ: [SUBSET](https://www.spoj.com/problems/SUBSET/)
- [ ] SPOJ: [IITKWPCH](https://www.spoj.com/problems/IITKWPCH/)
- [ ] SPOJ: [MSKYCODE](https://www.spoj.com/problems/MSKYCODE/)
##### Resources
- [CP-Algorithms - The Inclusion-Exclusion Principle](https://cp-algorithms.com/combinatorics/inclusion-exclusion.html)
## Divide and Conquer DP
##### Problems
- [X] SPOJ: [LARMY](https://www.spoj.com/problems/LARMY/)
- [ ] KATTIS: [money](https://open.kattis.com/problems/money)
##### Resources
- [CP-Algorithms - Divide and Conquer DP](https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html)
## Connected components, bridges, articulations points
##### Definitions (that may not be accurate)
- In a connected undirected graph, a **bridge** is an edge that if removed the graph becomes disconnected.
- In a connected undirected graph, an **articulation point** or a **cut vertex** is a node that if removed the graph
becomes disconnected.
- A **strongly connected component** is a graph where every two nodes are reachable from each others.
##### Problems
- [X] Leetcode: [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/) (Finding Bridges Offline)
- [X] Codeforces: [Round 377 - Div2 F - Tourist Reform](https://codeforces.com/contest/732/problem/F) (Strong Orientation)
##### Resources
- [CP-Algorithms - Finding Bridge Offline](https://cp-algorithms.com/graph/bridge-searching.html)
- [CP-Algorithms - Strong Orientation](https://cp-algorithms.com/graph/strong-orientation.html)
## RMQ
##### Problems
- [X] Spoj: [THRBL](https://www.spoj.com/problems/THRBL/) (Simple - Sparse Table)
- [X] Codeforces: [Round 475 - Div2 D - CGCDSSQ](https://codeforces.com/contest/475/problem/D) (Binary Search + Sparse Table)