Skip to content

Add input validation to longest palindromic subsequence #1879

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
MayankSharma-2812 wants to merge 8 commits into
base: master
Choose a base branch
from
Open

Add input validation to longest palindromic subsequence #1879

Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
22399de
Improve N-Queens input validation and solution counting clarity
MayankSharma-2812 Jan 22, 2026
a52354a
Add input validation for empty or invalid array in binary search
MayankSharma-2812 Jan 23, 2026
da50af3
Add Quick Sort implementation in JavaScript
MayankSharma-2812 Jan 24, 2026
b135a51
Handle empty array input in selection sort
MayankSharma-2812 Jan 25, 2026
ddf6fb2
Avoid mutating input array in bubble sort implementations
MayankSharma-2812 Jan 26, 2026
b9fd4f8
Add input validation to longest subarray sum algorithm
MayankSharma-2812 Jan 27, 2026
ff5be5b
Add input validation to coin change algorithms
MayankSharma-2812 Jan 30, 2026
142c98c
Add input validation to longest palindromic subsequence
MayankSharma-2812 Jan 31, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Add input validation for empty or invalid array in binary search
  • Loading branch information
@MayankSharma-2812
MayankSharma-2812 committed Jan 23, 2026
commit a52354a1d6d170d1e59fa041cd389aaa142fe81b
22 changes: 12 additions & 10 deletions Search/BinarySearch.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,44 +8,46 @@
*/

function binarySearchRecursive(arr, x, low = 0, high = arr.length - 1) {
if (!Array.isArray(arr) || arr.length === 0) {
return -1
}

const mid = Math.floor(low + (high - low) / 2)

if (high >= low) {
if (arr[mid] === x) {
// item found => return its index
return mid
}

if (x < arr[mid]) {
// arr[mid] is an upper bound for x, so if x is in arr => low <= x < mid
return binarySearchRecursive(arr, x, low, mid - 1)
} else {
// arr[mid] is a lower bound for x, so if x is in arr => mid < x <= high
return binarySearchRecursive(arr, x, mid + 1, high)
}
} else {
// if low > high => we have searched the whole array without finding the item
return -1
}

return -1
}

function binarySearchIterative(arr, x, low = 0, high = arr.length - 1) {
if (!Array.isArray(arr) || arr.length === 0) {
return -1
}

while (high >= low) {
const mid = Math.floor(low + (high - low) / 2)

if (arr[mid] === x) {
// item found => return its index
return mid
}

if (x < arr[mid]) {
// arr[mid] is an upper bound for x, so if x is in arr => low <= x < mid
high = mid - 1
} else {
// arr[mid] is a lower bound for x, so if x is in arr => mid < x <= high
low = mid + 1
}
}
// if low > high => we have searched the whole array without finding the item

return -1
}

Expand Down