Alg-Cats

Alg-Cats

1. FIND IN Certain Order

2. SUB-SET

3. FIND MAX PATH

4. FIND MIN PATH

5. Search, Min, Max

   • ARRAY
     • Unique
       • Sorted Rotated
         • Binary Search - Variation mid+1-1 check
           • Array Req: Array sorted Low to High except Pivot point; case1: if Start < End return 0 case2: Only one direction goto RIGHT case edge:  MID > MID+1 return MID+1 MID < MID-1 return MID // Binary search way while (right >= left) {   int mid = left + (right - left) / 2;  if (nums[mid] > nums[mid + 1]) { return nums[mid + 1]; }    if (nums[mid - 1] > nums[mid]) { return nums[mid]; }  if (nums[mid] > nums[0]) {    left = mid + 1; } else {      right = mid - 1; } }
       • Sorted
         • Binary Search
     • Duplicate
       • Sorted
         • Binary Search - Variation equals check
       • Sorted Rotated
       • -Ve, +Ves
       • +Ve's
       • > len / 2
       • 3 Sections
     • Characters
   • LINKED LIST

6. Pattern Matching

   • Longest Palindrom
   • RegEx Match
     • #1: if current char . or alpha match #2: if *  -----#2.1 copy previous value -----#2.2 override if previous match
     • Iteration
       • boolean T[][] = new boolean[text.length + 1][pattern.length + 1]; T[0][0] = true;   //Deals with patterns like a* or a*b* or a*b*c*  for (int i = 1; i < T[0].length; i++) { if (pattern[i-1] == '*') {   T[0][i] = T[0][i - 2]; } } for (int i = 1; i < T.length; i++) {   for (int j = 1; j < T[0].length; j++) {     if (pattern[j - 1] == '.' || pattern[j - 1] == text[i - 1]) {        T[i][j] = T[i-1][j-1]; }     else if (pattern[j - 1] == '*') {       T[i][j] = T[i][j - 2];       if (pattern[j-2] == '.' || pattern[j - 2] == text[i - 1]) {            T[i][j] = T[i][j] | T[i - 1][j]; } } else { T[i][j] = false; } } }      return T[text.length][pattern.length];
     • Recursion

7. Data structure

   • Array
   • String

8. Solve Method

   • Iteration
   • Recursion

9. Dynamic Programming