From 5be765f30bf3509bc94d1d86f3d68e5109042fe2 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Mon, 5 Aug 2024 21:32:32 -0400
Subject: [PATCH] Create README - LeetHub
---
0984-string-without-aaa-or-bbb/README.md | 31 ++++++++++++++++++++++++
1 file changed, 31 insertions(+)
create mode 100644 0984-string-without-aaa-or-bbb/README.md
diff --git a/0984-string-without-aaa-or-bbb/README.md b/0984-string-without-aaa-or-bbb/README.md
new file mode 100644
index 0000000..95128bd
--- /dev/null
+++ b/0984-string-without-aaa-or-bbb/README.md
@@ -0,0 +1,31 @@
+Medium
Given two integers a and b, return any string s such that:
+
+
+ s has length a + b and contains exactly a 'a' letters, and exactly b 'b' letters,- The substring
'aaa' does not occur in s, and
+ - The substring
'bbb' does not occur in s.
+
+
+
+Example 1:
+
+
+Input: a = 1, b = 2
+Output: "abb"
+Explanation: "abb", "bab" and "bba" are all correct answers.
+
+
+Example 2:
+
+
+Input: a = 4, b = 1
+Output: "aabaa"
+
+
+
+Constraints:
+
+
+ 0 <= a, b <= 100- It is guaranteed such an
s exists for the given a and b.
+