Read about my experience interviewing for a Site Reliability Engineer role at TikTok. Learn from my mistakes, discover key insights, and get valuable tips for your own job search.
My First Ever Interview Experience: Software Engineer, General (GCloud Tech Infra 24x7 (Site Reliability))
1.5k 6 mins. Disqus: loading ...
Explore my personal experience interviewing for a Site Reliability Engineer (SRE) role at Google, my first ever job interview. Follow my journey from the initial HR call to the technical interview rounds, including valuable insights, challenges, and key takeaways.
Euclidean Algorithm: Finding the Greatest Common Divisor (GCD)
533 2 mins. Disqus: loading ...
Discover the Euclidean Algorithm, an efficient method for finding the greatest common divisor (GCD) of two numbers. This guide includes a step-by-step explanation and Java implementation, perfect for software engineers and algorithm enthusiasts.
My Journey in Elixir Phoenix
wip ...
https://www.phoenixframework.org/ https://devhints.io/phoenix-migrations https://thinkingelixir.com/available-courses/ https://www.openmymind.net/Pattern-Matching-In-Elixir/ https://hashrocket.com/blog https://felt.com/blog/rate-limiting https://curiosum.com/blog/phoenix-framework-guide
Dijkstra's Algorithm: Efficient Shortest Path Finding in Graphs
1.2k 4 mins. Disqus: loading ...
Dive into Dijkstra's Algorithm, a fundamental graph algorithm for finding the shortest paths between nodes with non-negative weights. Learn how it works, its use cases, and how it compares to other shortest path algorithms.
Floyd-Warshall Algorithm: Comprehensive Guide to All-Pairs Shortest Paths
1.3k 5 mins. Disqus: loading ...
Explore the Floyd-Warshall algorithm for finding shortest paths between all pairs of vertices in a weighted graph. Learn about its applications, benefits, and limitations in handling both positive and negative edge weights.
Floyd's Tortoise and Hare Algorithm: Efficient Cycle Detection
350 1 mins. Disqus: loading ...
Explore Floyd's Tortoise and Hare Algorithm for detecting cycles in linked lists and arrays. This efficient algorithm, named after Robert W. Floyd, uses two pointers moving at different speeds to identify cycles with linear time complexity and minimal space usage.
SQL Notebook
1.2k 4 mins. Disqus: loading ...
A personal collection of SQL notes, including basic commands, useful tips, and best practices for working with databases. This notebook covers practical examples and insights from using MySQL and PostgreSQL, aimed at helping you keep track of essential SQL concepts and techniques.
Vim Notebook
539 2 mins. loading ...
Explore a personal collection of Vim commands and tricks that I've found useful in enhancing my text editing efficiency. Whether you're a DevOps engineer, a frontend developer, or a backend coder, these notes will guide you through mastering Vim.
Innovative Portfolio: A Journey Through Software and Technology
Explore my portfolio of cutting-edge software and technology projects. From mobile apps to web platforms, discover how I solve real-world challenges with innovative and effective solutions.
Goals 2024
In 2024, I am aiming to grow both professionally and personally. From pursuing a Computer Science degree and levelling up at ByteDance to rekindling old hobbies like beatboxing and investing in financial growth. Here's my plan.
Big-O Notation Notebook
2.3k 8 mins. Disqus: loading ...
Join me as I explore Big-O Notation through my personal notes. This blog is a space where I document my understanding of algorithm efficiency, offering insights into how I approach time and space optimisation in coding.
Java Notebook
0 1 mins. Disqus: loading ...
A collection of notes and resources for Java programming language