https://github.com/ramanaditya/data-structure-and-algorithms
All the important concepts associated with Interview and Data Structures and Algorithms. It's just not about the collection.
https://github.com/ramanaditya/data-structure-and-algorithms
algorithm algorithms c codechef codeforces competitive-programming cpp data-structures data-structures-and-algorithms database hackerrank hacktoberfest hacktoberfest-2020 hacktoberfest2020 java javascript leetcode leetcode-solutions python python3
Last synced: about 1 month ago
JSON representation
All the important concepts associated with Interview and Data Structures and Algorithms. It's just not about the collection.
- Host: GitHub
- URL: https://github.com/ramanaditya/data-structure-and-algorithms
- Owner: ramanaditya
- License: mit
- Created: 2018-11-16T07:14:54.000Z (over 6 years ago)
- Default Branch: main
- Last Pushed: 2022-11-16T12:48:13.000Z (over 2 years ago)
- Last Synced: 2025-02-27T11:48:30.490Z (about 2 months ago)
- Topics: algorithm, algorithms, c, codechef, codeforces, competitive-programming, cpp, data-structures, data-structures-and-algorithms, database, hackerrank, hacktoberfest, hacktoberfest-2020, hacktoberfest2020, java, javascript, leetcode, leetcode-solutions, python, python3
- Language: Python
- Homepage: https://interview-docs.readthedocs.io/
- Size: 9.08 MB
- Stars: 86
- Watchers: 2
- Forks: 39
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README


