Leetcode solutions - All algorithms implemented in Python 3 (for education)

Overview

LeetCodeGuide

Contributors Issues Open Pull Requests Last Commit Stars Forks Watchers License

Table of Contents

All algorithms implemented in Python 3 (for education)

There implementations are for learning purposes. If you want to contribute more efficient solutions feel free to open an issue and commit your solution.

Inspiration

You can look for Algorithms to implement at: LeetCode Algorithms

To contribute make sure the Algorithm isn't commited yet! Make sure to add the number of the Issue in your PR.

Contributing Guidelines

Folders and Files

Please make sure your file is in the LeetCode-Folder and Named like this: 0001_TwoSum.py -> 4-digit Number of the LeetCode Issue, Underscore, LeetCodeName

Opening Issues

When you open an issue, please make sure the Problem is not already implemented (Look at Code/Leetcode for the Problemnumber). Opened Issues by existing Problem will be closed & PR made to this Issue marked as spam The Contributer who opened an issue will be assigned prefered to the issue. If there is no PR within about 7 Days the issue will be assigned to another Contributer.

Pull Requests

Only Pull Requests joined with an Issue and matching the naming-conventions (See Folders and Files) will be merged! If there is no Issue joined in the PR your PR will be labeld as spam and closed. If your code don't passes the Check on LeetCode.com your PR will be labeld as "invalid" and the Issue stays open for the next PR! If your PR doesn' follow the Contributing Guidelines of this Repository it will be also marked as spam and closed!

Spam Users

Users who spam this Repo with PRs/Issues that does not align the Contribution Guidelines will be blocked.

Getting Started

  • Fork this repository (Click the Fork button, top right of this page)
  • Clone your fork down to your local machine
git clone https://github.com/your-username/pythonalgorithms.git
  • Comment to the Issue you want to work on - so I can assign you to it OR create a new Issue from a LeetCode Problem that is not implemented yet
  • Create a branch for a new feature
git checkout -b feature/branch-name
  • Or if its a bugfix to a file
git checkout -b bugfix/branch-name
  • Make your changes (choose from the Tasks above!)
  • Commit and Push
git add .
git commit -m 'commit message'
git push origin branch-name
  • Create a New Pull Request from your forked repository ( Click the 'New Pull Request' Button located at the top of your repo)
  • Wait for your PR review and merge approval!
  • Star this repository if you had fun!

Which PR will be accepted?

  • Ones you are assigned to
  • Your PR has to link the Issue
  • Your Solution must be correct - you can check first on LeetCode (submit) if it works on different test-cases

Which PRs will be NOT accepted?

  • Ones you are NOT assigned to
  • Your PR is NOT linked to the Issue you are linked to
  • Your Solution is not correct
  • Your PR contains more than the .py file
  • PRs that "correct" Typos or spam files with comments
  • PRs that "correct" Coding Styles - Please accept that everybody has a different style

Hacktoberfest

During October there come pretty much PRs and Issues - Please be patient because of my fulltime job I cannot be online 24/7 - I do my best to work through your PRs as soon as possible.

Thank You!

Owner
Vineet Dhaimodker
Graduate student at UCR. Working in Data science and machine learning technologies.
Vineet Dhaimodker
A mutable set that remembers the order of its entries. One of Python's missing data types.

An OrderedSet is a mutable data structure that is a hybrid of a list and a set. It remembers the order of its entries, and every entry has an index nu

Elia Robyn Lake (Robyn Speer) 173 Nov 28, 2022
Array is a functional mutable sequence inheriting from Python's built-in list.

funct.Array Array is a functional mutable sequence inheriting from Python's built-in list. Array provides 100+ higher-order methods and more functiona

182 Nov 21, 2022
Programming of a spanning tree algorithm with Python : In depth first with a root node.

ST Algorithm Programming of a spanning tree algorithm with Python : In depth first with a root node. Description This programm reads informations abou

Mathieu Lamon 1 Dec 16, 2021
An esoteric data type built entirely of NaNs.

