Every interviewer asks about arrays hashmaps and trees and what is O notation access times to the item in those data structures
<img src="https://media.daily.dev/image/upload/s--SdtjuJvY--/f_auto/v1729026427/ugc/content_a8dd5134-d5a4-4abd-ab5a-4f423fdcf7cb" alt="image">
And second big interview helper is sorting #algorithms, if you have a photographic memory this would help you
<img src="https://media.daily.dev/image/upload/s--Ps7G_A6L--/f_auto/v1729026542/ugc/content_52416948-99b4-49fd-a8a1-2c75dd5dfcdc" alt="image">
Btw which one is faster O(logn) or O(n) below graphic shows their speed difference
<img src="https://media.daily.dev/image/upload/s--CH2HSdS7--/f_auto/v1729026740/ugc/content_65f3886f-03a2-491e-bf11-44e3d095da50" alt="image">
O(logn) is faster than O(n) 🤓
Reference:
<ul>
<li><a href="https://www.bigocheatsheet.com/" target="_blank" rel="noopener nofollow">https://www.bigocheatsheet.com/</a></li>
</ul>
#bigonotation #interview #jobinterview

Java linux and .NET technology and sometimes science posts will be here

World of technology

Understanding arrays, hashmaps, trees, and their O notation access times is crucial for interviews. Sorting algorithms are also essential. A comparison shows O(logn) is faster than O(n).

Data structures and algorithms cheat sheet for interviews

When interviewers ask trivia questions like that I wonder if maybe they should just hire the cheat sheet if that’s all they value in a developer. Sheesh. “Congratulations, you passed our ‘memorize a cheat sheet’ test. Welcome to our company where all your teammates are in the top 1% of memorizing cheat sheets.”
Lazy ineffectual interview tests are a massive red flag.

Many thanks for the useful information, especially in the comment section.

Shouldn’t O(n) curve have a 45 degree slope?

this is what every fresher need before interview. Thanks