{"id":13504773,"url":"https://github.com/just-a-visitor/algorithmic-pseudocode","last_synced_at":"2025-03-29T22:31:08.149Z","repository":{"id":46653112,"uuid":"173902796","full_name":"Just-A-Visitor/Algorithmic-Pseudocode","owner":"Just-A-Visitor","description":"This repository contains the pseudocode(pdf) of various algorithms and data structures necessary for Interview Preparation and Competitive Coding","archived":false,"fork":false,"pushed_at":"2024-04-21T16:32:49.000Z","size":50405,"stargazers_count":765,"open_issues_count":17,"forks_count":168,"subscribers_count":27,"default_branch":"master","last_synced_at":"2024-11-27T06:36:50.483Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","coding-interviews","data-structures","hacktoberfest","interview-practice","interview-preparation","interview-questions","interviews","latex","leetcode","pseudocode"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Just-A-Visitor.png","metadata":{"files":{"readme":"ReadMe.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":"CODE_OF_CONDUCT.md","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":"2019-03-05T08:08:17.000Z","updated_at":"2024-11-25T18:53:14.000Z","dependencies_parsed_at":"2024-11-01T02:31:19.736Z","dependency_job_id":"02983664-ce7c-4615-92f9-baf4f43e3b66","html_url":"https://github.com/Just-A-Visitor/Algorithmic-Pseudocode","commit_stats":null,"previous_names":[],"tags_count":1,"template":true,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Just-A-Visitor%2FAlgorithmic-Pseudocode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Just-A-Visitor%2FAlgorithmic-Pseudocode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Just-A-Visitor%2FAlgorithmic-Pseudocode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Just-A-Visitor%2FAlgorithmic-Pseudocode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Just-A-Visitor","download_url":"https://codeload.github.com/Just-A-Visitor/Algorithmic-Pseudocode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246254077,"owners_count":20747946,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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"}},"keywords":["algorithms","algorithms-and-data-structures","coding-interviews","data-structures","hacktoberfest","interview-practice","interview-preparation","interview-questions","interviews","latex","leetcode","pseudocode"],"created_at":"2024-08-01T00:00:51.103Z","updated_at":"2025-03-29T22:31:03.122Z","avatar_url":"https://github.com/Just-A-Visitor.png","language":"TeX","funding_links":[],"categories":["LaTeX"],"sub_categories":["Misc"],"readme":"\u003cp align=\"center\"\u003e\n  \u003cimg width=\"200\" height=\"200\" src=\"Images/Icon.png\"\u003e\n\u003c/p\u003e\n\n[![Gitter](https://badges.gitter.im/algorithmic-pseudocode/community.svg)](https://gitter.im/algorithmic-pseudocode/community?utm_source=badge\u0026utm_medium=badge\u0026utm_campaign=pr-badge) [![Website shields.io](https://img.shields.io/website-up-down-green-red/http/shields.io.svg)](https://just-a-visitor.github.io/) \n\n**A strange game. The only winning move is not to play**.\n\n# Introduction\nThis repository contains the pseudo-code of various algorithms and data structures necessary for **Interview Preparation** and **Competitive Coding**. The pseudocodes are written such that they can be easily adapted to any language. Let us remove the clutter of language and focus on the core concepts of the question!\n\n\n# Sample GIF\n![Images](Images/Sample.gif)\n\n# Contribution\nRead this section carefully if you are planning on contributing to this repository. \n\n**The What**\n\n* In the `Pseudocode` folder, you can find a lot of algorithms. If you've come across any interesting algorithms that changed the way you think about any topic, please consider contributing it to this repo.\n\n* There are a lot of pseudocodes with no explanation. If you want to write a detailed explanation on the workings and intuition of these algorithms, please raise an issue and start working on it after it is approved). I would prefer if the explanation is in `pdf` format. However, markdown format is equally acceptable.\n\n* If you are familiar with `tikz`, `pgf` or `beamer`, consider making some animations/graphs/diagrams/plots to explain the various algorithms.\n\n* If you want to contribute anything other than pseudocodes, feel free to explore the repository and pick up a code and explain its logic and working (either in `pdf` or `Markdown` format).  If you don't see your desired code, feel free to add it. However, remember that this repository is not a code dump and you should only add new codes if you have written a good post explaining the intricacies of the algorithm.\n\n**The Why**\n\n* You'll understand the algorithm in depth once you start working on its pseudocode because now you need to explain your code to people who code in a variety of languages. \n\n* Your work might help other people preparing for interviews/competitive programming get acquainted with the core concepts of the algorithms rather than being confused by the clutter of the programming language.\n\n* Lastly, you'll get to learn **LaTeX** which is a great experience in itself. \n\n**The How**\n\n* If this is your first time contributing to a public repository, please refer to this [link](https://akrabat.com/the-beginners-guide-to-contributing-to-a-github-project/). For more clarity, you can refer to this [link](https://github.com/MarcDiethelm/contributing).\n\n* If you are not familiar with **TeX** or TypeSetting in general, please refer to this [link](https://www.overleaf.com/learn/latex/Learn_LaTeX_in_30_minutes). You don't need to install anything to contribute to this repository. Just make sure that you have an **Overleaf** account and you are good to go.\n\n* Create an _issue_ if you've decided to work on an algorithm and get it approved before the coding phase. **Please do not start working on the issue before commenting on that particular thread.**\n\n* Make sure to follow the coding standards. Put the source code in a file called `SourceCode.tex`. (Notice the Capitalisation).\n\n* If you want to code a different implementation than what is already present (for example, _iterative_ instead of _recursive_, constant space instead of linear space, etc), please create a new sub-folder inside the root directory.\n\n* Don't include a lot of comments in the pseudocode (it just means that the code is not self-expressive). However, if the algorithm is highly non-trivial and you would like to include some explanation, please do so before or after the pseudocode. Refer to this [link](Pseudocode/Heaps/Median%20in%20a%20Stream%20of%20Integers/Median%20in%20Stream.pdf) for example. \n\n* Do **not** create a **ReadMe** file inside the newly created folder. If you want to submit the code with which you tested your pseudocode, you can add it in the **Validation Codes** folder following the same hierarchy.\n\n* If you borrow the code from any online/offline source, please remember to cite it.\n\n* Finally, **please do not include a `pdf` file of the final source code** (This is to avoid untracked binary in the repo's history). The pdf files would be generated after everything has been finalized.\n\n* Make a pull request. Sit back and relax while your pull request gets merged.\n\n**Stuck?**\n  * If you need any clarifications or are stuck on something for a long time, feel free to ping us. [![Gitter](https://badges.gitter.im/algorithmic-pseudocode/community.svg)](https://gitter.im/algorithmic-pseudocode/community?utm_source=badge\u0026utm_medium=badge\u0026utm_campaign=pr-badge)\n\n\n# Credits\nIcon made by [Freepik](https://www.flaticon.com/authors/freepik) from [Flaticon](https://www.flaticon.com)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjust-a-visitor%2Falgorithmic-pseudocode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjust-a-visitor%2Falgorithmic-pseudocode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjust-a-visitor%2Falgorithmic-pseudocode/lists"}