1 / 1

Palindromic Substring in a String: Interview Question

Learn how to find the longest palindromic substring in a string. Understand what palindromes are and how they can be identified in a given text. Practice problem-solving skills for interviews.

shamus
Télécharger la présentation

Palindromic Substring in a String: Interview Question

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Interview Practice Question Set 4 • Find the longest palindromic substring in a string? • A palindrome is a word, phrase, number, or other sequence of symbols or elements, whose meaning may be interpreted the same way in either forward or reverse direction • Given n strings with equal length, say x, find the substring shared by all of them.

More Related