Split Array into Consecutive Subsequences || Leetcode Daily Challenge

Link to the Split Array into Consecutive Subsequences code is given below =
github.com/The...
Link to the Github Repository Link for all the codes is given below ==
github.com/The...
Link to the Split Array into Consecutive Subsequences Problem ==
leetcode.com/p...
Link to the playlist =
• GFG Daily Problem
#leetcode #leetcodequestionandanswers #leetcodechallenge #leetcodesolution #leetcodedailychallenge #hashmap #problem #problemsolving

[@_sonu_]

When watching your videos, I accidentally hit ‘like’ and never knew when

[@GagandeepSingh-cy8jp]

thank u for the explanation and congrats for ur 100 subscribers, BTW I became ur 100th subscriber!!😁😁

[@Lalit_Samiksha]

Thanks a lot it only became possible because of viewers like you thanks a lot

[@sourabhjaipurwala3117]

Nice explaination ji

[@volkangaming5214]

Aur idhar ghusar denge apan 4 😂. Btw Explaination bariya tha guru🫡

[@VinayShelke-pl1fv]

i was trying to understand for a while very well explained

[@Jitendrakumar-gb7cn]

good confidence

[@vivekgagrani8288]

Good

[@mandarparekh8959]

thanks...

[@laxmikantsaraswat6319]

thanks

[@pritishpattnaik4674]

I was trying in a wrong manner , great solution , btw ur voice is so sweet

[@dipakrana8539]

Good Explain.

[@deveshdubey6776]

got the process that how to solve the question ...but didn't get the intutuion!!

[@Lalit_Samiksha]

i recommend you to please watch the video again and still if you phase the same issue or some other issue then we will definitely try to solve it.

[@rachitbadoni5717]

Nice explanation ❤

[@aka_akaran]

Well Explained!👍🏻

[@_Nikhil_Kaushik]

kuchh smjh nahi aaya

[@BMEMdKaifAli]

nyc voice 😁

[@deepeshgrover600]

[@devendrabhuarya4917]

Samjh me aa gya Lekin solution ke pichhe ka logic bhi samjh diya karo

[@Lalit_Samiksha]

thanks for the feedback and sorry for the inconvenience occurred we will take care of it from next time.

[@ankitnishad1229]

how will i apperoach such solution during interviews :( lmao....

[@Lalit_Samiksha]

There is no predefined formula for any question even though this question can also be solved through many other ways it just depends how much you practice and the no. of questions you solve.

[@Videorts]

your voice is cute tho

[@ayushsingh5951]

can we connect on linkedIn?

[@player-te8tf]

tinder maang le bhai

[@gopisaikrishnavuta5565]

It is mentioned in the description that "Determine if its possible to split nums into "ONE" or more subsequent Sequences
Now consider example 3, which says
Input: nums = [1,2,3,4,4,5]
Output: false
Explanation: It is impossible to split nums into consecutive increasing subsequences of length 3 or more.
But we still can split the above into "one" subsequent sequence which follows both the conditions like [1,2,3,4,5]???

[@AtulKumar-gi3lv]

where have you sent 4😂 . There is two times 4. Everything is correct in example 3. See it carefully bro!

[@rachitsen]

each subsequence must be of minimum length of 3 and in increasing order, so in your example just 4 is left which is a subsequence of length 1 that's why false.

[@Lalit_Samiksha]

Yes surely we can convert the array (1,2,3,4,5) into a single subsequence but a single subsequence of 4 will still remain whose length is less than 1 so the answer false.

[@player-te8tf]

see you can form a single subsequence [1,2,3,4,5] but,but,but, the left over partitioned array will only be [4] so basically you cant just partition the array into a single increasing subsequence and say that the second partition which is left is having an increasing subsequence too.