Author: Serhat Giydiren

Join me to stay up-to-date and get my new articles delivered to your inbox by subscribing here.

Quotes from the TED talk “Drew Dudley – Everyday leadership” - February 20, 2022

Our greatest fear is not that we are inadequate. It is that we are powerful beyond measure. It is our light and not our darkness that frightens us. We need to get over our fear of how extraordinarily powerful we can be in each other’s lives. We need to get over it so we can […]

Read more

Competitive Programming - February 10, 2022

Aka Sports Programming. If you like to develop code, learn, use and create data structures / algorithms, it’s a sport for you. It is a fun world where you can come together and compete with those who love to do the same sport, and you can practice as much as you want outside the competitions. […]

Read more

Coding Competitions - January 31, 2022

Date Competition Round Rank 24.02.2022 Google Hash Code Qualification Round 20 / 10.177 (Qualified for World Finals) 11.09.2021 Facebook Hacker Cup Round 1 1.878 / 12.692 (Qualified for Round 2) 16.10.2021 Google Kick Start Round G 477 / 9.448 22.08.2021 Google Kick Start Round E 337 / 6.936 11.07.2021 Google Kick Start Round D 596 […]

Read more

Build confidence with self-promotion - January 21, 2022

Learning how to speak openly about your accomplishments helps others understand your strengths and skills. Introduction to self-promotion Understanding the power of self-promotion will help you make others aware of the unique contribution you can make. The related video is here. Just keep your head down! Don’t be arrogant! Stop showing off! Nobody likes a […]

Read more

System Design Interview – Top K Problem (Heavy Hitters) - June 7, 2021

Besides reading this post, I strongly recommend reading chapter 10 (Real-time Gaming Leaderboard) of the book System Design Interview – An Insider’s Guide: Volume 2 (Xu, Alex – Lam, Sahn) You can review alternative resources as well. Functional Requirements Non-Functional Requirements Hash table, single host Hash table, multiple hosts Hash table, multiple hosts, partitioning Count-min sketch […]

Read more

System Design Interview – Rate Limiting (local and distributed) - May 6, 2021

Besides reading this post, I strongly recommend reading chapter 4 (Design a Rate Limiter) of the book System Design Interview – An insider’s guide (Xu, Alex) You can review alternative resources as well. Functional Requirements Non-Functional Requirements Token Bucket Algorithm Interfaces & Classes Step into the distributed world Message Broadcasting How do we integrate all What […]

Read more

System Design Interview – Notification Service - April 5, 2021

Besides reading this post, I strongly recommend reading chapter 10 (Design a Notification System) of the book System Design Interview – An insider’s guide (Xu, Alex) You can review alternative resources as well. Functional Requirements Non-Functional Requirements High-level Architecture FrontEnd Service Metadata Service Temporary Storage Sender What else is important… Final Look This content was excerpted […]

Read more

System Design Interview – Distributed Message Queue - March 4, 2021

Besides reading this post, I strongly recommend reading chapter 4 (Distributed Message Queue) of the book System Design Interview – An Insider’s Guide: Volume 2 (Xu, Alex – Lam, Sahn) You can review alternative resources as well. Synchronous Communication Asynchronous Communication Functional Requirements Non-Functional Requirements High-level Architecture VIP and Load Balancer FrontEnd Service Metadata Service BackEnd […]

Read more

System Design Interview – Distributed Cache - February 3, 2021

Besides reading this post, I strongly recommend reading chapter 5 (Design Consistent Hashing) and chapter 6 (Design a Key-Value Store) of the book System Design Interview – An insider’s guide (Xu, Alex) You can review alternative resources as well. Functional Requirements Non-Functional Requirements Some Tips LRU cache algorithm explanation LRU cache algorithm implementation Stepping into the […]

Read more

1 6 7 8