Neo Kim's Linkedin Analytics

Give me 2 mins—I'll teach you how Big O works: • Big O tells how much slower a code gets as the input increases. • There are best, average, and worst cases for a specific algorithm. • Also there are Big Os for time, memory, and storage efficiency. • Big O helps to understand which data structures or algorithms have better performance. • Big O shows the growth rate and not the actual speed. So it's important to test the input data. What else would you add? —— 👋 PS - If you enjoyed this post, you'll love my free newsletter on system design. Join 140,000+ engineers and get the powerful system design template: → https://lnkd.in/eWAp5ZwE ——— ♻ Repost to help others write good code. ➕ Follow Neo Kim for more.

If you want to reduce latency, learn these 12 rules: What would you add to the list? —— 👋 PS - If you enjoyed this post, you'll love my free newsletter on system design. Join 140,000+ engineers and get the powerful system design template: → https://lnkd.in/eWAp5ZwE ——— ♻ Repost to help others learn system design. ➕ Follow Neo Kim for more.