Cheat Sheet - s530479-ShivaKumar/Leet GitHub Wiki

  1. Topological sort - cyclic graph ->
  2. Letter combination of a phone number --> backTRacking. https://leetcode.com/problems/letter-combinations-of-a-phone-number/solution/
  3. Valid parentheses -> map of closing brackets to open brackets and take each index to validate. https://leetcode.com/problems/valid-parentheses/
  4. Course Schedule -> adjacencyList and inDegree maps -> add to queue and traverse.
  5. Word Search -> starting from [row][col] == s.chatAt(0) - > backtrack in all 4 directions.
  6. Linked List cycle -> fast and slow pointer meeting at a point -> found cycle.
  7. https://leetcode.com/problems/sort-array-by-increasing-frequency/ 8.https://leetcode.com/problems/delete-node-in-a-linked-list/ 9.https://leetcode.com/problems/remove-linked-list-elements/
  8. https://leetcode.com/problems/remove-element/ 11.https://leetcode.com/problems/maximum-length-of-repeated-subarray/