The algo_ds_notes's discuss from jainaman224

Data Structures article

We are aiming to write basic Data structures

Arrays
Lists
- Linked Lists
  - Singly Linked List
  - Doubly Linked List
  - Circular Linked List
- Stacks
  - Using Arrays
  - Using Linked List
- Queues
  - Using Arrays
  - Using Linked List
  - Priority Queues
    - Using Linked List
    - Using Heap
Trees
- Binary Tree
- Binary Search Tree
- Heaps
- Trie
- B Trees
- Red Black Trees
- Binomial Heap
- Fibonacci Heap
- Segmented Tree
- Fenwick Tree / Binary Indexed Tree
- Suffix Tree
- AVL Trees
- Multi Way Trees
Hash Tables and Hash Functions

Sorting of linked list

Sort link list using

Bubble Sort
Selection Sort
Insertion Sort

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.

Data Structures in Php

We are aiming to write basic Data structures

User Frinedly Codes

All stuff that are user friendly.

Algorithm Analysis

Write article for the following topics:

Queue using Linked List

Functions to be included :

Enqueue function
Dequeue function
Size function
isEmpty function (checks whether queue is empty or not)

Maximum Flow

Implement

Ford Fulkerson method

Dynamic stack using array

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

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.

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 Java

We are aiming to write basic Data structures

Algorithm Design in Java

We are aiming to write basic algorithms that are

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.

Algorithm Design in C++

We are aiming to write basic algorithms that are

Documentation

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

Duplicate queue implementations

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

No implemenation of Binary Search in C

Algorithm Design in Php

We are aiming to write basic algorithms that are

Activity Selection

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

Algorithm Design in Python

We are aiming to write basic algorithms that are

No sparse table implementation so far

#234 - Opened a PR for the same.

Tree traversal algorithm

Implement

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

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.
💯

Dijsktra in Java

Please add Dijsktra algorithm in java.

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);

Create queue using stacks

Create queue using stacks.

Segment tree

Implement segment tree

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

Data Structures in Python

We are aiming to write basic Data structures

missing image

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

OS: centos6

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.

Data Structures in C#

We are aiming to write basic Data structures

Reversal of linked list

Reverse a linked list

Iteratively
Recursively

Algorithm Design in C#

We are aiming to write basic algorithms that are

Sleep Sort

Implement Sleep Sort

Queue using array

Functions to be included :

Enqueue function
Dequeue function
Size function
isEmpty function (checks whether queue is empty or not)

Chinese Remainder Theorem using Java

Algorithm Design article

We are aiming to write basic algorithms that are

Trie

Implement Trie

words(lower-case alphabets)
numbers

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.

Graph Algorithm

Implement

BFS
DFS
Topological Sort
Strongly Connected Components

Shortest path algorithm

Implement

Dijsktra Algorithm
Floyd Warshall Algorithm
Bellman Ford Algorithm

Data Structures in C++

We are aiming to write basic Data structures

Object Oriented Programming

Mst algorithms

Implement

Kruskal Algorithm
Prims Algorithm

Priority queue using heap

Implement priority queue using min heap.

Breadth First Search in Java

Please add Bfs algorithm in java.

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.
😄 😄 😄

Stacks using queues

Create stack using 2 queues.

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.
😄
😄

jainaman224 / algo_ds_notes Goto Github PK

algo_ds_notes's Issues

Recommend Projects

Recommend Topics

Recommend Org