rishabhgarg25699/competitive-programming

This repository contains some useful codes, techniques, algorithms and problem solutions helpful in Competitive Coding. Join with me on telegram group https://t.me/joinchat/GL4Y8RREZbz-Cp78R869CQ

competitive-programming's Issues

Forward and Backward Navigation using Doubly Linked List

I want to work take this issue too.

Implement Dijkstra algorithm in a graph

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.

Implement Data structure Segment tree And Fenwick Tree

Addition of two ploynomials using linked list (C)

Addition of two ploynomials using linked list in C

implement insertion sort

Implementation of sparse table.( C++)

Part of Data structure based on range queries.

Calculating Catalan Numbers Efficiently

Catalan numbers are often asked in competitive codin competitiions. Can I Work on this issue?

Connected component in undirected graph

To output the number of connected components in undirected graph

Implement AVL tree in C

To insert,delete,search in tree with height balancing.

Implement Shell Sort

Kadane's Algorithm

Implementation of The Maximum Sub Array Sum Problem using Kadane's Algroithm in C++.

Javascript implementation for Doubly Linked List

I would like to work on it.

Implement Bellman ford algorithm

I would like to work on this

changing the file type of heap sort ,iterative merge and quick sort in sorting algos

i would like to improve this

kruskals algorithm for finding minimum spanning tree using cpp

Implement DFS algorithm Of Graph

String Hashing.(C++)

Based on hash calculation of string.

1 .Calculation of hash (polynomial rolling hash function).
2 .Using hash calculated to Search for duplicate strings in an array of strings in O(nm+nlogn) time.

Based on hash calculation of substring.

3. Pattern matching in a string in O(n) time (Rabin-Karp ).
4. Calculating the number of different substrings of a string in O(n2 logn).
5. Finding all sub-palindromes in O(N) .

Computing a raised to b mod c in logn time?

There is a fast algorithm to compute (a^b)%c in O(log N) time rather than O(b). Can I work on this issue?

Rabin Karp's Algorithm

For hashing

Majority Element

C++ Program to return the Majority element in an array.

Prim's Algorithm

To implement greedy approach to find Minimum Spanning Tree for a graph

sieve of eratosthenes algorithm for checking if a number is prime

Implement sieve of eratosthenes algorithm for checking if a number is prime or not.

Implement KMP algorithm Of String

Regarding Python Implementation:

DFS and BFS algorithm implementation in Python..

I would like to take up this issue

Implement Stack And Queue

Implement BFS algorithm of Graph

Implement bubble sort in C

I would like to take up this issue.

To implement Circular Queue

• Static memory allocation implementation

regarding java

There is less code support for java in this repo. Can I add it in java?

Such as Binary Search, Insertion sort, Trees and Graphs, etc.

Kindly Implement Tim Sort in C++ as well as Python

Tower Of Hanoi

Tower of Hanoi Using Recursion In C++.

Implement Serialization and Deserialization of a Binary Tree

using Preorder/Postorder and Inorder traversals

Traversals , Height , mirror image and copy of Binary Tree

Many operations can be performed on a given binary tree which are useful in competitive programming problems . I am interested to implement pre-order , post-order and in-order traversal , finding height , mirror image and copy of a binary tree .

Implement Binary Search Tree

I would like to work on this.

Maze Problem using Backtracking algorithmic technique

Implement Prim's Algorithm

Greedy approach to find Minimum Spanning Tree of a graph

Loop detection in linked list in O(N) using Floyd’s Cycle-Finding Algorithm. (C++)

Implement Linked List Operations

• Loop Detection in a Singly Linked List
• Intersection Detection of two Singly Linked Lists

Implementation of segment tree.

#finding queries based on range .
1.sum of range of queries.
2.min. in the range.
3. max in the query.
4. gcd of the range.
All queries in O(logn) and building time is O(n)

Implement nth Fibonacci Number in O(log n) time

Can I address this issue?

Postfix Expression Evaluation

Evaluation of postfix expression using a stack in C++.

Height of a BST

Height of a Binary Search Tree in C++.

Computing Binary Coefficients (nCr%mod)And answering Queries in O(1) time

The idea is to precompute factorials and inverse factorials and finally answer it in O(1) time.

Implement Topological Sorting for a Directed Acyclic Graph

Can I address this issue?

Implement Data Structure Tries

Regarding Java Implementation

Dfs and Ternary search tree. Is this assigned or not?

I wanted to implement the above quoted Algorithms.

Design and analysis of algorithms implementations

Implement Floyd Warshall algorithm

I would like to work on this

Computing Euler Totient Function in sqrt(N)

Euler Totient function is a function that gives the number of coprime integers from 1 to N. This algorithm will compute the number of coprime integers for any given N in sqrt(N) time. I would like to work on this.

Implementation of ternary search on integers as well as on floating point numbers

Ternary search is an important modification of binary search which is very useful in competetive programming. I want to contribute to it.