Full-stack Developers
A channel where people can seek help or show their skills regarding full-stack web-dev. Happy coding
Show moreThe country is not specifiedThe language is not specifiedThe category is not specified
425
Subscribers
No data24 hours
No data7 days
No data30 days
- Subscribers
- Post coverage
- ER - engagement ratio
Data loading in progress...
Subscriber growth rate
Data loading in progress...
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)
Show all...
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 😂
animation.gif.mp40.35 KB
Show all...
How We Build Micro Frontends
Building micro-frontends to speed up and scale our web development process.