1 views collected around this technical thread.
The article examines an interview question about storing 2 billion phone numbers, explains why int cannot hold 11‑digit numbers, advocates using VARCHAR(20) for flexibility and data integrity, and outlines common pitfalls and best practices for database design.
This article explains the LazyMan interview problem, demonstrates how to build a JavaScript function supporting chainable sleep, eat, and sleepFirst methods using task queues, and provides step‑by‑step code implementations with explanations and visual results.
The article first presents a detailed analysis of Tencent's 2024 campus recruitment salary packages for various programmer offers, then introduces a classic algorithmic challenge of reversing a linked list in groups of k nodes, providing step‑by‑step explanation and a complete Java implementation.
This article explains the classic water‑jug interview problem using two cups of 9 L and 15 L, derives the reachable volumes via greatest‑common‑divisor logic, and provides complete C++ code to determine feasibility and output the pouring steps for any target volume.
This article explains a Java interview puzzle by analyzing how the JVM stack frame handles variable assignments and increment operators, step‑by‑step showing the effects of i = i++, i = ++i, and a complex expression i + ++i * i++ on variable values.
This article presents a notoriously tricky Java interview problem, walks through its multithreaded code, explains the possible outputs, and then expands into a comprehensive discussion of thread‑safety concepts, synchronization mechanisms, and best practices for writing safe concurrent Java programs.