MithraTalluri

//see if the mirror of i is expanding beyond the left boundary of current longest palindrome at center c
//if it is, then take r - i
//else take P[mirror]
if(i < r){
  P[i] = Math.min(r - i, P[mirror]);
}

MithraTalluri

c - j = j' - c
So, mirror index of j:
j' = (2 * c) - j

MithraTalluri

public static int KadaneWithIndices(int[] array){
        int currentMax = 0;
        int totalMax = Integer.MIN_VALUE;
        int startIndex = 0, endIndex = 0, tempIndex = 0;

        for(int i = 0; i < array.length; i++){
            currentMax += array[i];
            
            if(currentMax < 0){
                currentMax = 0;

MithraTalluri

public int Kadanes(int[] array){
    int n = array.length;
    int[] dp = new int[n];

    //base condition
    dp[0] = array[0];

    int answer = Integer.MIN_VALUE;
    for(int i = 1; i < n; i++){
        dp[i] = Math.max(dp[i - 1], 0) + array[i];

MithraTalluri

public int getMaxSubarraySum(int[] array){
    int currentMax = Integer.MIN_VALUE;
    int totalMax =  Integer.MIN_VALUE;

    for(int i = 0; i < array.length; i++){
        currentMax = Math.max(currentMax, 0) + array[i];
        totalMax = Math.max(totalMax, currentMax);
    }
    return totalMax;
}

MithraTalluri

MithraTalluri

int binarySearchExample2(int[] array, int key){
  int length = array.length;
  int low = 0;
  int high = length - 1;
  while(low < high){
      int mid = low + ((high - low) / 2);
      int current = array[mid];
      if(current == key){
          return array[mid];
      }

MithraTalluri

int binarySearchExample1(int[] array, int key){
  int length = array.length;
  int low = 0;
  int high = length - 1;
  while(low < high){
      int mid = low + ((high - low + 1) / 2);
      int current = array[mid];
      if(current == key){
          return array[mid];
      }

MithraTalluri

MithraTalluri

boolean binarySearchIterative(int[] array, int key){
    int length = array.length;
    int low = 0;
    int high = length - 1;
    while(low <= high){
        int mid = (low + high) / 2;
        int current = array[mid];
        if(current == key){
            return true;
        }