724.1 Find Pivot Index (Theory) | #1 | Array And String Playlist |
HTML-код
- Опубликовано: 12 сен 2024
- Support me 🙌🏻: www.buymeacoff...
Link : leetcode.com/p...
Given an array of integers nums, calculate the pivot index of this array.
The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right.
If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array.
Return the leftmost pivot index. If no such index exists, return -1.
------------------------------------------------
Your queries:
724 Find Pivot Index
data structures playlist
data structures
data structures and algorithms
Leetcode
Leetcode java
Leetcode playlist
Array and string playlist
Array playlist
string playlist
Arrays interview questions
String interview questions
Problem 724
Leetcode 724
Find Pivot Index java
Find Pivot Index C++
Find Pivot Index
Array questions in Leetcode
String questions in Leetcode
Array Interview questions in java for freshers
String Interview questions in java for freshers
Array questions in java in hindi
String questions in java in hindi
#codinglife #programming #webdev #codenewbie #fullstack #frontend #backend #devops #blockchain #leetcode #algorithms #datascience #python #javascript #java #cpp #ruby #golang #rust #php #sql #cloudcomputing #docker #kubernetes #serverless #web3 #techcommunity #softwareengineering #codechallenge #developerlife #array ###codingjourney #doublylinkedlist #codingproblems #codenewbie #javaprogramming #leetcodejava #linkedlistimplementation #arraysinjava #leetcodechallenge #leetcodejava #learning #datastructure #datastructureimplementation #algorithms #dsa #dsalgo #softwareengineering #faang #faangpreparation #faangcodinginterviewpreparation #faangpreparation #interviewquestions #interview #codingquestions #codingtutorial #codingforbeginners
===========================
➡️ Connect with me:
LinkedIn : / anuj-kumar-9a188968
Instagram : / mr.anuj.brandy
Discord : / discord
===========================
Join Our Discord Community!
Looking to master data structures and algorithms, ace your interviews, or dive into tech discussions? Our Discord server is the perfect place for you!
Join here : discord.gg/bbJXxFcauK
Whether you're preparing for a job interview or just passionate about coding, you'll find valuable resources, discussions, and support from like-minded individuals.
See you there!
Anuj.. I was waiting for your lecture video in this week, didn't receive any.
Hope everything is fine at your end.
Waiting eagerly for the upcoming video to come asap !!
@@souvik5560 i am really sorry. I am travelling out of country and will be back by wednesday. Post that I will be posting many videos daily. Keep learning :)
By using the Actual Prefix sum method, the Time complexity will be same O(n) but the Space Complexity will be more i.e. O(n) due to the usage of an extra array for maintaining the Prefix sum.
But if we do in place prefix sum then also we get Time complexity and Space complexity as O(1)
Time complexity will be O(n). Can you explain the case when it will be O(1) ?
Also inplace generally is not a good idea to do unless explicitly told by the interviewer or you have clarified it with them first
@@LeetCodeIO-Anuj Auxiliary space is O(1) if it is in place.
@@LeetCodeIO-Anuj Got it
@@souvik5560 yes it is :)
Its just that we should discuss these things with the interviewer if its okay with him. Otherwise its not worth spending time on implementing something that interviewer might not want you to :)
Bhai strings ki playlist or kb arhi hai jldi dldo ekbri mein placement season arha mera
Next week wednesday tak :)