May 06

Author: siddydutta

2025-05-May-LeetCoding-Challenge/Build Array from Permutation.py

@@ -0,0 +1,15 @@
+class Solution:
+    def buildArray(self, nums: list[int]) -> list[int]:
+        return [nums[nums[i]] for i in range(len(nums))]
+
+
+def main():
+    nums = [0, 2, 1, 5, 3, 4]
+    assert Solution().buildArray(nums) == [0, 1, 2, 4, 5, 3]
+
+    nums = [5, 0, 1, 2, 3, 4]
+    assert Solution().buildArray(nums) == [4, 5, 0, 1, 2, 3]
+
+
+if __name__ == '__main__':
+    main()

2025-05-May-LeetCoding-Challenge/README.md

@@ -9,7 +9,7 @@
 | May 03 | [1007. Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | Medium | Solved |
 | May 04 | [1128. Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/) | Easy | Solved |
 | May 05 | [790. Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/) | Medium | Solved |
-| May 06 | []() |  |  |
+| May 06 | [1920. Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/) | Easy | Solved |
 | May 07 | []() |  |  |
 | May 08 | []() |  |  |
 | May 09 | []() |  |  |
@@ -40,6 +40,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 1 | 1 | 0 |
+| Easy   | 2 | 2 | 0 |
 | Medium | 3 | 3 | 0 |
 | Hard   | 1 | 1 | 0 |