Leetcode Problem Solving #3 - Longest Substring Without Repeating Characters
HTML-код
- Опубликовано: 8 сен 2024
- Problem link: leetcode.com/p...
Solution: github.com/CsI...
Please LIKE the video and SUBSCRIBE to the channel: bit.ly/3v6DyYp
Contact me: csintamil42@gmail.com
Disclaimer: Everything I say in this video is my own opinion and not that of my employer or any other organization.
My free Programming courses:
C++ - bit.ly/3gnSwWc
C - • Learn C Programming in...
Python - bit.ly/2TZw24N
Java - bit.ly/2TusJCm
Data Structures - bit.ly/3wbcokJ
HTML - bit.ly/3iF7TuT
Other Topics Explained:
Git & Github - • Git & Github Explained...
OOP Concepts - • Introduction to Object...
Intro to Programming - • Introduction To Progra...
Competitive Programming - • What is Competitive Pr...
Laptop & Hardware Recommendations to Buy:
Laptops:
💻 HP - ₹36,000 - amzn.to/3pkYGsR
💻 Lenovo - ₹41,000 - amzn.to/3z2uxD5
💻 HP - ₹48,000 - amzn.to/3fNFxwy
💻 Lenovo - ₹60,000 - amzn.to/3vSIO3g
External Keyboard:
⌨️ amzn.to/3uTjUzh
⌨️ amzn.to/3uQfARd
External Mouse:
🖱️ amzn.to/3wZ4PO4
Wireless Mouse:
🖱️ amzn.to/3fR0MgO
Wireless Keyboard & Mouse
⌨️ 🖱️ - amzn.to/3ii0eCz
(Some links above are affiliate links. I may get some commission if you buy through the link. No additional charges for you)
#CsInTamil #programming #tamil
Weekly one's QnA video podunga bro 😊
Bro! Please python la ini continue panunga... Cuz intha video pakra students maximum yarum c++ a concentrate pana matanga but java/python than strong a irupanga placement preparation ku
Clear explanation
Can you explain time and space complexity at the end of the video? As well, I am practicing problem solving in Java, so could you please explain in that language also?
bro (count[s[end]]-- start++ )tha varun please help me i am dying for 45 min to understant literally
Nice bro...
Sir, could you teach DBMS in detail?
bro java la poduga
Bro, It's Time complexity is O(n^2), Could you reduce it into O(n) ?
Ithu n time complexity tha bro sliding window technique
@@gokul4476 Inside while loop there is another while loop avg time complexity for loop is n then n*n = n^2 thaana bro
Bro neenga loop vachu time complexity judge pana koodathu antha time complexity epayum worst case tha epayumea antha first pointer end a reach panathu so athu full iteration kedayyathu athu than worst case so final patha antha end pointer matum fulla traverse panum
@@gokul4476 think about long String with multiple sub long String
Bro,
Na problem solving High score pannaa maatum podhuma yenakku IT job kedaikkarthukku,
May be Google
Qualification only 12th fail🫤,
Which is required skills to get job in Google 😁
Na is two pointer approach and sliding windows both are same?
I think Both are different
Both are different bro two sliding window used for substring and subarray probelms
Pwwkew ithukku puriyamatinguthu atha konjam explain pannunga
Bro first view
bro pls python use pannunga
bro C layu solve panunga bro enaku C++ theriyadhu🥲🥲🥲