---
title: "Kim MinbapE (@minbape) | Hashnode"
description: "University Student, ex) PHP Web Developer. Read the latest articles by Kim MinbapE on Hashnode."
url: "https://hashnode.com/@minbape"
---

@minbape

# Kim MinbapE

@minbape · Seoul, South Korea · Joined December 2024

University Student, ex) PHP Web Developer

### [VM, Storage, Network, Container, Serverless](https://piggyfarm.hashnode.dev/vm-storage-network-container-serverless?utm_source=hashnode&utm_medium=feed)

📌 1. VM (Virtual Machine) Concept A virtual computer created using virtualization technology on top of a physical server. How It Works Install a hypervisor on the physical server to split CPU, memory, and disk resources Each VM has its own operat...

3 min read · [piggyfarm.hashnode.dev](https://piggyfarm.hashnode.dev/vm-storage-network-container-serverless?utm_source=hashnode&utm_medium=feed)

[Aug 1, 2025](https://hashnode.com/posts/vm-storage-network-container-serverless/688cf30f4a1646a25d012c27)

### [What is an inline function?](https://piggyfarm.hashnode.dev/what-is-an-inline-function?utm_source=hashnode&utm_medium=feed)

In C++, the inline keyword serves two main purposes: One Definition Rule (ODR) Exception Compiler Optimization Hint Let’s unpack what that means, see some examples, and discuss best practices. 1. Why inline Exists 1.1 One Definition Rule Excepti...

3 min read · [piggyfarm.hashnode.dev](https://piggyfarm.hashnode.dev/what-is-an-inline-function?utm_source=hashnode&utm_medium=feed)

[Jul 31, 2025](https://hashnode.com/posts/what-is-an-inline-function/688bb13f59bb1bfb7c989699)

### [Algorithm Time Complexity Overview](https://piggyfarm.hashnode.dev/algorithm-time-complexity-overview?utm_source=hashnode&utm_medium=feed)

Note: The following complexities represent typical cases for commonly used algorithms and data structures.Actual performance may vary depending on input size, data distribution, and problem constraints. 1. Sorting Algorithms AlgorithmAverage Tim...

2 min read · [piggyfarm.hashnode.dev](https://piggyfarm.hashnode.dev/algorithm-time-complexity-overview?utm_source=hashnode&utm_medium=feed)

[Jul 31, 2025](https://hashnode.com/posts/algorithm-time-complexity-overview/688b14326ee9f167bd1f2cb7)

### [Prefix Sum](https://piggyfarm.hashnode.dev/64ie7kcb7zwpioqzhoycsa?utm_source=hashnode&utm_medium=feed)

A problem that processes a specific range in an N × M array may produce the correct answer using a simple for loop, but it can fail the efficiency test due to time limit issues. Drawbacks of Using a Naive For Loop Time complexity can increase up to ...

2 min read · [piggyfarm.hashnode.dev](https://piggyfarm.hashnode.dev/64ie7kcb7zwpioqzhoycsa?utm_source=hashnode&utm_medium=feed)

[Jan 16, 2025](https://hashnode.com/posts/64ie7kcb7zwpioqzhoycsa/67890e7fb8fdf84a161fc23f)

### [I/O Multiplexing (select, poll, epoll, IOCP, kqueue)](https://piggyfarm.hashnode.dev/io-multiplexing-select-poll-epoll-iocp-kqueue?utm_source=hashnode&utm_medium=feed)

What is I/O Multiplexing? I/O Multiplexing은 한 프로세스가 동시에 여러 파일 디스크립터를 관리하는 기법이다. 프로그램은 파일 디스크립터를 모니터링하여 어떤 종류의 I/O 이벤트(읽기, 쓰기, 예외 등)가 발생했는지 확인하고, 각각의 파일 디스크립터가 Ready 상태가 되었는지 판단한다. 이 기법은 Network socket과 같은 비동기적 I/O 작업에 특히 유용하며, socket도 IP와 Port로 구성된 파...

2 min read · [piggyfarm.hashnode.dev](https://piggyfarm.hashnode.dev/io-multiplexing-select-poll-epoll-iocp-kqueue?utm_source=hashnode&utm_medium=feed)

[Jan 16, 2025](https://hashnode.com/posts/io-multiplexing-select-poll-epoll-iocp-kqueue/67890d9c5dfc1f7d3c00b5d0)
