Competitive-Programming

Competitive-Programming copied to clipboard

Rabin Karp's Algorithm

1

For hashing

18Pranjul

Computing a raised to b mod c in logn time?

2

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?

yashagarwal1999

Implementation of sparse table.( C++)

2

Part of Data structure based on range queries.

ankitbaluni123

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

2

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

cherry0697

Implement Dijkstra algorithm in a graph

3

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

AbhinavKumarJha

Javascript implementation for Doubly Linked List

1

I would like to work on it.

AkashAsthana

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

3

ankitbaluni123

String Hashing.(C++)

2

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

ankitbaluni123

Traversals , Height , mirror image and copy of Binary Tree

2

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

snehalkhandve

Postfix Expression Evaluation

2

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

Nilesh2000