Collection of Algorithms

Implementation of some important problem statements from GFG, LeetCode, Hackerrank etc. using different Algorithmic paradigm.
*Please feel free to contribute:)

Folder Structure

Dynamic Programming

Fibonacci Number

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1.

Subset Sum

Subset sum problem with Recursion & DP

Find count of Subset sum using DP

Find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal

Coin Change

Find the number of ways to achieve change using given coins (Recursion & DP approach)

Find minimum coin change using given coin collection.

Longest Palidromic Substring

Given a string s, return the longest palindromic substring in s.

Target Sum

Find number of ways to achieve target sum using given array input by either adding and substracting elements.

Searching and Sorting

Bubble Sort

Worst & Average case time complexity : O(n*n)

Best case time complexity when array is already sorted : O(n)

Insertion Sort

Selection Sort

Greedy

Divide and Conquer

Strings

Longest Common Prefix

Given list of strings find longest common prefix.

Valid Parenthesis

Print if given combination of parenthesis is valid.