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 37 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 2 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 2 years ago
Big O = Scalability of codePosted 2 days ago
efficient code save time and space, 0(log N) is the fastest.Posted 4 days ago
I learned that the Big O notation is used to test how effective an algorithm is and that it is important to aim for efficient and less complex code as much as possible and avoid nested if statements as this automatically increase the time complexity for said algorithm.Posted 5 days ago
efficient code save time and space, 0(log N) is the fastest.Posted 5 days ago
big O will teach us how to think about time and space complexity..Posted 5 days ago
In coding, there are a lot of ways to solve a problem. So we need a metric to measure how good a solution is. One such metric is efficiency/time. Given the size of today's inputs for a code and how large the data is to be processed. We should try our best to have an algorithm whose time to finish (time complexity) is minimized. As much as possible our time complexity should be O(1) at best (Fixed time) and if it is not possible, we should limit it to O(N^2) at worst (Exponential time).Posted 5 days ago
That better code has shorter run time.Posted 14 days ago
I learned that you can write code does the same thing, but one way may take 0.002 seconds, and the other one 8000 years. And, that's where choosing the right algorithm is important in these cases.Posted 21 days ago