2161. Partition Array According to Given Pivot || LeetCode 2161 || Biweekly LeetCode 71

Here in this video we have discussed the approach to solve
2161 Minimum Sum of Four Digit Number After Splitting Digits of Biweekly Contest 71 .
Question Link :- leetcode.com/contest/biweekly...
Code Link :-
Presenting you the best placement preparation course document down here
👇(You can download the sheet and use it as a tracker as per your convenience).
⭐ Link for the Bro Coders PPC sheet:- onedrive.live.com/view.aspx?r... After this if you need doubt support join our telegram channel for getting it solved
👇🏻
🔔Join the telegram channel for doubts and discussions:-t.me/joinchat/wSYWX-gbgoRjNmNl
If you follow this course in sequential manner it would be most optimal. Otherwise if you are at intermediate level and want selective preparation of any particular topic you can jump directly, otherwise it's not suggested. And also since it's our new endeavor to help out students with quality education free of cost . So please help us in this mission!!!
❇️ Like, Share, Subscribe!!
========================================================================
🔔Follow us on Instagram:- / bro_codrs
🔔Join the telegram channel for doubts and discussions:-t.me/joinchat/wSYWX-gbgoRjNmNl
========================================================================
Link to our other major series:-
✅Dynamic Programming: czcams.com/users/playlist?list...
✅Recursion: czcams.com/users/playlist?list...
✅Backtracking: czcams.com/users/playlist?list...
✅Greedy: czcams.com/users/playlist?list...
✅Array: czcams.com/users/playlist?list...
✅Hashing: czcams.com/users/playlist?list...
✅Linked List: czcams.com/users/playlist?list...
✅Binary Search Tree : • Search in a Binary Sea...
✅Binary Tree : • Binary Tree -Course In...
✅Stack : • Parenthesis Checker |...
✅Queue : • Queue Basics and STL||...
✅Maths: • Find factors , check f...
========================================================================
🔱To buy books at excessive cheap prices and sell your old books, visit :- www.bookstop.me
========================================================================
For convenience, refer to given timestamps:-
========================================================================
#BroCoders #LeetCode #InteviewBits #GFG #PlacementCourse #dp #stack #queue #maths #greedy #array #binaryTree #BST #Graphs #recursion #backtracking #string #stl #c++ #java #DSA #CompetitveProgramming #CodeForces #CodeChef #ICPC #CompetitiveCoding #FreePlacementSeries #Microsoft #Google #Amazon #Apple #Facebook #FlipKart #Netflix #TowerResearch #VMWare #DirectI #CodeNation #Infosys #GoldmanSachs #TCS #Tier3 #IIT #NIT #IIIT #Interview #Aptitude #Contest #CodingContest #HackerRank #HackerEarth #BinarySearch #BroCode #Trending #PlacementUpdates #PlacementNotification #IntenshipUpdates #InternshipNotification #LinkedIn #Samsung #Naukri #SoftwareEngineer #Hackathon #SoftwareDevelopmentEngineer #SDE #IT #ComputerScience #CSE #FAANG #DynamicProgramming #2129#LeetCode #CapitalisetheTitle #BiweeklyLeetCode
Biweekly70 #2129 #solution #answer #Fastest_answer
2161. Partition Array According to Given Pivot || LeetCode 2161 || Biweekly LeetCode 71
2161. Partition Array According to Given Pivot || LeetCode 2161 || Biweekly LeetCode 71
2161. Partition Array According to Given Pivot || LeetCode 2161 || Biweekly LeetCode 71
2161. Partition Array According to Given Pivot || LeetCode 2161 || Biweekly LeetCode 71

[@AnkitSharma-jk2wx]

ram ram bhiya .. jai siya ram

[@BroCoders]

Jai Shree Ram!!

[@pritishpattnaik4674]

very nice approach for contests

[@BroCoders]

Glad you liked it

[@imshivendra]

can anyone correct me why I m getting wrong output
class Solution {
public:
vector pivotArray(vector& nums, int pivot) {


int start=0;
int end=nums.size()-1;
int run=0;

while(run

[@imshivendra]

can anyone correct me why I m getting wrong output
class Solution {
public:
vector pivotArray(vector& nums, int pivot) {


int start=0;
int end=nums.size()-1;
int run=0;

while(run

[@BroCoders]

You have not maintained the order of array in case of end pointer, if say 12 comes and then 11 and your pivot is 10. So, your code is first pushing 12 towards the end and then pushing 11 before it but is should be opposite 12 succedded by 11.
I hope you understand

[@BroCoders]

You have not maintained the order of array in case of end pointer, if say 12 comes and then 11 and your pivot is 10. So, your code is first pushing 12 towards the end and then pushing 11 before it but is should be opposite 12 succedded by 11.
I hope you understand

[@abhijitroy1958]

for a sec i had a thought of this sol ,but later i use swap function and 2 pointers

[@BroCoders]

That comes but during contest we have to be fast!!

[@abhijitroy1958]

@@BroCoders yes, that's why I was able to solve only 2

[@imshivendra]

Abhijeet Bro i also used swap function and two pointers approach but i am getting wrong output can you correct me?
class Solution {
public:
vector pivotArray(vector& nums, int pivot) {


int start=0;
int end=nums.size()-1;
int run=0;

while(run

[@abhijitroy1958]

@@imshivendra your answer is all good brother but the end pointer is not allowing you to print the answer in input sequential manner so it's throwing error . I used an extra space for this case else I have also written the same code before and faced the error

[@imshivendra]

@@abhijitroy1958 Bro if you won't mind please share your code

[@daku2op926]

please 3rd and 4th bhi daldo bro😄

[@BroCoders]

Almost there!! video coming in few minutes!!

[@imshivendra]

can anyone correct me why I m getting wrong output
class Solution {
public:
vector pivotArray(vector& nums, int pivot) {


int start=0;
int end=nums.size()-1;
int run=0;

while(run

[@imshivendra]

@@BroCoders can anyone correct me why I m getting wrong output
class Solution {
public:
vector pivotArray(vector& nums, int pivot) {


int start=0;
int end=nums.size()-1;
int run=0;

while(run

[@rohithchittibommala2002]

Suggestion is don't use #tags in description, CZcams reduces reach instead use just words like #Internship to
Internship

[@BroCoders]

Thanks bhai!!
Will implement from upcoming videos!!

[@rohithchittibommala2002]

​@@BroCoders it is very minute help when compared to your help

[@BroCoders]

@@rohithchittibommala2002 😊😊

[@imshivendra]

class Solution {
public:
vector pivotArray(vector& nums, int pivot) {


int start=0;
int end=nums.size()-1;
int run=0;

while(run