Find the Pivot Integer | 5 Approaches | Easy Explanation | Leetcode 2485
172Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 20th Video of our Playlist "Maths : Popular Interview Problems".
In this video we will try to solve a very good Maths problem : Find the Pivot Integer | 5 Approaches | Easy Explanation | Leetcode 2485
Share your learnings on LinkedIn, Twitter (X), Instagram, Facebook(Meta) with the hashtag #codestorywithmik & feel free to tag me.
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.
Problem Name : Find the Pivot Integer | 5 Approaches | Easy Explanation | Leetcode 2485
Company Tags : Apple
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Find%20the%20Pivot%20Integer.cpp
Leetcode Link : https://leetcode.com/problems/find-the-pivot-integer/
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My Recursion Concepts Playlist : https://www.youtube.com/watch?v=pfb1Zduesi8&list=PLpIkg8OmuX-IBcXsfITH5ql0Lqci1MYPM
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Approach Summary :
Sure, here's a short summary of each approach:
1. Brute Force (Approach-1):
- Time Complexity: O(n^2)
- Space Complexity: O(1)
- The algorithm iterates through all possible pivot points and checks if the sum of elements on the left and right sides is equal.
2. Optimizing with Maths (Approach-2):
- Time Complexity: O(n)
- Space Complexity: O(1)
- Optimizes the brute force approach by calculating the total sum and using mathematical formulas to compute the left and right sums, reducing the time complexity.
3. Two Pointer (Approach-3):
- Time Complexity: O(n)
- Space Complexity: O(1)
- Uses two pointers starting from the beginning and end of the sequence, incrementing/decrementing them based on the comparison of the sums of elements on the left and right sides.
4. Binary Search (Approach-4):
- Time Complexity: O(log(n))
- Space Complexity: O(1)
- Applies binary search to find the pivot point by comparing the square of the potential pivot with the total sum, reducing the time complexity significantly.
5. Quick Math (Approach-5):
- Time Complexity: O(1)
- Space Complexity: O(1)
- Utilizes quick math by calculating the square root of the total sum and checking if the square of the result equals the total sum, providing a constant time solution.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
01:17 - Approach : 1
03:47 - Approach : 2
08:14 - Approach : 3
13:21 - Approach : 4 (Maths Proof)
18:31 - Approach : 5
21:28 - Coding them up
#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 #2024 #newyear