Top tech mahindra interview questions

public class Node {
  int data;
  Node next;
  public Node(int data) {
    
    this.data = data;
    this.next = null;
  }
}
public class LinkedList {
  Node head;
  public void reverse() {
    
    Node prev = null;
    Node current = head;
    Node next = null;
    while (current != null) {
      
      next = current.next;
      current.next = prev;
      prev = current;
      current = next;
    }
    head = prev;
  }
}

class Node: def __init__(self, data): self.data = data self.left = None self.right = None def find_max(root): if root is None: return float('-inf') else: return max(root.data, find_max(root.left), find_max(root.right))

function isPalindrome(s) {
  let left = 0;
  let right = s.length - 1;
  while (left < right) {
    if (s[left] !== s[right]) {
      return false;
    }
    left++;
    right--;
  }
  return true;
}

int find_min(int arr[], int n) {
  int min = arr[0];
  for (int i = 1;
  i < n;
  i++) {
    if (arr[i] < min) {
      min = arr[i];
    }
  }
  return min;
}

public class Main {
  public static boolean isPrime(int n) {
    
    if (n <= 1) {
      
      return false;
    }
    for (int i = 2;
    i <= Math.sqrt(n);
    i++) {
      
      if (n % i == 0) {
        
        return false;
      }
    }
    return true;
  }
}

def find_first_duplicate(arr): seen = set() for num in arr: if num in seen: return num seen.add(num) return None

function maxSubArraySum(a) {
  let size = a.length;
  let max_so_far = -Infinity;
  let max_ending_here = 0;
  for (let i = 0; i < size; i++) {
    max_ending_here = max_ending_here + a[i];
    if (max_so_far < max_ending_here) {
      max_so_far = max_ending_here;
    }
    if (max_ending_here < 0) {
      max_ending_here = 0;
    }
  }
  return max_so_far;
}

string minWindow(string s, string t) {
  unordered_map<char, int> tCount;
  for (char c : t) {
    tCount[c]++;
  }
  int required = tCount.size();
  int left = 0, right = 0;
  int formed = 0;
  unordered_map<char, int> windowCounts;
  int ans = INT_MAX;
  string ansStr;
  while (right < s.size()) {
    char c = s[right];
    windowCounts[c]++;
    if (tCount.find(c) != tCount.end() && windowCounts[c] == tCount[c]) {
      formed++;
    }
    while (left <= right && formed == required) {
      c = s[left];
      if (right - left + 1 < ans) {
        ans = right - left + 1;
        ansStr = s.substr(left, right - left + 1);
      }
      windowCounts[c]--;
      if (tCount.find(c) != tCount.end() && windowCounts[c] < tCount[c]) {
        formed--;
      }
      left++;
    }
    right++;
  }
  return ansStr;
}

public String longestCommonPrefix(String[] strs) {
  
  if (strs.length == 0) {
    
    return '';
  }
  for (int i = 0;
  i < strs[0].length();
  i++) {
    
    char c = strs[0].charAt(i);
    for (int j = 1;
    j < strs.length;
    j++) {
      
      if (i == strs[j].length() || strs[j].charAt(i) != c) {
        
        return strs[0].substring(0, i);
      }
    }
  }
  return strs[0];
}

def max_product_of_three(nums): nums.sort() return max(nums[-1] * nums[-2] * nums[-3], nums[0] * nums[1] * nums[-1])