problem-solving
Problem Solving
A heaven for competitive programmers
What this repository is about
This repository is created to organize the solutions of problems related to data structures and algorithms. And if possible, provide an easier way for learning various concepts related to data structures and algorithms.
Table of contents
- Ad Hoc
- Amortized Analysis
- Brute Force
- Computational Geometry
- Data Structure
- Dynamic Programming
- Game
- Graph
- Greedy
- Hashing
- Math
- Non-Overlapping Subproblem
- Search
- String
Each topic is divided into numerous subtopics, such as you’d find list, stack, priority_queue, segment_tree, treap, link_cut_tree etc. under data_structure category. We encourage you add more topic in this list.
Languages used (till now)
- C
- C++
- Java
- PHP
- Python
- Ruby
- JavaScript(NodeJS)
- Racket(Formerly known as
PLT Sceme)
This languages have been used till now. But we always welcome more new languages whether it is C#, Bash or Brainfuck. We welcome each and every computer language that exists in this universe.
Problems used from the following judges
- Codeforces
- Codechef
- Timus
- UVa
- UVaLive
- Hackerrank
- Hackerearth
- Lightoj
- Spoj
- Leetcode
- Project Euler
- Atcoder
Learning from this repository
You can start learning from this repository right away. If you are a beginner, start your journey from here or you can just jump right into your choice of topics.
Contributing
It’s very easy to contribute to this repository. If you’ve already started solving algorithmic problems, you can start right away. To learn details about contributing, please read this guide.
License
This repository is published under MIT License. To know more about license please visit this link.
Acknowledgements
To all the contributors and code reviewers.