@Praveentomar
Nothing here yet.
Nothing here yet.
Jun 11, 2025 · 1 min read · //write the program to fabonacci series and find out the value of the n is index of the fabonacci series re turn the ans of the n index; // time complexity of this code is O(n) = O(c), c = constant ; all this in the function is constant :: // space c...
Join discussionMay 29, 2025 · 1 min read · class Solution { public int findPeakElement(int[] nums) { int start = 0; int end = nums.length-1; while(start<end){ int mid = start + (end-start)/2; if(nums[mid]>nums[mid+1]){ end = mid; }else{ start = mid+1; } } return start; //you return both start...
Join discussionMay 27, 2025 · 1 min read · public class practice_2 { public static void main(String[] args) { int[] arr = {1,2,3,4,5,3,1}; int target = 3; int search = searching(arr); int check = asscen(arr,search,target); int check2 = descen(arr,search+1,arr.length-1,target); if(check!=-1){ ...
Join discussionMay 27, 2025 · 1 min read · public class practice_2 { public static void main(String[] args) { int[] arr = {1,2,3,4,5,3,1}; int target = 3; int search = searching(arr); int check = asscen(arr,search,target); int check2 = descen(arr,search+1,arr.length-1,target); if(check!=-1){ ...
Join discussionMar 27, 2025 · 1 min read · enter the total elements : 4 enter the number X : 12 enter the elements value 0 : 1 enter the elements value 1 : 2 enter the elements value 2 : 6 enter the elements value 3 : 6 pair is : 6,6 Process exited after 9.802 seconds with return value
Join discussion