About

I built this repo just to learn the DSA question on daily basis and upload the Geeksforgeesks solution.

3 stars

1 watching

Name		Name	Last commit message	Last commit date
Buy Maximum Stocks if i Stocks can be bought on ith day.cpp		Buy Maximum Stocks if i Stocks can be bought on ith day.cpp
Check if a string is repetition of its substring of k-length.cpp		Check if a string is repetition of its substring of k-length.cpp
Consecutives 1's not allowed.cpp		Consecutives 1's not allowed.cpp
Find element occuring once when all are present thrice.cpp		Find element occuring once when all are present thrice.cpp
Game of XOR.cpp		Game of XOR.cpp
Gold Mine problem.cpp		Gold Mine problem.cpp
How Many X's.cpp		How Many X's.cpp
Max Sum Subarray of size K.cpp		Max Sum Subarray of size K.cpp
Max Sum Without Adjacents.cpp		Max Sum Without Adjacents.cpp
Minimize the Heights 2.cpp		Minimize the Heights 2.cpp
Modified Game of Nim.cpp		Modified Game of Nim.cpp
Number of subarrays with maximum values in given range.cpp		Number of subarrays with maximum values in given range.cpp
Painting the fence.cpp		Painting the fence.cpp
README.md		README.md
Reach the nth point.cpp		Reach the nth point.cpp
Rightmost different bit		Rightmost different bit
Smith Number.cpp		Smith Number.cpp
String's Count.cpp		String's Count.cpp
Subarray with 0 sum.cpp		Subarray with 0 sum.cpp
Transform to prime.cpp		Transform to prime.cpp

Repository files navigation

I built this repo just to learn the DSA question on daily basis and upload the Geeksforgeesks solution.

3 stars

1 watching