shresth12-jain issues

Repositories
Issues
Comments

Results 5 issues of


                                            shresth12-jain

Duplicate find in O(N) complexity

You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N...

Leetcode problem 27 solution

Optimized solution for finding duplicates in array

You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N...

Changes-needed

O(N) solution for finding duplicate in an array

O(N) solution for dupliacte in an array

You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N...