Oops!
We apologize for the inconvenience. We encountered an internal error or misconfiguration and was unable to complete your request.
To continue, please reload the page. Thank you!
Thank you, but we only allow users who solved at least 10 units to write a review.
Please use 0 credits to unlock all premium contents on Adv. Algorithms & Data Structures
Insufficient credit? Buy Credits or to get +10 credits.
Congratulations! You’ve solved all of the 50 units of Adv. Algorithms & Data Structures and earned a total of stars. Go to dashboard and pick the learning module that you want to take up next.
Log in so your best work can be saved as your advances through the game.
By logging in, I agree to Hacker Hero's Terms of Service and Privacy Policy.
We apologize for the inconvenience. We encountered an internal error or misconfiguration and was unable to complete your request.
To continue, please reload the page. Thank you!
You have credits available. Would you like to use your 0 credits to unlock the premium content of Adv. Algorithms & Data Structures?
Unlock more video solutions and premium contents, Go PRO, Buy Credits or to get +10 credits
You have credits available but this module requires 0 credits. Do you want to buy additional credits to access ALL premium contents of Adv. Algorithms & Data Structures?
Unlock more video solutions and premium contents, Go PRO or to get +10 credits
Credits are used to unlock video solutions and access premium contents. You can buy more credits for as low as $5.
Buy Credits
Top Answers
One for loop is better than two, and nested for loops are the devil. Binary search trees are king.Posted 3 years ago
Big O notation is Used to tell how long the code runs for large amount of data. The bigger the power of N , longer is the time taken to run and it become less efficient.Posted 3 years ago
Big(O) notation can help you understand why your code is inefficient.Posted 5 days ago
Great!Posted 18 days ago
Think about the code logic, and check its Big O. If it is larger than N or there's a possibility to make it log(n), use other techniques, which may be another selected data structure, to reduce the time and get a faster version.Posted 22 days ago
Ok, hard things aheadPosted 1 month ago
run-time complexity is a big factor when comes to performancePosted 1 month ago
nicePosted 2 months ago
okPosted 2 months ago
we need to write code efficiently, be mindful of why we do this algorithm and data structures.. run-time complexity is a big factor when comes to performance of the applicationPosted 2 months ago