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

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

• Static memory allocation implementation

Tower of Hanoi Using Recursion In C++.

Greedy approach to find Minimum Spanning Tree of a graph

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

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 .

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

I wanted to implement the above quoted Algorithms.

using Preorder/Postorder and Inorder traversals

I would like to work on this

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

i would like to improve this

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

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

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.

I want to work take this issue too.

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

I would like to work on it.

For hashing

Can I address this issue?

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?

To output the number of connected components in undirected graph

Height of a Binary Search Tree in C++.

I would like to take up this issue.

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

Part of Data structure based on range queries.

Can I address this issue?

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

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

Addition of two ploynomials using linked list in C

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

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.

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

I would like to work on this.

DFS and BFS algorithm implementation in Python..

I would like to take up this issue

I would like to work on this

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