Length of longest substring without repeating characters | Python interview problem | Google

preview_player
Показать описание
In this video we are discussing a famous python interview problem which has been asked in Facebook, Google, Amazon and many other companies. The problem is to find longest substring without repeating characters. If you enjoy this video, please like, subscribe and share this content.

If you want to learn Data Science from scratch and crack interviews, join our Assignment based Data Science Combo course for complete Hands on Practical Learning Experience with 1-1 Live Doubt Clearance Support on Skype chat everyday.

In the Combo Course we have covered

✅Python
✅Machine learning
✅Complete SQL
✅Maths and statistics
✅NLP
✅Time Series
✅ Neural network
✅ Tensorflow
✅ Computer Vision
✅ AWS Sagemaker
✅ Model deployment
✅ 25+ Capstone End-to-end Machine Learning and Deep Learning Projects
✅ 350+ Interview QnAs PDF collection

Also we provide additional job resources like sample resumes, resume review feature, Job Referrals and Opening Mails for job hunting and you also can get 100% internship opportunity after completing the course

Actual price of this package is ₹12190/- but it is available at ₹3999/- (70% DISCOUNT FOR TODAY)

Course is Trusted by 5000+ Happy Learners

#datascience #machinelearning #course #interviewqna #deeplearning #sql #python #statistics #cloudyml #artificialintelligence
Рекомендации по теме
Комментарии
Автор

If we are allowed to use python libraries, may be we first find the number of unique elements in the list using set. Say it's = n, then the substring cannot be bigger than n. Then use permutation from itertools library to get n types of combination of the unique elements, see if any of it exists in the given string. If any of them don't, then get the possible permutation of n-1 unique elements, and check if they exist

dhirajkumarsahu
Автор

Why can't we take unique elements from the string and print the length??

ashwinr
join shbcf.ru