SDE - 1

You are given a string 'str' of length 'N'.

Your task is to return the longest palindromic substring. If there are multiple strings, return any.

A substring is a contiguous segment of a string.

For example :

str = "ababc"

The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome. 

There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.

How can you join a table to itself? Give an example

I was asked to design ludo snake ladder game.

There are three ticket windows at the railway station, at two windows tickets are being given at the same speed, and at the third window, it takes twice the time taken at another window. Whenever a person is coming a guard redirects him to a specific window to ensure average waiting time is minimum. How guard is doing this?

What gave you the idea for your project?

Why do you choose these tech stacks for the project?

What are the key features of your project?