GitHub - heyimShivam/Algorithm: C++ algorithm in one place, This is dedicated repository for maintaining data structures and algorithm code. This repository will be helpful for students preparing for internships or campus placements. Topics

heyimShivam / Algorithm Public

Notifications You must be signed in to change notification settings
Fork 70
Star 11

C++ algorithm in one place, This is dedicated repository for maintaining data structures and algorithm code. This repository will be helpful for students preparing for internships or campus placements. Topics

11 stars 70 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 377 Commits
Algorithm		Algorithm
DP		DP
Intro		Intro
Longest Common Extension		Longest Common Extension
OOPS		OOPS
backtracking		backtracking
patternsearching		patternsearching
0-1 Knapsack Problem.cpp		0-1 Knapsack Problem.cpp
01 knapsack .cpp		01 knapsack .cpp
2StackInAnArray.cpp		2StackInAnArray.cpp
AddTwoBitStrings.cpp		AddTwoBitStrings.cpp
Advance_Euclid_Algorithm.cpp		Advance_Euclid_Algorithm.cpp
Binary Search using pthread		Binary Search using pthread
BinaryTree MaximumPathSum		BinaryTree MaximumPathSum
Binary_Search.cpp		Binary_Search.cpp
Bitwise Sieve		Bitwise Sieve
Boring Numbers		Boring Numbers
Boyer Moore algo.cpp		Boyer Moore algo.cpp
Breadth_first_search.cpp		Breadth_first_search.cpp
C++ Program to Find array sum using Bitwise OR after splitting given array in two halves after K circular shifts		C++ Program to Find array sum using Bitwise OR after splitting given array in two halves after K circular shifts
CelsiusToFahrenheit.cpp		CelsiusToFahrenheit.cpp
Chaining.cpp		Chaining.cpp
Check_array_rotation.cpp		Check_array_rotation.cpp
Coin change-2		Coin change-2
Count number of occurrences (or frequency) in a sorted array.cpp		Count number of occurrences (or frequency) in a sorted array.cpp
Count of Ks in the Array for a given range of indices after array updates for Q queries		Count of Ks in the Array for a given range of indices after array updates for Q queries
Count ways to build street under given constraints		Count ways to build street under given constraints
Counting Numbers CSES		Counting Numbers CSES
Counting_Sort.cpp		Counting_Sort.cpp
Couples Holding Hands mbj		Couples Holding Hands mbj
DSU (Disjoint Set Union)		DSU (Disjoint Set Union)
Depth_First_Search.cpp		Depth_First_Search.cpp
Diameter-of-a-Binary-Tree		Diameter-of-a-Binary-Tree
Digit DP(sum_of_all_digits_in_a_range)		Digit DP(sum_of_all_digits_in_a_range)
Digit Sum Spoj		Digit Sum Spoj
Dijkstra's		Dijkstra's
Dynamic Segment Trees : Online Queries for Range Sum with Point Updates		Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
Edit_Distance.cpp		Edit_Distance.cpp
Egyptian Fraction		Egyptian Fraction
Euclidean algorithms.cpp		Euclidean algorithms.cpp
Evaluate Reverse Polish Notation		Evaluate Reverse Polish Notation
Extended Euclid algorithm		Extended Euclid algorithm
Fibonacci_Series.cpp		Fibonacci_Series.cpp
Find the last player to be able to flip a character in a Binary String - cbmv		Find the last player to be able to flip a character in a Binary String - cbmv
Floyd Warshall Algorithm		Floyd Warshall Algorithm
Generate lexicographically smallest Permutation of 1 to N where elements follow given relation		Generate lexicographically smallest Permutation of 1 to N where elements follow given relation
Golomb sequence		Golomb sequence
Heap sort .cpp		Heap sort .cpp
Huffman_coding.cpp		Huffman_coding.cpp
Insertion Sort.cpp		Insertion Sort.cpp
Job Sequencing Problem		Job Sequencing Problem
KMP Algorithm		KMP Algorithm
KMP Algorithm for pattern Searching		KMP Algorithm for pattern Searching
KMP algorithm for pattern searching		KMP algorithm for pattern searching
Kadane's algorithm		Kadane's algorithm
Kahn's Algorithm		Kahn's Algorithm
Kahn's algorithm for topo sort		Kahn's algorithm for topo sort
Kruskal's_Algorithm.cpp		Kruskal's_Algorithm.cpp
LCA (Sparse Matrix DP Approach)		LCA (Sparse Matrix DP Approach)
LCA in a tree using Binary Lifting Technique		LCA in a tree using Binary Lifting Technique
LCS using DP		LCS using DP
Largest divisible pairs subset		Largest divisible pairs subset
Linear search algorithm		Linear search algorithm
LinearSearchAlgorithm.cpp		LinearSearchAlgorithm.cpp
Longest Increasing Subsequence .cpp		Longest Increasing Subsequence .cpp
Longest Path In Matrix.cpp		Longest Path In Matrix.cpp
Longest-Common-Subsequence.cpp		Longest-Common-Subsequence.cpp
Matrix-multiplication.cpp		Matrix-multiplication.cpp
Maximize count of unique Squares that can be formed with N arbitrary points in coordinate plane		Maximize count of unique Squares that can be formed with N arbitrary points in coordinate plane
Maximize_Toys.cpp		Maximize_Toys.cpp
Minimize flips to make binary string as all 1s by flipping characters in substring of size K repeatedly		Minimize flips to make binary string as all 1s by flipping characters in substring of size K repeatedly
Minimize rope length to connect given points in a 3D plane		Minimize rope length to connect given points in a 3D plane
Minimum Window Substring		Minimum Window Substring
MinimumIncrementOperationsTomakeKelementsEqual.cpp		MinimumIncrementOperationsTomakeKelementsEqual.cpp
N queen Problem (using Backtracking)		N queen Problem (using Backtracking)
NQueen.cpp		NQueen.cpp
Number of LongestIncreasingSubsequence		Number of LongestIncreasingSubsequence
Number of decimal numbers of length k, that are strict monotone		Number of decimal numbers of length k, that are strict monotone
Palindrome-check.cpp		Palindrome-check.cpp
Pascal_Triangle.cpp		Pascal_Triangle.cpp
Permutations of a given string using STL.cpp		Permutations of a given string using STL.cpp
Persistent Segment Tree		Persistent Segment Tree
Polymorphism.cpp		Polymorphism.cpp
Prims.cpp		Prims.cpp
Print the longest palindromic prefix of a given string knc		Print the longest palindromic prefix of a given string knc
Print_all_permutation_of_String.cpp		Print_all_permutation_of_String.cpp
Q String with additive sequence \|kfj		Q String with additive sequence \|kfj
Quadratic Probing		Quadratic Probing
Queries to find the Lower Bound of K from Prefix Sum Array with updates using Fenwick Tree		Queries to find the Lower Bound of K from Prefix Sum Array with updates using Fenwick Tree
README.md		README.md
Rabin karp algorithm.cpp		Rabin karp algorithm.cpp
Range maximum query using Sparse Table		Range maximum query using Sparse Table
Reverse_string.cpp		Reverse_string.cpp
RobinRound.cpp		RobinRound.cpp
STL_find_max_min_vector.cpp		STL_find_max_min_vector.cpp
Segment Tree \| (Sum of given range)xc		Segment Tree \| (Sum of given range)xc
Segment Tree \| Set 2 (Range Maximum Query with Node Update)		Segment Tree \| Set 2 (Range Maximum Query with Node Update)
Segment Trees \| (Product of given Range Modulo m)		Segment Trees \| (Product of given Range Modulo m)
Segmented Sieve		Segmented Sieve
Shell Sort.cpp		Shell Sort.cpp