Altimetrik JavaScript Interview Question String algorithm how to find the maximum substring - JSUniv

preview_player
Показать описание
Apple and Altimetrik interview question in String Algorithm Find maximum substring in JavaScript.

Follow us

To learn more interview question solutions from Apple, Facebook, Walmart, Altimetrik

To learn more Algorithm based interview question solutions from Apple, Facebook, Walmart

To learn more about closure

To learn more about scoping

To get more about your preparations

Problem description:

A substring is a contiguous sequence of characters with in a string, given a string determine the alphabetically maximum substring.

Example:
Step by step explanations on given string s= "baca"

The unique substrings : ['b','ba','bac',baca','a','ac','aca','c','ca']

Arranging the substrings alphabetically:[ 'a','ac','aca', 'b','ba','bac',baca', 'c','ca']

The maximum substrings alphabetically:[ca]
Рекомендации по теме
Комментарии
Автор

Wow, now I can understand clearly how to do algorithm after 5years of coding... thank you for this approach... all your video exposing touch into the deep core... really awesome

bharaniyak