Tagged articles

17 articles

Page 1 of 1

Aug 25, 2025 · Fundamentals

How to Efficiently Compress Strings in Java: Interview‑Ready Solution

The article critiques absurd interview questions, then presents a practical Java solution for compressing strings by replacing consecutive characters with their counts, explains the algorithm’s O(n) time and O(1) extra space, discusses edge cases like multi‑digit counts and Unicode handling, and offers implementation tips.

String Compressionalgorithminterview question

0 likes · 6 min read

How to Efficiently Compress Strings in Java: Interview‑Ready Solution

Liangxu Linux

May 14, 2025 · Fundamentals

Can TCP and UDP Share the Same Port? A Deep Dive into Port Mechanics

This article breaks down the interview question "Can TCP and UDP use the same port?" by examining protocol-level port spaces, client‑side TCP and UDP port sharing rules, server‑side TCP reuse with SO_REUSEADDR, and UDP reuse with SO_REUSEPORT, complete with code examples and practical implications.

Network programmingPort SharingSO_REUSEADDR

0 likes · 17 min read

Can TCP and UDP Share the Same Port? A Deep Dive into Port Mechanics

macrozheng

May 8, 2025 · Databases

Why Storing 2 Billion Phone Numbers Requires VARCHAR(20) Over INT: Interview Insights

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.

BIGINTDatabase designinterview question

0 likes · 8 min read

Why Storing 2 Billion Phone Numbers Requires VARCHAR(20) Over INT: Interview Insights

Rare Earth Juejin Tech Community

Dec 15, 2024 · Frontend Development

Implementing LazyMan in JavaScript with Chainable Methods and Task Queue

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.

AsyncChainableJavaScript

0 likes · 7 min read

Implementing LazyMan in JavaScript with Chainable Methods and Task Queue

Java Tech Enthusiast

Jul 13, 2024 · Interview Experience

How to Move 1,000 TB from Nanjing to Beijing: Network Math vs. Human Courier

An interview question explores the fastest way to transfer a 1,000 TB dataset from Nanjing to Beijing, comparing high‑speed network links, their costs and transfer times, with a practical, low‑cost solution of physically shipping hard‑drive containers by high‑speed rail.

Data TransferLogisticsNetwork Bandwidth

0 likes · 4 min read

How to Move 1,000 TB from Nanjing to Beijing: Network Math vs. Human Courier

IT Services Circle

Dec 29, 2023 · Fundamentals

Tencent 2024 Campus Recruitment Salary Overview and Reverse Nodes in k‑Group Java Solution

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.

Data Structuresinterview questionjava

0 likes · 9 min read

Tencent 2024 Campus Recruitment Salary Overview and Reverse Nodes in k‑Group Java Solution

Python Crawling & Data Mining

Sep 14, 2023 · Fundamentals

How to Parse Level‑Up Logs with Python and Pandas – Full Code Explained

This article walks through a Python interview problem that extracts level‑up events from a log file, demonstrating step‑by‑step data cleaning, JSON parsing, and aggregation with pandas, and provides the complete, ready‑to‑run code plus visual explanations.

Code Tutorialinterview questionlog parsing

0 likes · 5 min read

How to Parse Level‑Up Logs with Python and Pandas – Full Code Explained

Java Interview Crash Guide

Mar 11, 2022 · Fundamentals

Why Java’s Integer Caching Can Make ‘a==b’ Return True – The Hidden Truth

Many interviewees expect the Java expression ‘a == b’ to be false and ‘c == d’ true when using Integer objects, but due to the Integer cache range and JVM settings, both comparisons can actually return true, a nuance explained through source code analysis and cache configuration.

JVMObject Comparisoninteger caching

0 likes · 6 min read

Why Java’s Integer Caching Can Make ‘a==b’ Return True – The Hidden Truth

IT Services Circle

Feb 6, 2022 · Fundamentals

Measuring Water with Two Cups: Logical Analysis and C++ 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.

