Please enable JavaScript.
Coggle requires JavaScript to display documents.
Master the Interview Click here for Course Link (🎁Graphs (🎁Tree (Tree…
🎁Hash Tables
**could be O(n) with hash collisions and dynamic array resizing but unlikely
Improve Time Complexity?
Fast Access O(1), tradeoff: more memory O(n)
-
-
-
🎁Arrays
Dynamic
** can be O(n) on expanding memory
-
Searching. Is it sorted?
-
No. Will sorting make it faster? If still no, Linear Search🚀
-
-
-
-
-