-
Hello @rudrakshi99 @nakul-19 @plazzy99
I am a GSSoC21 participant.
What I want to contribute : (suggest if something needs to be added)
1. Naive and optimized approach for finding the intersectio…
-
Hello @rudrakshi99 @nakul-19 @plazzy99
I am a GSSoC21 participant.
What I want to contribute : (suggest if something needs to be added)
1. Algorithm to rotate a 2d matrix by 90 degrees in cloc…
-
Hello, @rudrakshi99 @nakul-19 @plazzy99 @tarun26091999 @raksha009 @shreyanspoddar
Myself Saurav, I am a GSSoC21 participant.
What I want to contribute :
Optimized approach for **Count of Sub…
-
Discuss the detailed information about the documentation with me via discord project server or via email - kryptonites.ju@gmail.com
-
## Is your feature request related to a problem? Please describe.
No its not a problem.
## Describe the solution you'd like
I would like to add 3D digital Clock.
![Screenshot from 2021-05-18 20-31…
-
-
### Hungarian-Algorithm
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal-dual methods.
-
## Longest consecutive subsequence in array
Given an array of positive integers. Finding the length of the longest sub-sequence such that elements in the subsequence are consecutive integers,
The co…
-
Add relevant sections and headings
-
**Hello @rudrakshi99 @plazzy99 @shreyanspoddar @anjul2000**
I am a **GSSoC21** participant.
### **(What i will do))**
- _**Find Union node's from two linked lists.**_
- **I will do this code i…