add new solutions

solutions/21/q2154/solution.go

@@ -0,0 +1,16 @@
+package q2154
+
+import "slices"
+
+func findFinalValue(nums []int, original int) int {
+	slices.Sort(nums)
+
+	for i := range nums {
+		if nums[i] == original {
+			original *= 2
+		}
+	}
+	return original
+}
+
+var _ = findFinalValue

solutions/21/q2169/solution.go

@@ -0,0 +1,15 @@
+package q2169
+
+func countOperations(num1 int, num2 int) int {
+	cnt := 0
+	num1, num2 = max(num1, num2), min(num1, num2)
+
+	for num2 > 0 {
+		t := num1 % num2
+		cnt += num1 / num2
+		num1, num2 = num2, t
+	}
+	return cnt
+}
+
+var _ = countOperations