feat(playground): add offer 03, 05

Author: man-fish

.prettierrc

@@ -0,0 +1,5 @@
+{
+    "tabWidth": 4,
+    "useTabs": false,
+    "singleQuote": true
+}

src/data-structures/queue/README.md

@@ -1,11 +1,5 @@
 # Queue
 
-_Read this in other languages:_
-[_简体中文_](README.zh-CN.md),
-[_Русский_](README.ru-RU.md),
-[_日本語_](README.ja-JP.md),
-[_Português_](README.pt-BR.md)
-
 In computer science, a **queue** is a particular kind of abstract data 
 type or collection in which the entities in the collection are 
 kept in order and the principle (or only) operations on the 

src/data-structures/stack/README.md

@@ -1,11 +1,5 @@
 # Stack
 
-_Read this in other languages:_
-[_简体中文_](README.zh-CN.md),
-[_Русский_](README.ru-RU.md),
-[_日本語_](README.ja-JP.md),
-[_Português_](README.pt-BR.md)
-
 In computer science, a **stack** is an abstract data type that serves 
 as a collection of elements, with two principal operations:
 

src/playground/offer/03/findRepeatNumber.ts

@@ -0,0 +1,10 @@
+export default function findRepeatNumber(nums: number[]): number {
+    const s = new Set();
+    for (let num of nums) {
+        if (s.has(num)) {
+            return num
+        }
+        s.add(num)
+    }
+    return -1
+};

src/playground/offer/05/replaceSpace.ts

@@ -0,0 +1,4 @@
+export default function replaceSpace(s: string): string {
+    return s.split(" ").join("%20")
+};
+