Amartya Choudhary
Results
3
issues of
Amartya Choudhary
### Description Given an array A, count the total number of possible inversions. If there indices i and j such that i > j and A[i] < A[j], then there...
good first issue
hacktoberfest
Hacktoberfest2020
algorithms
CPP
C
C++
I would like to implement a queue using two stacks
good first issue
hacktoberfest
Hacktoberfest2020
algorithms
CPP
C
up for grabs
C++
May I add the two codes of rod-cutting problem: **top-down** and **bottom-up** approach in the dynamic programming folder?
good first issue
hacktoberfest
Hacktoberfest2020
algorithms
CPP
C
BEGINNER
C++