Sunday, November 27, 2016

Manacher's Longest Palindromic Substring Algorithm

http://manacher-viz.s3-website-us-east-1.amazonaws.com/#/
at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Manacher's Longest Palindromic Substring Algorithm

http://manacher-viz.s3-website-us-east-1.amazonaws.com/#/

  • Interview : Expected time to see a bus
    Suppose a bus is running on a loop route. It takes 10 mins for the bus to finish the route. If a guy arrives at a bus stop at uniformly rand...
  • Interview : a strategy to stop flipping the poker and win
    Question: You are playing a card game with me. Suppose I shuffle a deck of 52 cards, then I show you the card one by one to you from top t...
  • Word Ladder
    Given two words ( start  and  end ), and a dictionary, find the length of shortest transformation sequence from  start  to  end , such tha...