Prakshep GoswamiKadane’s Algorithm (GFG POTD)Given an integer array arr[]. Find the contiguous sub-array(containing at least one number) that has the maximum sum and return its sum.Sep 6
Pradeep SuryavanshiLongest alternating subsequence GeeksforGeeks Solution | Problem of the DayYou are given an array arr. Your task is to find the longest length of a good sequence. A good sequence {x1, x2, .. xn} is an alternating…Jul 18
Pradeep SuryavanshiArray to BST GeeksforGeeks Solution | Problem of the DayGiven a sorted array. Convert it into a Height Balanced Binary Search Tree (BST). Return the root of the BST.Jul 25Jul 25
Abhay RawatFraction pairs with sum 1 | GeeksForGeeks | </> POTDProblem Statement Aug 8, 2023Aug 8, 2023
Prakshep GoswamiKadane’s Algorithm (GFG POTD)Given an integer array arr[]. Find the contiguous sub-array(containing at least one number) that has the maximum sum and return its sum.Sep 6
Pradeep SuryavanshiLongest alternating subsequence GeeksforGeeks Solution | Problem of the DayYou are given an array arr. Your task is to find the longest length of a good sequence. A good sequence {x1, x2, .. xn} is an alternating…Jul 18
Pradeep SuryavanshiArray to BST GeeksforGeeks Solution | Problem of the DayGiven a sorted array. Convert it into a Height Balanced Binary Search Tree (BST). Return the root of the BST.Jul 25
Pradeep SuryavanshiGeeksforGeeks Identical Linked Lists Solution | Problem of the DayGiven the two singly Linked Lists respectively. The task is to check whether two linked lists are identical or not. Two Linked Lists are…Jun 29