DSA Sheet Answers
DSA Sheet Answers
for(int i=0;i<=arr.length-1;i++){
if(arr[i] < min){
min = arr[i];
}
}
return min;
}
public static int max(int arr[]){
}
}
13)package Backtracking;
}
public static void main(String[] args) {
int arr[] ={ 5,56,3,67,24,7};
reverseArray(arr, 0, arr.length-1);
printArray(arr);
}
}
14)class Solution {
public int maxSubArray(int[] nums) {
// Initialize the variables with the first element of the array
int maxSub = 0;
int maximum = 0;
class Solution {
public boolean containsDuplicate(int[] nums) {
Arrays.sort(nums); // Sort the array
if (nums[mid] == target) {
return mid;
}
}
}
101)package Backtracking;
return false;
}
solveMaze(maze);
}