{"id":65051,"url":"https://github.com/hkirat/Algorithmic-Resources","name":"Algorithmic-Resources","description":"A Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding.","projects_count":92,"last_synced_at":"2026-07-15T10:00:29.068Z","repository":{"id":1781058,"uuid":"44774426","full_name":"hkirat/Algorithmic-Resources","owner":"hkirat","description":"A Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding.","archived":false,"fork":false,"pushed_at":"2024-07-16T13:38:46.000Z","size":61,"stargazers_count":1795,"open_issues_count":27,"forks_count":549,"subscribers_count":46,"default_branch":"master","last_synced_at":"2026-06-27T02:02:36.853Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"cc0-1.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hkirat.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2015-10-22T21:30:44.000Z","updated_at":"2026-06-22T18:07:52.000Z","dependencies_parsed_at":"2024-01-14T04:44:46.808Z","dependency_job_id":"b98184e0-e291-4e81-ba0f-a179d4179c2f","html_url":"https://github.com/hkirat/Algorithmic-Resources","commit_stats":{"total_commits":64,"total_committers":8,"mean_commits":8.0,"dds":0.140625,"last_synced_commit":"5c875aa3ee12f8996b73c626607de75ac4a4a0a5"},"previous_names":["hkirat/awesome-competitive-coding"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hkirat/Algorithmic-Resources","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hkirat%2FAlgorithmic-Resources","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hkirat%2FAlgorithmic-Resources/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hkirat%2FAlgorithmic-Resources/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hkirat%2FAlgorithmic-Resources/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hkirat","download_url":"https://codeload.github.com/hkirat/Algorithmic-Resources/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hkirat%2FAlgorithmic-Resources/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35499864,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-15T02:00:06.706Z","response_time":131,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"created_at":"2024-08-12T17:01:10.781Z","updated_at":"2026-07-15T10:00:29.068Z","primary_language":null,"list_of_lists":false,"displayable":true,"categories":["Prefix and Suffix Trees","Arrays","Binary Search and Ternary Search","Dynamic Programming","Flow","Game Theory","Graphs","Greedy","Maths","Matrix Exponentiation","Miscellaneous","Binary Indexed Trees","Segment Trees","Trees"],"sub_categories":[],"readme":"# Algorithmic Resources\n\nA Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding.\n\nTopics\n---\n - [Arrays](#arrays)\n - [Binary and Ternary Search](#binary-and-ternary-search)\n - [Dynamic Programming](#dynamic-programming)\n - [Flow](#flow)\n - [Game Theory](#game-theory)\n - [Graphs](#graphs)\n - [Greedy](#greedy)\n - [Maths](#maths)\n - [Matrix Exponentiation](#matrix-exponentiation)\n - [Miscellaneous](#miscellaneous)\n - [Prefix and Suffix Trees](#prefix-and-suffix-trees)\n - [Binary Indexed Trees](#binary-indexed-trees)\n - [Segment Trees](#segment-trees)\n - [Trees](#trees)\n\n## Arrays\n---\n - Questions\n\n \t- [Sweets - Array](https://kira.acadcare.com/course/cpp-competitive-prog/lecture/5cc09ff84df01f024022c872/content/5cc0a5f3793a8e193a604b35)\n \t- [Prefix and Suffix](https://kira.acadcare.com/course/cpp-competitive-prog/lecture/5cc09ff84df01f024022c872/content/5cc0a0f74df01f024022c874)\n \t- [Holiday Season](https://kira.acadcare.com/course/cpp-competitive-prog/lecture/5cc09ff84df01f024022c872/content/5cc3f1f04df01f024022c876)\n \t- [Largest Number](https://kira.acadcare.com/course/cpp-competitive-prog/lecture/5cc09ff84df01f024022c872/content/5cc3f2c34df01f024022c878)\n\t- [Marbles](https://kira.acadcare.com/course/cpp-competitive-prog/lecture/5cc09ff84df01f024022c872/content/5cc3f31f4df01f024022c87a)\n\t- [Wave Array](https://kira.acadcare.com/course/cpp-competitive-prog/lecture/5cc09ff84df01f024022c872/content/5cd67eabe5d6f744d50f59b5)\n\t\n\n\n\n## Binary Search and Ternary Search\n---\n*Binary Search : The process of exploiting the property of an array of being sorted to arrive at answers of questions in non linear time.*\n\n*Ternary Search : The process of exploiting the property of a function having double diffrential of a constant sign to arrive to results in non linear time.*\n\n - Theory\n\n \t- [Hackerearth](https://www.hackerearth.com/notes/power-of-binary-search/) - Power of Binary search by [Aman Goel](https://www.hackerearth.com/users/amangoel.vsec/) (Easy).\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/) - Binary Search by [lovro](https://www.topcoder.com/member-profile/lovro/) (Hard).\n \t- [Hackerearth](https://www.hackerearth.com/practice/algorithms/searching/ternary-search/tutorial/) - Tutorial on Ternary Search.\n\n - Questions on\n\n \t- [Codeforces](http://codeforces.com/problemset/tags/binary%20search)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=40)\n \t- [Codechef](https://discuss.codechef.com/tags/binarysearch/)\n\n## Dynamic Programming\n---\n*Used to solve questions which can be broken down into smaller sub problems.It involves the technique of saving the result of a problem for future reference.*\n\n - Theory\n\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/) - Dynamic Programming from Novice to Advanced.\n \t- [Codechef](https://www.codechef.com/wiki/tutorial-dynamic-programming) - Tutorial on Dynamic Programming.\n \t- [Quora](https://www.quora.com/How-can-one-start-solving-Dynamic-Programming-problems/) - Getting started with Dynamic Programming (Quora Discussion).\n\n - Questions on\n\n \t- [Hackerrank](https://www.hackerrank.com/domains/algorithms/dynamic-programming)\n \t- [spoj](http://problemclassifier.appspot.com/?keywords=dp)\n \t- [More Problems on SPOJ](http://apps.topcoder.com/forums/;jsessionid=C684F032169B7439C8012AAB6BA2018C?module=Thread\u0026threadID=674592)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=33)\n \t- [Codeforces](http://codeforces.com/problemset/tags/dp)\n\n## Flow\n---\n\n - Theory\n\n \t- [Topcoder - Max Flow Part 1](https://www.topcoder.com/community/data-science/data-science-tutorials/maximum-flow-section-1/)\n \t- [Topcoder - Max Flow Part 2](https://www.topcoder.com/community/data-science/data-science-tutorials/maximum-flow-section-2/)\n\n - Questions\n\n \t- [spoj](http://problemclassifier.appspot.com/?keywords=flow)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=12)\n\n## Game Theory\n---\n*Used to solve problems involving mathematical modelling of conflict and cooperation among rational players.*\n\n - Theory\n\t- [Stanford](http://web.stanford.edu/class/cs97si/05-combinatorial-games.pdf) - PDF on Combinatorial Games.\n\t- [Wikipedia](https://en.wikipedia.org/wiki/Nim) - Introduction to Nim Games.\n\t- [Book](http://www.cs.ox.ac.uk/files/2735/Composite_games.pdf) - Composite Mathematical Games.\n\t- [Book](http://www.math.ucla.edu/~tom/Game_Theory/comb.pdf) - Game Theory By Thomas S. Ferguson.\n\t- [Wikipedia](https://en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem) - Sprague Grundy Theorem.\n\t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/algorithm-games/) - Introduction to Algorithmic Games.\n\n - Questions on \n\t- [A2oj](http://a2oj.com/Category.jsp?ID=91)\n\n## Graphs\n---\n*A graph consists of nodes and the interconnection between them.The problems involve finding shortest distance, connectivity and flow.*\t\n\n - Theory\n\n \t- [Topcoder](https://topcoder.com)\n \t\t- [Identifying a graph on Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-1/)\n \t\t- [Searching in a Graph](https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-2/)\n \t\t- [Path Algorithms](https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-3/)\n \t- [Codeforces](http://codeforces.com/blog/entry/16221) - Important Graph Algorithms by [PrinceOfPersia](http://codeforces.com/profile/PrinceOfPersia)\n \t- [Codechef](https://www.codechef.com/wiki/tutorial-graph-theory-part-1) - Tutorial on Graph Theory - part 1\n\n - Questions on\n\n \t- [Codeforces](http://codeforces.com/problemset/tags/graphs)\n \t- [Codechef](https://discuss.codechef.com/tags/graph/)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=13)\n\n## Greedy\n---\n*Greedy problems involve solving a problem statement considering the most greedy, i.e. most optimal solution at the given time without taking into consideration the future effects of it.*\n\n - Theory\n\n  \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/) - Greedy is Good.\n  \t- [Stackoverflow.](http://stackoverflow.com/questions/7887487/how-to-spot-a-greedy-algorithm) - Tutorial on how to spot a greedy algorithm.\n  \t- [Hackerearth](https://www.hackerearth.com/notes/greedy-algorithm/) - Tutorial on greedy algorithms by [Akash Sharma](https://www.hackerearth.com/users/r3gz3n/).\n\n - Questions on\n\n  \t- [Codeforces](http://codeforces.com/problemset/tags/greedy)\n  \t- [A2oj](http://a2oj.com/Category.jsp?ID=56)\n\n## Maths\n---\n*Problem related to mathematics are quite common in the domain of competitive programming.It involved topics like geometry, algebra, discrete mathematics and probability.*\n\n - Theory\n\n \t- [Stanford](http://web.stanford.edu/class/cs97si/02-mathematics.pdf) - Stanford's Guide on Introduction To Competitive Programming.\n \t- [Aduni](http://www.aduni.org/courses/discrete/index.php?view=cw) - Course Guide to Discrete Mathematics.\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/understanding-probabilities/) - Understanding Probability.\n\n - Questions on \n \n \t- [A2oj](http://a2oj.com/Category.jsp?ID=86)\n \t- [Codechef](https://discuss.codechef.com/tags/simple-math/) - Basic\n \t- [Codechef](https://discuss.codechef.com/tags/maths/) - Advanced\n\n## Matrix Exponentiation\n---\n*Used to solve problems which involve finding a solution to a given series by using exponentiation property on multiplication of matrices.The complexity is thus reduced to logrithmic from linear.*\n\n - Theory\n\n \t- [zobayer](http://zobayer.blogspot.in/2010/11/matrix-exponentiation.html) - Introduction to Matrix exponentiations\n \t- [Quora](https://threads-iiith.quora.com/Solving-Dynamic-Programming-with-Matrix-Exponentiation) - Solving Dynamic Programming with Matrix Exponentiation.\n\t- [Codechef](https://discuss.codechef.com/questions/49614/linear-recurrence-using-cayley-hamilton-theorem) - Solving Recurrences using Cayley Hamilton Theorem and Matrix Exponentiation\n\n - Questions on\n\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=32)\n\t- [POWSUM on CodeChef](https://www.codechef.com/problems/POWSUMS)\n\n## Miscellaneous\n---\n\n - Mo's Algorithm\n \t- [Blog Post By Anudeep Nekkanti](http://blog.anudeep2011.com/mos-algorithm/)\n \t- [Hackerearth](https://www.hackerearth.com/notes/mos-algorithm/)\n \t- [DQUERY on Spoj](http://www.spoj.com/problems/DQUERY/en/)\n \t- [FREQUENT on Spoj](http://www.spoj.com/problems/FREQUENT/)\n\n - Persistant Segment Trees\n \t- [Blog Post By Anudeep Nekkanti](http://blog.anudeep2011.com/persistent-segment-trees-explained-with-spoj-problems/)\n \t- [MKTHNUM on Spoj](http://www.spoj.com/problems/MKTHNUM/en/)\n\n - Mobius Function\n \t- [Dance With Mobius Function by Surya Kiran](https://www.quora.com/profile/Surya-Kiran/Posts/A-Dance-with-Mobius-Function)\n\n - Treaps\n \t- [Codeforces](http://codeforces.com/blog/entry/11148)\n \t- [Wikipedia](https://en.wikipedia.org/wiki/Treap)\n \t- [TREAP on Spoj](http://www.spoj.com/problems/TREAP/)\n\n - Bit Manipulation\n\t- [Hackerearth](https://www.hackerearth.com/notes/bit-manipulation/) - Tutorial on Bit Manipulation by [Prateek Garg](https://www.hackerearth.com/users/ptk23/).\n\t- [Hackerrank](https://www.hackerrank.com/domains/algorithms/bit-manipulation) - Questions On Hackerrank on bit manipulation.\n\n - Other Resources\n \t- [Data Structures](http://codeforces.com/blog/entry/15729) - A guide to high level data structures by [PrinceOfPersia](http://codeforces.com/profile/PrinceOfPersia)\n\n## Prefix and Suffix Trees\n---\n*Tries are some kind of rooted trees in which each edge has a character on it.*\n\n - Theory\n\n \t- [Wikipedia](https://en.wikipedia.org/wiki/Trie) - Introduction to Tries.\n \t- [Marknelson](http://marknelson.us/1996/08/01/suffix-trees/) - Tutorial on prefix and suffix trees by Sartaj Sahni\n \t- [Marknelson](http://marknelson.us/1996/08/01/suffix-trees/) - Suffix Trees Explained.\n\t- [Geeksforgeeks](http://www.geeksforgeeks.org/trie-insert-and-search/) - Trie, Insertion and Search\n\t- [Geeksforgeeks](http://www.geeksforgeeks.org/trie-delete/) - Trie, Deletion.\n\n\n - Questions on\n\n \t- [Codechef](https://www.codechef.com/problems/TWSTR/)\n \t- [Another problem on Codechef](https://www.codechef.com/SEPT13/problems/TMP01)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=49)\n\n## Binary Indexed Trees\n---\n*A Fenwick tree or binary indexed tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.*\n\n - Theory\n\n  - [Hackerearth](https://www.hackerearth.com/practice/notes/binary-indexed-tree-or-fenwick-tree/) \n  - [Wikipedia](https://en.wikipedia.org/wiki/Fenwick_tree) - Fenwick Tree (data structure)\n  - [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-indexed-trees/)\n - Questions on\n  - [A2oj](https://a2oj.com/Category.jsp?ID=26)\n\n## Segment Trees\n---\n*Segment tree is a tree for which each node represents an interval.*\n\n - Theory\n\n\t- [Hackerearth](https://www.hackerearth.com/notes/segment-trees-for-beginners/) - Segment trees for Beginners by [Ayush Agrawal](https://www.hackerearth.com/users/ayusha1107/).\n \t- [Codeforces](http://codeforces.com/blog/entry/15890) - Everything about Segment trees by [PrinceOfPersia](http://codeforces.com/profile/PrinceOfPersia)\n\t- [Lazy Propogation](http://se7so.blogspot.in/2012/12/segment-trees-and-lazy-propagation.html) - Solving problems related to updation of segment tree in logrithmic time (also known as lazy propogation).\n\n - Questions on\n\n \t- [Codechef](https://discuss.codechef.com/tags/segment-tree/)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=25)\n\n## Trees\n---\n*A tree is a data structure made up of nodes or vertices and edges without having any cycle.*\n\n - Theory\n\n \t- [Hackerearth](https://www.hackerearth.com/notes/trees/) - Baisc introduction to trees and terminologies related to it by [Anuj Garg](https://www.hackerearth.com/users/anuj09garg/)\n \t- [Wikipedia](https://en.wikipedia.org/wiki/Tree_(data_structure)) - Tree (data structure)\n\n - Questions on\n\n \t- [Hackerrank](https://www.hackerrank.com/domains/data-structures/trees)\n \t- [Codechef](https://discuss.codechef.com/tags/trees/)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=89)\n \t- [Codeforces](http://codeforces.com/problemset/tags/trees)\n","projects_url":"https://awesome.ecosyste.ms/api/v1/lists/hkirat%2Falgorithmic-resources/projects"}