NaNsAreNumbers An esoteric data type built entirely of NaNs. Installation pip install nans_are_numbers Explanation A floating point number is just co

Travis Hoppe 72 Jan 01, 2023
Persistent dict, backed by sqlite3 and pickle, multithread-safe.

sqlitedict -- persistent dict, backed-up by SQLite and pickle A lightweight wrapper around Python's sqlite3 database with a simple, Pythonic dict-like

RARE Technologies 954 Dec 23, 2022
Map single-cell transcriptomes to copy number evolutionary trees.

Map single-cell transcriptomes to copy number evolutionary trees. Check out the tutorial for more information. Installation $ pip install scatrex SCA

Computational Biology Group (CBG) 12 Jan 01, 2023
A Python library for electronic structure pre/post-processing

PyProcar PyProcar is a robust, open-source Python library used for pre- and post-processing of the electronic structure data coming from DFT calculati

Romero Group 124 Dec 07, 2022
This repository contains code for CTF platform.

CTF-platform Repository for backend of CTF hosting website For starting the project first time : Clone the repo in which you have to work in your syst

Yash Jain 3 Feb 18, 2022
Google, Facebook, Amazon, Microsoft, Netflix tech interview questions

Algorithm and Data Structures Interview Questions HackerRank | Practice, Tutorials & Interview Preparation Solutions This repository consists of solut

Quan Le 8 Oct 04, 2022
An command-line utility that schedules your exams preparation routines

studyplan A tiny utility that schedules your exams preparation routines. You only need to specify the tasks and the deadline. App will output a iCal f

Ilya Breitburg 3 May 18, 2022
RLStructures is a library to facilitate the implementation of new reinforcement learning algorithms.

RLStructures is a lightweight Python library that provides simple APIs as well as data structures that make as few assumptions as possibl

Facebook Research 262 Nov 18, 2022
dict subclass with keylist/keypath support, normalized I/O operations (base64, csv, ini, json, pickle, plist, query-string, toml, xml, yaml) and many utilities.

python-benedict python-benedict is a dict subclass with keylist/keypath support, I/O shortcuts (base64, csv, ini, json, pickle, plist, query-string, t

Fabio Caccamo 799 Jan 09, 2023
My notes on Data structure and Algos in golang implementation and python

My notes on DS and Algo Table of Contents Arrays LinkedList Trees Types of trees: Tree/Graph Traversal Algorithms Heap Priorty Queue Trie Graphs Graph

Chia Yong Kang 0 Feb 13, 2022
Leetcode solutions - All algorithms implemented in Python 3 (for education)

Leetcode solutions - All algorithms implemented in Python 3 (for education)

Vineet Dhaimodker 3 Oct 21, 2022
Multidict is dict-like collection of key-value pairs where key might be occurred more than once in the container.

multidict Multidict is dict-like collection of key-value pairs where key might be occurred more than once in the container. Introduction HTTP Headers

aio-libs 325 Dec 27, 2022
A high-performance immutable mapping type for Python.

immutables An immutable mapping type for Python. The underlying datastructure is a Hash Array Mapped Trie (HAMT) used in Clojure, Scala, Haskell, and

magicstack 996 Jan 02, 2023
A HDF5-based python pickle replacement

Hickle Hickle is an HDF5 based clone of pickle, with a twist: instead of serializing to a pickle file, Hickle dumps to an HDF5 file (Hierarchical Data

Danny Price 450 Dec 21, 2022
A Python implementation of red-black trees

Python red-black trees A Python implementation of red-black trees. This code was originally copied from programiz.com, but I have made a few tweaks to

Emily Dolson 7 Oct 20, 2022
CLASSIX is a fast and explainable clustering algorithm based on sorting

CLASSIX Fast and explainable clustering based on sorting CLASSIX is a fast and explainable clustering algorithm based on sorting. Here are a few highl

69 Jan 06, 2023
Chemical Structure Generator

CSG: Chemical Structure Generator A simple Chemical Structure Generator. Requirements Python 3 (= v3.8) PyQt5 (optional; = v5.15.0 required for grap

JP&K 5 Oct 22, 2022