13. Disjoint Set (Union/Find)

-

A disjoint set is a data structure that stores and manipulates information…

Preparing the Swift Coding Interview — [Index] Algorithm and Data Structure

1. Big-O and 7-Steps of Thinking…

2. List-Based Collections

-

2. 1. Array

11. String

-

11. 1. Palindrome

3. Trees 1

Express hierarchical structure.

3. 1. Heap

• It should be a complete binary tree.

1.1 Big-O

It is a method to analyze the resource usage of the algorithm. The resources indicate running time, memory, storage, networking, etc., but…

Mathematics 1

-

4. 1. Permutation

7. 1. Backtracking

An algorithm that takes into account the number of all cases. This is the appropriate way to represent the state space as a…

6. Sorting

O(N²): Bubble Sort, Selection Sort, Insertion Sort
O(NlogN): Quick Sort, Merge Sort, Heap Sort