ARRAYS Peak element class Solution { // Function to find the peak element // arr[]: input array // n: size of array a[] public int peakElement(int[] arr,int n) { if(n==1) return 0; if(arr[0]>=arr[1]) return 0; if(arr[n-1]>=arr[n-2]) return n-1; for(int i=1;i<n-1;i++){ if(arr[i]>=arr[i-1]&&arr[i]>=arr[i+1]) return i; } return 0; } } Find minimum and maximum element in an array class Compute { static pair getMinMax(long a[], long n) { long min = a[0]; long max = a[0]; for (int i = 1; i < n; i++) { ...
Posts
- Get link
- X
- Other Apps
LINKED LISTS Reverse Linked List public class Solution { public ListNode reverseList ( ListNode A ) { ListNode prev = null ; ListNode curr = A ; ListNode next = null ; while ( curr != null ){ next = curr . next ; curr . next = prev ; prev = curr ; curr = next ; } return prev ; } } Intersection of Linked Lists public class Solution { public ListNode getIntersectionNode ( ListNode a , ListNode b ) { if ( a == null || b == null ){ return null ; } ...