Systems & Software Engineering Journal

System Design, C++ & Low-Latency Engineering

Interactive HLD simulators, 300+ DSA problems in C++, lock-free concurrency, Linux internals, and real interview experiences — written for engineers targeting FAANG, HFT and Fintech roles.

3Live Simulators
300+DSA Solved
C++17/20Core Stack
HFTFocus Area

📚 Latest Articles

DSA solutions, systems programming deep-dives, and interview experiences.

FAANG / MAANG Interview Prep

Top 10 FAANG / MAANG Binary Tree DSA Questions & C++ Solutions

Master LC 236, 124, 297, 863, 987, 437, 114, 105, 662, and 2385. Includes step-by-step intuition, pre-rendered ASCII diagrams, dry runs, and high-performance C++ implementations.

Binary Tree LeetCode Top 100 C++ FAANG Prep

OS & Linux Interview Bible – FAANG + Fintech Edition (Goldman, Citadel, Razorpay)

One-day revision guide covering OS fundamentals, process & thread internals, memory management, Linux commands, scheduling, IPC, networking, and HFT-level performance tuning — with real interview questions from Google, Amazon, Goldman Sachs & Citadel.

Operating Systems Linux FAANG Fintech
MediaTek Online Assessment interview experience notes

MediaTek Online Assessment Experience (2026)

Aptitude, Digital Logic, C code snippet questions and bit manipulation coding round.

Interview Experience

Linux Command Line Shell in C++17 – POSIX System Programming, fork/exec, Pipes & Process Management

Built a modular Unix-style shell from scratch using low-level POSIX system calls. Implemented fork/exec process lifecycle, pipelines, I/O redirection, job control, and built-in commands with efficient C++ design and CMake architecture.

Linux POSIX C++17

Lock-Free SPSC Ring Buffer in C++ – Atomics, Memory Ordering & 20M+ msg/sec

Production-grade single-producer single-consumer queue built with std::atomic, acquire-release ordering, cache alignment and zero locks for ultra-low latency systems.

Concurrency Atomics Low Latency

LeetCode 64 – Minimum Path Sum (C++ DP + Memoization)

Step-by-step intuition, handwritten notes and optimized C++ solution.

Dynamic Programming

Breadth First Search (BFS) Traversal – Graph | C++

Queue based BFS traversal with intuition, dry run and handwritten notes.

Graph