Arrays vs Linked List | EP 4

preview_player
Показать описание


Hi, I am Fraz.
I am Software Engineer working at Curefit and I love teaching.
This is my Channel where I upload content related to Interviews and my personal experiences.

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

Clear Cut Explaination Hai bhai. Super Awesome.

CodeCraftsman
Автор

This is a common interview question (Bank of America asked me). Thanks for this, I would have answered better if I watched this video before the interview XD.

amritnalam
Автор

great series ...enjoying and learning forward to more series like this for other data structures

gengar_
Автор

Lect - 5 completed, sir love♥️ the way you explain each and every concept, please keep creating such wonderful content 💯 your playlist are helping me alot in understanding the topics and improving my skills.
Thankyou bhaiya ♥️

raghvendrakhatri
Автор

Great video. Insightful have too much to learn.

mianawais
Автор

Enjoying the LinkedList series.. thanks a lot

ujjwalbhardwaj
Автор

Keep uploading. Very much helpful to students

saurabhnayak
Автор

great. bhaiyea please cover the graph topic...

yash-he
Автор

for deleting a node in linked list, we need to travel to the node (o(n)) and then delete the node (o(1))..then total complexity is o(n).right???

bharathkumar
Автор

Thank you very much. You are a genius.

vakhariyajay
Автор

Hi Fraz thanks for your work,

Even in Linked List to perform deletion we need to traverse to that node right, in worst case if it is last node then we need to iterate towards last ...

TrulyFanBoy
Автор

But if I talk about memory management then the dynamic array is also used to handle the large data l, Use LinkedIn list if you want to delete and insert elements else you can you hash or dynamic array.

Shahid-v
Автор

Hii Sir
Please create contents on arrays, stack, queue.
It's a good jod I have seen ur recursion lec.

shaistaparveen
Автор

Sir please add these series in the playlist so it will be very helpful for us

utkarshsingh
Автор

Thank You So Much Bhaiya❤
Completed this lecture😊

rupampakhira
Автор

how the deletion time in doubly linked list is O(n) since there we need to find the node which we want to delete by traversing nodes which takes O(N) time same as singly linked list?

lalitbisht
Автор

Finished Lec 5 : Building confidence in Linked List

purushottamkumar
Автор

Array is static while linkedlist is dynamic ✌

TechUnboxing
Автор

Please 🙏 continue sir it's humble request sir

HarshRaj-kpgk
Автор

enjoying a lot but struggling with the backlog topics

rishabhrastogi