jainaman224 / algo_ds_notes Goto Github PK

It is a repository that is a collection of algorithms and data structures with implementation in various languages.

License: GNU General Public License v3.0

C++ 22.27% Java 19.89% Python 14.08% C# 3.89% CoffeeScript 0.48% JavaScript 3.90% PHP 2.25% Ruby 3.07% Go 4.38% C 13.56% Erlang 0.01% Shell 0.02% Clojure 0.01% Scala 0.01% Julia 0.08% Kotlin 1.86% Dart 4.22% Jupyter Notebook 4.52% TypeScript 0.77% Rust 0.71%

algorithm data-structures object-oriented programming documentation

algo_ds_notes's People

Contributors

Stargazers

Watchers

Forkers

ankitakhurana uday1201 nj4710 allianzcortex unixc3t sunnala noir19 bwarfson mercynoo cavalleria solobearchn ar5had bhavya12345 yuwenyan garv13 justshrey swatinirwal jbelloncastro zouyanjian sjtu2008 oceanat zhwq001 ihecha flavorzyb gdlinklock zxr12748 holys azureplus guoyunliang kakashiio lishuai1225 se7oluti0n zhanglei wenqianwang noobandy vibhudadhichi rener1199 gasailu jeremychen0127 javondavis stevenxiao kaobaozi wangxiao5791509 sananth12 exp0nge mfc1989 bryonglodencissp howard-e nihalchauhan funcoding htfy96 cafonso sarav-s vishvanath45 ayush-tulsyan smliepoker sunilsharma08 vaibhavchellani htadg prakharcode adishjain avijeet95 sasha2222 sudha247 varunpurohit76 fredrick97 pegurnee pranayberry rivelco akshit04 hareshkh ghostwriternr hawksrachit jinz2014 kazakuri nitishkd oanarosca richa-coder mastash3ff sahilkhurana19 mahipaultak hackersspirit michael-sloma david-egan anumpatel sahilrider sameer87 hm98 kawaiibilli mrwonko devutsav nandukalidindi jadoogr manishsrm bhaveshgoyal palnabarun sambuddhabasu lauralaureus vaibhav4595 mohit4

algo_ds_notes's Issues

Documentation

Add documentation to the folders where there is no README.md file.

Graph Algorithm

Implement

BFS
DFS
Topological Sort
Strongly Connected Components

Data Structures in Java

We are aiming to write basic Data structures

Algorithm Design article

We are aiming to write basic algorithms that are

Dijsktra in Java

Please add Dijsktra algorithm in java.

Sorting of linked list

Sort link list using

Bubble Sort
Selection Sort
Insertion Sort

Segment tree

Implement segment tree

Range Minimum Query
Sum of given range(naive)
Sum of given range(using lazy propagation)

Option for User to do push and pop

In Stack implemenation using linked list , user must be given a option to perform a push and pop function.

Tree traversal algorithm

Implement

Pre-order Traversal
Post-order Traversal
In-order Traversal
Level-order Traversal

Boyer moore Algorithm

Boyer moore pattern searching algorithm is used for efficient string searching. It is used for practical implementation and research. The key to efficiency is that it does not use brute force instead of that it skips some patterns based on information available. You may find more information here
Tell me if anyone is willing to solve this with me so we can divide the work for different languages.
😄

Data Structures in C#

We are aiming to write basic Data structures

No implemenation of Binary Search in C

Create queue using stacks

Create queue using stacks.

insertion sort

Is it good to have a generic insert_sort function that is similar to:

insert_sort(int arr[], int start, int end);

The question comes from the function definitions in Insert_Sort.cpp and Merge_Sort.cpp.

struct node discussion

How about the following c++ way to create define a Node class ?

class Node {
public:
int data;
Node *left;
Node *right;
Node(int value) : data(value), left(NULL), right(NULL) {}
}

node *root = new Node(1);

Data Structures article

We are aiming to write basic Data structures

Breadth First Search in Java

Please add Bfs algorithm in java.

Chinese Remainder Theorem using Java

Trie

Implement Trie

words(lower-case alphabets)
numbers

Algorithm Design in Php

We are aiming to write basic algorithms that are

Priority queue using heap

Implement priority queue using min heap.

Algorithm Design in Java

We are aiming to write basic algorithms that are

Length of a Linked List

Include the following two functions for determining the length of a linked list in these codes (https://github.com/jainaman224/Algo_Ds_Notes/tree/master/Linked_List)

lengthIterative - This function should be implemented iteratively.
lengthRecursive - This function should be implemented recursively.

Note : please specify the language in which you are interested before proceeding.

Reversal of linked list

Reverse a linked list

Iteratively
Recursively

Algorithm Design in Python

We are aiming to write basic algorithms that are

missing image

Could you check if there is an image for showing the multi-level inheritance ?

OS: centos6

Balanced tree problem AVL tree

This issue is in reference to #280 which is the same kind of problem of balancing trees. Adelson-Velskii and Landis trees are called to be more robust than red black trees. The good thing about avl is that it can contain difference og height 1 between two branches.
ping me if anyone wants to contribute to this issue.
😄
😄

Algorithm Analysis

Write article for the following topics:

Data Structures in Python

We are aiming to write basic Data structures

Activity Selection

I want to work on activity selection in c++.

Algorithm Design in C++

We are aiming to write basic algorithms that are

Object Oriented Programming

Mst algorithms

Implement

Kruskal Algorithm
Prims Algorithm

Stacks using queues

Create stack using 2 queues.

Balanced tree problem Red Black Tree

How to balance a given tree
A red-black tree is a binary search tree with one extra bit of storage per node: its
color, which can be either RED or BLACK. By constraining the node colors on any
simple path from the root to a leaf, red-black trees ensure that no such path is more
than twice as long as any other, so that the tree is approximately balanced.

Minimum spanning tree problem

Given an undirected and connected graph G = (V, E)
G=(V,E), a spanning tree of the graph G is a tree that spans G, it includes every vertex of
and is a subgraph of every edge in the tree belongs to G The cost of the spanning tree is the sum of the weights of all the edges in the tree. There can be many spanning trees. Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees. There also can be many minimum spanning trees.

Work needed on travis CI

We need integrations tool travis CI to work for us for languages we are using. Please find a way to make it possible.
💯

Data Structures in C++

We are aiming to write basic Data structures

Duplicate queue implementations

There are two separate folders with queue implementations for linked links and arrays. Could these be collated?

Data Structures in Php

We are aiming to write basic Data structures

User Frinedly Codes

All stuff that are user friendly.

Maximum Flow

Implement

Ford Fulkerson method

Dynamic stack using array

Implement dynamic stack that is resizeable, So, there is no overflow.

No sparse table implementation so far

#234 - Opened a PR for the same.

Huffman coding problem

Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters. The most frequent character gets the smallest code and the least frequent character gets the largest code

It is somehow a bit complex to understand as it requires many other concepts to implement it.
😄 😄 😄