Skip to content

Latest commit

History

History
25 lines (18 loc) 路 698 Bytes

Notes.md

File metadata and controls

25 lines (18 loc) 路 698 Bytes

Approaches

  • Brute Force
  • Greedy Approach
  • Dynamic Programming
  • Divide and Conquer

Techniques

  • Back Tracking
  • Top Down
  • Bottom Up

  • Back Tracking - DFS
  • Branch and Bound - BFS

Problem and Possible Approaches for solution

Problem Algorithms
Longest Substring without repeating character Sliding Window
Longest Palindrome Brute Force, Expand
Shortest Palindrome Brute Force, Knuth Morris Pratt Matrix