Essential Problems
Written in C++
DFS
BFS
Sieve of Eratosthenes (Primality Test)
Modified Sieve (No. of Primes in a range)
Modified Sieve (Sum of Proper Divisors)
Modified Sieve (No. of Proper Divisors)
Euler Totient Sieve (Product Formula)
SUMTRIAN (#DP:
solution
)
Hotel Floor (#AD-HOC:
solution
)
Parity Calulator
Swaping Bits
Linked List[runner] (
helper.h
)
Merge Two Linkedlists
Merge Sort
Check loop in a linked list[runner] (
ll_pro.h
)
Dupes[rm] in a linked list[runner] (
ll_pro.h
)
Merge linked lists[runner] (
ll_pro.h
)
Reverse linked lists[runner] (
ll_pro.h
)
Authored by
Ashish Kumar