-
Given an array of N integers arr[] where each element represents the maximum length of the jump that can be made forward from that element. This means if arr[i] = x, then we can jump any distance y su…
-
A rat is placed at (0,0) in a square matrix of order N*N. It has to reach the final destination (N-1,N-1). We have to find all possible paths to reach from source to destination. A rat can move in fou…
-
微博内容精选
-
hello, I really like this project, can I only scrape the first page? what if I want to scrape the next page? thanks, sorry if my english is bad :D
-
**Is your feature request related to a problem? Please describe.**
4sum problem is one of the important topic or the question in array data structure.
**Describe the solution you'd like**
It incl…
-
Pick questions from each of the coding practice sites below and set a timer for 45 minutes: practice writing clean, concise, simple code.
- [x] Read up [Computational Complexity Part One](https://www…
-
More questions and their solutions can be added
Refer [Contributing.md](https://github.com/Vishruth-S/CompetitiveCode/blob/main/CONTRIBUTING.md) before sending a PR
-
-
-
Please assign it to me under hacktoberfest 2022 tag