Full-stack Developers
A channel where people can seek help or show their skills regarding full-stack web-dev. Happy coding
Ko'proq ko'rsatishMamlakat belgilanmaganTil belgilanmaganToif belgilanmagan
425
Obunachilar
Ma'lumot yo'q24 soatlar
Ma'lumot yo'q7 kunlar
Ma'lumot yo'q30 kunlar
- Kanalning o'sishi
- Post qamrovi
- ER - jalb qilish nisbati
Ma'lumot yuklanmoqda...
Obunachilar o'sish tezligi
Ma'lumot yuklanmoqda...
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in x time.Anonymous voting
- O(m+n)
- O(mn)
- O(m)
- O(mlogn)
Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.Anonymous voting
- O(logn)
- O(nlog2)
- O(n)
- O(1)
What are the worst case and average case complexities of a binary search tree?Anonymous voting
- O(n), O(n)
- O(logn), O(logn)
- O(logn), O(n)
- O(n), O(logn)
Join algochallenges for coding interview preparation!
Hammasini ko'rsatish...
Algochallenges
Daily algorithm questions with explanations. Prepare for your next coding interview!
If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?Anonymous voting
- 2i+1
- 2i+2
- 2i
- 4i
When client asks to make loading animation a bit more interesting 😂
Hammasini ko'rsatish...
How We Build Micro Frontends
Building micro-frontends to speed up and scale our web development process.