Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK
272Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 59th Video of our Playlist "Leetcode Easy" by codestorywithMIK
In this video we will try to solve an easy array problem : Check If N and Its Double Exist | Special Motivation | Multiple Approaches | Leetcode 1346 | codestorywithMIK
We will solve using multiple approaches.
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Check If N and Its Double Exist | Special Motivation | Multiple Approaches | Leetcode 1346 | codestorywithMIK
Company Tags : will update later
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Leetcode Easy/Check If N and Its Double Exist.cpp
Leetcode Link : https://leetcode.com/problems/check-if-n-and-its-double-exist
My DP Concepts Playlist : • Roadmap for DP | How to Start DP ? | ...
My Graph Concepts Playlist : • Graph Concepts & Qns - 1 : Graph will...
My Recursion Concepts Playlist : • Introduction | Recursion Concepts And...
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Summary :
Approach-1 (Brute Force)
Time Complexity: O(n²)
Space Complexity: O(1)
This approach uses two nested loops to compare every pair of elements in the array. For each pair, it checks if one element is double the other. While simple, it is inefficient for larger arrays due to the O(n²) time complexity.
Approach-2 (Using Extra Space)
Time Complexity: O(n)
Space Complexity: O(n)
This approach uses a HashSet to store elements as we traverse the array. For each element, it checks if twice the element or half the element (if it’s even) already exists in the set. This reduces the time complexity to O(n), but it requires extra space to store the elements in the set.
Approach-3 (Using Binary Search)
Time Complexity: O(n log n)
Space Complexity: O(1)
In this approach, the array is first sorted, and then for each element, binary search is used to find if the doubled value exists in the array. Sorting takes O(n log n) time, and binary search for each element takes O(log n) time. This approach has a better time complexity compared to brute force, but it still requires sorting, which adds overhead. The space complexity is O(1) since no extra space other than the input array is used.
✨ Timelines✨
00:00 - Introduction
#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik