https://leetcode.com/problems/3sum/description/
Discussed the below approaches:
Naive Solution : O(n3logn)
Hashing : O(n2logn) , space complexity- O(n)
Two Pointer Technique: O(n2logn) space complexity O(1)
2SUM: Hashing : https://www.youtube.com/watch?v=4fIqVR3zcsw&t=3s
2SUM: Two Pointer Techniques: https://www.youtube.com/watch?v=E3CrUT3MnJE&t=2s
Exploring Search Algorithms: Linear, Binary, and Hashing: https://www.youtube.com/playlist?list=PL2IQ9VnvNu0UTYfFxQaQrlGT-Bsxj_iLI
Google Sheet Integration with Spring Boot: https://www.youtube.com/watch?v=hVhkeGyvB04&list=PL2IQ9VnvNu0XF6DrZzsTfu52dHzQNIzRG&index=6
Cracking Coding Interviews: Master 14 Essential Patterns for Success
: https://www.youtube.com/watch?v=MKLW9ykV_qY&t=180s
Mastering Sliding Window Technique: Solving Algorithmic Challenges with Efficiency: https://www.youtube.com/watch?v=Sfzo4kVJucg&list=PL2IQ9VnvNu0VIZa5-t3Pmb9S1cFyTIWJY
Navigating Arrays: Master the Two Pointers Technique: https://www.youtube.com/playlist?list=PL2IQ9VnvNu0UkN8UK2Z7PMkj0d4kKKWCH
Contains Duplicate:
https://www.youtube.com/watch?v=80ZyeofI70k&list=PL2IQ9VnvNu0Vbgy2UDob4WCoondLSE_Mq
#leetcode #datastructures #algorithm #codinginterviews #java
