Nov 12, 2025 · 2 min read · Since InsertArtUseCase and DeleteArtUseCase are pure domain logic, they’re easy to test — no Android dependencies, just Kotlin coroutines and a fake repository. Let’s write clear, minimal, and clean unit tests using JUnit + Kotlin coroutines test. We...
Join discussionFeb 22, 2025 · 2 min read · 이번 편은 이전 편으로부터 이어집니다. 삽입과 삭제를 수행할 때는 일정 구간을 밀어내거나 당겨오게 됩니다. 이러한 연산을 일반적으로 시프트라 부릅니다. 왼쪽 시프트 function shl(mem: any[], l: number, r: number): void { for(let i = l; i <= r; i++) { mem[i - 1] = mem[i]; } } 왼쪽 시프트는 지정된 메모리 mem 중 l과 r로 지정된 범위를 왼쪽으로 한...
Join discussion
Sep 25, 2024 · 9 min read · In this chapter, we dive into one of the most versatile and efficient data structures used in various string manipulation problems – the Trie. We'll cover the basics of what a Trie is, how it works, and walk through its common applications like inser...
Join discussionAug 24, 2024 · 10 min read · What is a Binary tree? A binary tree is tree data structure in which each node can have at most two child nodes referred to as the left and right child. The two types of binary trees on which we are going to focus today are full and complete binary ...
Join discussion
Aug 11, 2024 · 6 min read · Introduction to Linked Lists Linked lists are a fundamental data structure in computer science, allowing for efficient insertion and deletion of elements. Unlike arrays, linked lists do not require a contiguous block of memory, making them more flexi...
Join discussion
Jul 27, 2024 · 3 min read · Construction of Linked List Input: n = 5 arr = [1,2,3,4,5] Output: 1 2 3 4 5 Explanation: Linked list for the given array will be 1->2->3->4->5 Here, the head points to a dummy which doesn't store anything. Later, when we return the new head pointer...
Join discussion
Aug 27, 2023 · 1 min read · Arrays are fixed-size data structures that can contain only homogeneous elements. Inserting an element in an array is one of the basic operations done in an array.To insert an element at the end of an array is easy we can directly insert the element ...
Join discussion
