diff --git a/solutions/1901-2000/1920-build-array-from-permutation/README.md b/solutions/1901-2000/1920-build-array-from-permutation/README.md
new file mode 100644
index 0000000..3654092
--- /dev/null
+++ b/solutions/1901-2000/1920-build-array-from-permutation/README.md
@@ -0,0 +1,11 @@
+# 1920. Build Array from Permutation
+
+[LeetCode problem 1920](https://leetcode.com/problems/build-array-from-permutation/)
+
+- **Difficulty**: Easy
+- **Tags**: array, simulation
+
+## Description
+
+Given a zero-indexed permutation `nums`, build an array `ans` where
+`ans[i] == nums[nums[i]]` for every `i`.
diff --git a/solutions/1901-2000/1920-build-array-from-permutation/solution.cpp b/solutions/1901-2000/1920-build-array-from-permutation/solution.cpp
new file mode 100644
index 0000000..ce052b4
--- /dev/null
+++ b/solutions/1901-2000/1920-build-array-from-permutation/solution.cpp
@@ -0,0 +1,18 @@
+#include "solution.hpp"
+
+#include <iterator>
+
+namespace leetcode::p1920 {
+
+std::vector<int> solve(const std::vector<int>& nums) {
+    std::vector<int> result;
+    result.reserve(nums.size());
+
+    for (int i = 0; i < std::ssize(nums); ++i) {
+        result.push_back(nums.at(static_cast<std::size_t>(nums.at(static_cast<std::size_t>(i)))));
+    }
+
+    return result;
+}
+
+} // namespace leetcode::p1920
diff --git a/solutions/1901-2000/1920-build-array-from-permutation/solution.hpp b/solutions/1901-2000/1920-build-array-from-permutation/solution.hpp
new file mode 100644
index 0000000..b00541c
--- /dev/null
+++ b/solutions/1901-2000/1920-build-array-from-permutation/solution.hpp
@@ -0,0 +1,10 @@
+#pragma once
+
+#include <vector>
+
+namespace leetcode::p1920 {
+
+// optimized: O(n) time, O(n) space — direct lookup, nums[nums[i]].
+std::vector<int> solve(const std::vector<int>& nums);
+
+} // namespace leetcode::p1920
diff --git a/solutions/1901-2000/1920-build-array-from-permutation/test.cpp b/solutions/1901-2000/1920-build-array-from-permutation/test.cpp
new file mode 100644
index 0000000..7939569
--- /dev/null
+++ b/solutions/1901-2000/1920-build-array-from-permutation/test.cpp
@@ -0,0 +1,8 @@
+#include <catch2/catch_test_macros.hpp>
+
+#include "solution.hpp"
+
+TEST_CASE("Problem 1920", "[p1920]") {
+    CHECK(leetcode::p1920::solve({0, 2, 1, 5, 3, 4}) == std::vector<int>{0, 1, 2, 4, 5, 3});
+    CHECK(leetcode::p1920::solve({5, 0, 1, 2, 3, 4}) == std::vector<int>{4, 5, 0, 1, 2, 3});
+}
diff --git a/swift/1930.swift b/swift/1930.swift
deleted file mode 100644
index a4d3c38..0000000
--- a/swift/1930.swift
+++ /dev/null
@@ -1,15 +0,0 @@
-func buildArray(_ nums: [Int]) -> [Int] {
-    var result: [Int] = []
-
-    for i in 0..<nums.count {
-        result.append(nums[nums[i]])
-    }
-
-    return result
-}
-
-let test1 = [0,2,1,5,3,4]
-let test2 = [5,0,1,2,3,4]
-
-print(buildArray(test1)) // [0,1,2,4,5,3]
-print(buildArray(test2)) // [4,5,0,1,2,3]
\ No newline at end of file