Check Array Formation Through Concatenation | Leetcode 1640 | Live Coding session

preview_player
Показать описание
1) 0:00 Explaining the problem out loud
2) 3:00 Algorithm walkthrough
3) 8:00 Coding it up
4) 12:40 Time complexity

TC :O(n)
SC :O(n)
where n is the no elements in the input array

Code Link

Рекомендации по теме
Комментарии
Автор

This is the best explanation of this question on youtube. I understood every single line. Thanks. Subbed.

ammarshareef
Автор

Excellent explanation and solution thank you

rsKayiira
Автор

Great explanation! . Please include the link of the problem in the description as well if possible.

bamiodsnjsand
Автор

Great Explanation. Came here to verify my solution 👍

simranjeetrandhawa
Автор

This time the explanation was pretty clear.🙌

ramchandrayadav
Автор

you should try to add some comments for better understanding the code

pranavkataria
join shbcf.ru