GCDalgorithminterview question

0 likes · 6 min read

Measuring Water with Two Cups: Logical Analysis and C++ Implementation

NiuNiu MaTe

Dec 10, 2021 · Big Data

Finding Common URLs in Billions of Records: From Naive Search to Hash Divide‑and‑Conquer

This article walks through a classic interview problem of locating common URLs in two massive files, explains why a naïve O(m·n) approach fails, and presents a scalable solution using hash‑based divide‑and‑conquer and file partitioning techniques.

Big Datadivide and conquerhash algorithm

0 likes · 6 min read

Finding Common URLs in Billions of Records: From Naive Search to Hash Divide‑and‑Conquer

JavaEdge

Oct 27, 2021 · Interview Experience

Detecting a Cycle in a Singly Linked List – Fast & Slow Pointer Solution for Tencent Interview

This article explains how to determine whether a singly linked list contains a cycle using three approaches—brute‑force, hash‑marking, and the optimal fast‑and‑slow pointer technique—providing Go and C++ implementations that achieve minimal time and O(1) space complexity suitable for a Tencent interview.

C++Goalgorithm

0 likes · 6 min read

Detecting a Cycle in a Singly Linked List – Fast & Slow Pointer Solution for Tencent Interview

NiuNiu MaTe

Oct 27, 2021 · Fundamentals

Master the House Robber Problem with Dynamic Programming

This article explains the classic House Robber interview question, detailing the problem constraints, illustrating why a naive alternating‑house approach fails, and presenting a clear dynamic‑programming solution with recurrence, base cases, and a concise code example.

DPalgorithmdynamic programming

0 likes · 5 min read

Master the House Robber Problem with Dynamic Programming

Selected Java Interview Questions

Jun 27, 2020 · Backend Development

Understanding Java Increment Operators and JVM Stack Frame Behavior

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.

JVMincrement operatorsinterview question

0 likes · 4 min read

Understanding Java Increment Operators and JVM Stack Frame Behavior

Programmer DD

Jan 9, 2019 · Fundamentals

How to Find the Peak in a Bitonic Array Using Binary Search

This article presents a JavaScript solution for locating the maximum element in a bitonic (first increasing then decreasing) array, explaining that the problem is a variant of binary search and providing a complete implementation using a binary‑search‑based algorithm.

Binary SearchJavaScriptalgorithm

0 likes · 3 min read

How to Find the Peak in a Bitonic Array Using Binary Search

MaGe Linux Operations

Aug 20, 2018 · Fundamentals

Why Does This Python Lambda Loop Print 6 Every Time? Mastering Late Binding

The article examines a Python interview question where a lambda list inside a loop unexpectedly prints 6 for all elements due to late binding in closures, explains the underlying mechanism, and presents four practical solutions—including default‑argument binding, functools.partial, generator expressions, and yield‑based approaches—to achieve the intended 0, 2, 4, 6 output.

Lambdaclosuresinterview question

0 likes · 5 min read

Why Does This Python Lambda Loop Print 6 Every Time? Mastering Late Binding

Architecture Digest

Aug 12, 2018 · Fundamentals

Understanding the “Hardest” Java Interview Question and Thread‑Safety Fundamentals

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.

interview questionjavasynchronized

0 likes · 14 min read

Understanding the “Hardest” Java Interview Question and Thread‑Safety Fundamentals

AI Cyberspace

Dec 7, 2017 · Fundamentals

Why Python’s Chain Assignment Can Trip You Up – Understanding Value vs Object Semantics

Python’s chain assignment offers concise multiple-variable assignment, but its left-to-right evaluation differs from C’s right-to-left value-semantic approach, leading to surprising results in interview questions; understanding the distinction between value-semantic and object-semantic languages helps avoid subtle bugs.

Pythonchain assignmentinterview question

0 likes · 5 min read

Why Python’s Chain Assignment Can Trip You Up – Understanding Value vs Object Semantics