[](https://github.com/ramanaditya/data-structure-and-algorithms/blob/main/LICENSE)
[](https://github.com/ramanaditya/data-structure-and-algorithms/stargazers)
[](https://github.com/ramanaditya/data-structure-and-algorithms/network/members)
[](https://github.com/ramanaditya/data-structure-and-algorithms/)
[](https://github.com/ramanaditya/)
[](https://github.com/ramanaditya/)
## Documentation
[](https://interview-docs.readthedocs.io/en/latest/?badge=latest)This is well documented and maintained at the `Read the Docs`.
Follow the link [https://interview-docs.readthedocs.io](https://interview-docs.readthedocs.io) or click the image below to read the Complete Interview Docs
[](https://interview-docs.readthedocs.io/)
## Community
[](https://gitter.im/data-structure-and-algorithms/community?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge)### Gitter Community
All the discussions related to the **Interview** and **Data Structures and Algorithms** are discussed on the Gitter Community Channel.Follow the link [https://gitter.im/data-structure-and-algorithms/community](https://gitter.im/data-structure-and-algorithms/community) or click the Gitter Logo on the left to join the community
# Contents
- ## [Data Structures](DataStructures)
- [Abstract Data Type](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/DataStructures#abstract-data-type)
- [Computational Complexity Analysis](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/DataStructures#computational-complexity-analysis)
- [Array](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/DataStructures/Array)
- [Linked List](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/DataStructures/LinkedList)
- [Tree](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/DataStructures/tree)
- ## [Algorithms](algorithms)
- ### Array
- [Boyer Moore Majority Vote Algorithm](https://github.com/ramanaditya/data-structure-and-algorithms/blob/main/algorithms/array/boyer-moore-majority-vote-algorithm.md)
- ### Linked List
- [Floyd's Tortoise and Hare](https://github.com/ramanaditya/data-structure-and-algorithms/blob/main/algorithms/LinkedList/floyds_tortoise_and_hare.py)
- ### Searching
- [Searching](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/algorithms/searching)
- ### Sorting
- [Sorting](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/algorithms/Sorting)
- ## [Interview Preparation](interview)
- [Interview Preparation](./interview/README.md)
- [Networking](./interview/networking.md)- ## Solution of Books
- [CLRS](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/CLRS)
- [Cracking the Coding Interview](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/cracking-the-coding-interview)
- [Elements of Programming Interviews]()- ## [Programming Languages](./languages)
- [Python](./languages/python)- ## Competitive Coding
- #### [Codechef](https://github.com/ramanaditya/data-structure-and-algorithms#abstract-data-type)| [Cookoff](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codechef#cook-off-2) | [Long Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codechef#long-challenge) |
| :----------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------: |
| [Easy](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codechef#long-challenge) | |- #### [Codezforces](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codeforces)
| [Div 2](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codeforces#div-2) | [Div 3](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codeforces#div-3) |
| :---: | :---: |
| [April Fools Day](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/codeforces#april-fools-day) | |
- #### [HackerEarth](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/hackerearth)
| [Circuits](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/hackerearth#circuits) | [CodeArena](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/hackerearth#codearena) |
| :---: | :---: |
- #### [HackerRank](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/hackerrank)
- [Random Contest - 1](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/hackerrank#contest--mentorshipkarona-webinar-by-vinit-shahdeo)
- #### [Leetcode](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode)
| | |
| :--- | :--- |
| [array](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#array) | [heap](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#heap) |
| [binary-search](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#binary-search) | [linked-list](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#linked-list) |
| [binary-search-tree](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#binary-search-tree) | [math](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#math) |
| [bit-manipulation](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#bit-manipulation) | [minimax](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#minimax) |
| [Contests](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#contests) | [mock](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#mock) |
| [databases](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#databases) | [Queue](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#Queue) |
| [Design](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#Design) | [sliding-window](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#Sliding-Window) |
| [dfs](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#dfs) | [stack](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#stack) |
| [Dynamic Programming](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#Dynamic-Programming) | [string](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#string) |
| [Geometry](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#Geomtry) | [tree](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#tree) |
| [greedy](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#greedy) | [two pointers](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#two-pointers) |
| [hash-table](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#hash-table) | |
| | |
| [LeetCode Discuss](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#leetcode-discuss) | |
| | |
| [April '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#April-LeetCoding-Challenge--2020) | [May '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#May-LeetCoding-Challenge--2020) |
| [June '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#June-LeetCoding-Challenge--2020) | [July '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#July-LeetCoding-Challenge--2020) |
| [August '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#August-LeetCoding-Challenge--2020) | [September '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#September-LeetCoding-Challenge--2020) |
| [November '20 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#November-LeetCoding-Challenge--2020) | [January '21 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#January-LeetCoding-Challenge--2021) |
| [April '21 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#April-LeetCoding-Challenge--2021) | [May '21 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#May-LeetCoding-Challenge--2021) |
| [June '21 Challenge](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode#June-LeetCoding-Challenge--2021) | |
## Resources#### Books
- [CLRS](https://mitpress.mit.edu/books/introduction-algorithms-third-edition)
- [Cracking the Coding Interview](http://www.crackingthecodinginterview.com/)
- [Elements of Programming Interviews](https://elementsofprogramminginterviews.com/)#### Competitive Coding
- [Codechef](https://www.codechef.com/)
- [Codeforces](https://codeforces.com/)
- [HackerEarth](https://www.hackerearth.com/challenges/)
- [HackerRank](https://www.hackerrank.com/)
- [Leetcode](https://leetcode.com/)#### Online Study Materials
- [Free Code Camp](https://www.freecodecamp.org/)
- [GeeksforGeeks](https://www.geeksforgeeks.org/)
## Issues
[](https://github.com/ramanaditya/data-structure-and-algorithms/issues)
[](https://github.com/ramanaditya/data-structure-and-algorithms/)
[](https://github.com/ramanaditya/data-structure-and-algorithms/compare)
[](https://github.com/ramanaditya/data-structure-and-algorithms/pulls?q=is%3Apr+is%3Aclosed)> 1. Graph Algorithm
> 2. Solutions of CLRS
> 3. String Algorithms
>**NOTE**: **Feel free to [open issues](https://github.com/ramanaditya/data-structure-and-algorithms/issues/new/choose)**. Make sure you follow the Issue Template provided.
## Contribution Guidelines
[](https://github.com/ramanaditya/data-structure-and-algorithms/)
[](https://github.com/ramanaditya/data-structure-and-algorithms/commits/)
[](https://github.com/ramanaditya/data-structure-and-algorithms/)
[](https://github.com/ramanaditya/data-structure-and-algorithms/pulls)- Write clear meaningful git commit messages (Do read [this](http://chris.beams.io/posts/git-commit/)).
- Make sure your PR's description contains GitHub's special keyword references that automatically close the related issue when the PR is merged. (Check [this](https://github.com/blog/1506-closing-issues-via-pull-requests) for more info)
- When you make very very minor changes to a PR of yours (like for example fixing a text in button, minor changes requested by reviewers) make sure you squash your commits afterward so that you don't have an absurd number of commits for a very small fix. (Learn how to squash at [here](https://davidwalsh.name/squash-commits-git))
- When you're submitting a PR for a UI-related issue, it would be really awesome if you add a screenshot of your change or a link to a deployment where it can be tested out along with your PR. It makes it very easy for the reviewers and you'll also get reviews quicker.
- Please follow the [PR Template](https://github.com/ramanaditya/data-structure-and-algorithms/blob/main/.github/PULL_REQUEST_TEMPLATE.md) to create the PR.
- Always open PR to `develop` branch.
- Please read our [Code of Conduct](./CODE_OF_CONDUCT.md).
- Refer [this](https://github.com/ramanaditya/data-structure-and-algorithms/blob/main/CONTRIBUTING.md) for more.
## Contributor
[](https://github.com/ramanaditya/data-structure-and-algorithms/graphs/contributors)[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/0)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/1)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/2)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/3)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/4)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/5)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/6)
[](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/7)- **Aditya Raman** : [www.ramanaditya.com](http://www.ramanaditya.com)
- LinkedIn : [https://www.linkedin.com/in/ramanaditya/](https://www.linkedin.com/in/ramanaditya/)
- GitHub : [https://github.com/ramanaditya](https://github.com/ramanaditya)
- LeetCode : [https://leetcode.com/ramanaditya/](https://leetcode.com/ramanaditya/)
- CodeChef : [https://www.codechef.com/users/ramanaditya](https://www.codechef.com/users/ramanaditya)
- HackerEarth : [https://www.hackerearth.com/@ramanaditya](https://www.hackerearth.com/@ramanaditya)
- HackerRank : [https://www.hackerrank.com/ramanaditya](https://www.hackerrank.com/ramanaditya)> If you like this [repository](https://github.com/ramanaditya/data-structure-and-algorithms), support it by star :star2:
| Community | Documentation | Source Code |
|:---------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|
| [](https://gitter.im/data-structure-and-algorithms/community) ||
|
| **Gitter** | **Read the Docs** | **GitHub** |
| [Join Now](https://gitter.im/data-structure-and-algorithms/community) | [Read the Docs](https://interview-docs.readthedocs.io/) | [View Code](https://github.com/ramanaditya/data-structure-and-algorithms) |