All O`one Data Structure

preview_player
Показать описание
This video explains implementing all O one data structure using doubly linked list and unordered map. The APIs implemented are increase key, decrease key, get maximum key, get minimum key.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: +91 8918633037
---------------------------------------------------------------------------------------------------------------------------------------------------------------

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

Thought it will take atleast 3-4 vidoes to understand this problem. Glad I watched your video first. Great and clearrrr explanation. Thanks dude.

GANESHKUMAR-wwdv
Автор

A well thought explanation.
I am impressed.❤

SHUBHAMJHA-og
Автор

Can’t we only hashmap only to implement this? Why we need linked list or array here ? As we can store frequencies of those keys in the map instead of object

FunToDetox
Автор

Didn't understand how adding a new string is O(1) time. Doesn't it take O(n) time in DLL to add a new element so that DLL is sorted.

akhilYT