diff --git a/CODE_OF_CONDUCT.md b/CODE_OF_CONDUCT.md
new file mode 100644
index 0000000..18c9147
--- /dev/null
+++ b/CODE_OF_CONDUCT.md
@@ -0,0 +1,128 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, religion, or sexual identity
+and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes,
+ and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the
+ overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+ advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+ address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+ professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official e-mail address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+.
+All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series
+of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or
+permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within
+the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 2.0, available at
+https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct
+enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at
+https://www.contributor-covenant.org/translations.
diff --git a/L-A/0006 Wild Card Matching ( L-A )/README.md b/L-A/0006 Wild Card Matching ( L-A )/README.md
index 9359c03..d788476 100644
--- a/L-A/0006 Wild Card Matching ( L-A )/README.md
+++ b/L-A/0006 Wild Card Matching ( L-A )/README.md
@@ -1,4 +1,4 @@
-# 0005 Trapping Rain Water ( L-A )
+# 0006 Wild Card Matching ( L-A )
## Problem
diff --git a/L-A/0007 The Skyline Problem/README.md b/L-A/0007 The Skyline Problem/README.md
index 989e16d..f86fbcb 100644
--- a/L-A/0007 The Skyline Problem/README.md
+++ b/L-A/0007 The Skyline Problem/README.md
@@ -1,4 +1,4 @@
-# 0005 Trapping Rain Water ( L-A )
+# 0007 The Skyline Problem ( L-A )
## Problem
diff --git a/L-A/0008 Longest Common Subsequence ( L-A )/README.md b/L-A/0008 Longest Common Subsequence ( L-A )/README.md
index 6f6eb46..5387f50 100644
--- a/L-A/0008 Longest Common Subsequence ( L-A )/README.md
+++ b/L-A/0008 Longest Common Subsequence ( L-A )/README.md
@@ -1,4 +1,4 @@
-# 0005 Longest Common Subsequence ( L-A )
+# 0008 Longest Common Subsequence ( L-A )
## Problem
diff --git a/L-A/0009 Word Search II ( L-A )/README.md b/L-A/0009 Word Search II ( L-A )/README.md
new file mode 100644
index 0000000..d6625c9
--- /dev/null
+++ b/L-A/0009 Word Search II ( L-A )/README.md
@@ -0,0 +1,78 @@
+# 0009 Word Search II ( L-A )
+
+## Problem
+
+Given two strings, find the length of their longest common subsequence (LCS). A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
+
+## Example 1
+
+```
+Input:
+str1 = "ABCDGH"
+str2 = "AEDFHR"
+
+Output:
+The longest common subsequence is "ADH" with a length of 3.
+
+Input:
+str1 = "AGGTAB"
+str2 = "GXTXAYB"
+
+Output:
+The longest common subsequence is "GTAB" with a length of 4.
+```
+
+## Solution Pseudocode
+
+```javascript
+function findWords(board, words):
+ result = []
+
+ function dfs(i, j, word, visited):
+ if i < 0 or j < 0 or i >= board.length or j >= board[0].length:
+ return
+ if visited[i][j]:
+ return
+ word += board[i][j]
+
+ if words includes word:
+ result.push(word)
+
+ visited[i][j] = true
+
+ dfs(i+1, j, word, visited)
+ dfs(i-1, j, word, visited)
+ dfs(i, j+1, word, visited)
+ dfs(i, j-1, word, visited)
+
+ visited[i][j] = false
+
+ visited = new Array(board.length).fill(false).map(() => new Array(board[0].length).fill(false))
+
+ for i from 0 to board.length-1:
+ for j from 0 to board[0].length-1:
+ dfs(i, j, "", visited)
+
+ return result
+```
+
+## How it works
+
+- We first define a `result` array to store the found words. Then, we define a `dfs` function that takes the current position on the board (`i` and `j`), the current word being built (`word`), and a `visited` array to keep track of visited positions.
+- The function checks if the current position is out of bounds or has already been visited. If either of these conditions are true, the function returns. Otherwise, the function adds the current character to the word, and checks if the word is in the list of target words. If it is, it adds the word to the `result` array.
+- The function then marks the current position as visited and performs a depth-first search on all adjacent positions. After the search is complete, the current position is marked as unvisited.
+- Lastly, we create a `visited` array with the same dimensions as the board, and iterate through each position on the board, calling the `dfs` function with the initial parameters. The function returns the `result` array containing all the found words.
+
+## References
+
+- [LeetCode](https://leetcode.com/problems/word-search-ii/)
+
+## Problem Added By
+
+- [Haris](https://github.com/harisdev-netizen)
+
+## Contributing
+
+Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
+
+Please make sure to update tests as appropriate.
diff --git a/L-A/0009 Word Search II ( L-A )/wordSearch.js b/L-A/0009 Word Search II ( L-A )/wordSearch.js
new file mode 100644
index 0000000..527e8d7
--- /dev/null
+++ b/L-A/0009 Word Search II ( L-A )/wordSearch.js
@@ -0,0 +1,38 @@
+function findWords(board, words) {
+ const result = []; // array to store found words
+
+ function dfs(i, j, word, visited) {
+ // depth-first search function
+ if (i < 0 || j < 0 || i >= board.length || j >= board[0].length) return; // check if position is out of bounds
+ if (visited[i][j]) return; // check if position has already been visited
+ word += board[i][j]; // add current character to current word
+
+ if (words.includes(word)) {
+ // check if current word is a target word
+ result.push(word); // add word to result array
+ }
+
+ visited[i][j] = true; // mark current position as visited
+
+ // search adjacent positions recursively
+ dfs(i + 1, j, word, visited);
+ dfs(i - 1, j, word, visited);
+ dfs(i, j + 1, word, visited);
+ dfs(i, j - 1, word, visited);
+
+ visited[i][j] = false; // mark current position as unvisited (backtrack)
+ }
+
+ const visited = new Array(board.length)
+ .fill(false)
+ .map(() => new Array(board[0].length).fill(false)); // initialize visited array
+
+ for (let i = 0; i < board.length; i++) {
+ // iterate over each position on the board
+ for (let j = 0; j < board[0].length; j++) {
+ dfs(i, j, "", visited); // perform depth-first search starting at current position
+ }
+ }
+
+ return result; // return array of found words
+}
diff --git a/L-A/0010 Design Cancellable Function (L-A)/Design Cancellable Function.js b/L-A/0010 Design Cancellable Function (L-A)/Design Cancellable Function.js
new file mode 100644
index 0000000..bfe1952
--- /dev/null
+++ b/L-A/0010 Design Cancellable Function (L-A)/Design Cancellable Function.js
@@ -0,0 +1,22 @@
+const cancellable = (generator) => {
+ let cancel;
+ const cancelPromise = new Promise((_, reject) => {
+ cancel = () => reject("Cancelled");
+ });
+ // Every Promise rejection has to be caught.
+ cancelPromise.catch(() => {});
+
+ const promise = (async () => {
+ let next = generator.next();
+ while (!next.done) {
+ try {
+ next = generator.next(await Promise.race([next.value, cancelPromise]));
+ } catch (e) {
+ next = generator.throw(e);
+ }
+ }
+ return next.value;
+ })();
+
+ return [cancel, promise];
+};
diff --git a/L-A/0010 Design Cancellable Function (L-A)/README.md b/L-A/0010 Design Cancellable Function (L-A)/README.md
new file mode 100644
index 0000000..5d88b31
--- /dev/null
+++ b/L-A/0010 Design Cancellable Function (L-A)/README.md
@@ -0,0 +1,74 @@
+# 2650. Design Cancellable Function
+[LeetCode](https://leetcode.com/problems/design-cancellable-function/)
+
+Sometimes you have a long running task, and you may wish to cancel it before it completes. To help with this goal, write a function `cancellable` that accepts a generator object and returns an array of two values: a cancel function and a promise.
+You may assume the generator function will only yield promises. It is your function's responsibility to pass the values resolved by the promise back to the generator. If the promise rejects, your function should throw that error back to the generator.
+If the cancel callback is called before the generator is done, your function should throw an error back to the generator. That error should be the string `"Cancelled"` (Not an `Error` object). If the error was caught, the returned promise should resolve with the next value that was yielded or returned. Otherwise, the promise should reject with the thrown error. No more code should be executed.
+
+When the generator is done, the promise your function returned should resolve the value the generator returned. If, however, the generator throws an error, the returned promise should reject with the error.
+
+An example of how your code would be used:
+```javascript
+function* tasks() {
+ const val = yield new Promise(resolve => resolve(2 + 2));
+ yield new Promise(resolve => setTimeout(resolve, 100));
+ return val + 1; // calculation shouldn't be done.
+}
+const [cancel, promise] = cancellable(tasks());
+setTimeout(cancel, 50);
+promise.catch(console.log); // logs "Cancelled" at t=50ms
+```
+If instead `cancel()` was not called or was called after `t=100ms`, the promise would have resolved 5.
+
+
+## Example 1:
+
+Input:
+```javascript
+generatorFunction = function*() {
+ return 42;
+}
+cancelledAt = 100
+```
+**Output:** `{"resolved": 42}`
+**Explanation:**
+```javascript
+const generator = generatorFunction();
+const [cancel, promise] = cancellable(generator);
+setTimeout(cancel, 100);
+promise.then(console.log); // resolves 42 at t=0ms
+```
+The generator immediately yields 42 and finishes. Because of that, the returned promise immediately resolves 42. Note that cancelling a finished generator does nothing.
+
+## Example 2:
+
+Input:
+```javascript
+generatorFunction = function*() {
+ const msg = yield new Promise(res => res("Hello"));
+ throw `Error: ${msg}`;
+}
+cancelledAt = null
+```
+**Output:** `{"rejected": "Error: Hello"}`
+**Explanation:**
+A promise is yielded. The function handles this by waiting for it to resolve and then passes the resolved value back to the generator. Then an error is thrown which has the effect of causing the promise to reject with the same thrown error.
+
+## Example 3:
+
+Input:
+```javascript
+generatorFunction = function*() {
+ yield new Promise(res => setTimeout(res, 200));
+ return "Success";
+}
+cancelledAt = 100
+```
+**Output:** `{"rejected": "Cancelled"}`
+**Explanation:**
+While the function is waiting for the yielded promise to resolve, cancel() is called. This causes an error message to be sent back to the generator. Since this error is uncaught, the returned promise rejected with this error.
+
+## Constraints:
+
+`cancelledAt == null or 0 <= cancelledAt <= 1000`
+`generatorFunction` returns a generator object
diff --git a/L-A/0011 The Fiscal Code/README.md b/L-A/0011 The Fiscal Code/README.md
new file mode 100644
index 0000000..3465b45
--- /dev/null
+++ b/L-A/0011 The Fiscal Code/README.md
@@ -0,0 +1,57 @@
+# The Fiscal Code
+**[Edabit Problem](https://edabit.com/challenge/Pa2rHJ6KeRBTF28Pg)**
+
+Each person in Italy has an unique identifying ID code issued by the national tax office after the birth registration: the Fiscal Code ([Codice Fiscale](https://en.wikipedia.org/wiki/Italian_fiscal_code_card)).
+
+Given an object containing the personal data of a person (name, surname, gender and date of birth) return the 11 code characters as a string following these steps:
+
+- Generate 3 capital letters from the surname, if it has:
+
+ - At least 3 consonants then the first three consonants are used. (Newman -> NWM).
+ - Less than 3 consonants then vowels will replace missing characters in the same order they appear (Fox -> FXO | Hope -> HPO).
+ - Less than three letters then "X" will take the third slot after the consonant and the vowel (Yu -> YUX).
+
+- Generate 3 capital letters from the name, if it has:
+
+ - Exactly 3 consonants then consonants are used in the order they appear (Matt -> MTT).
+ - More than 3 consonants then first, third and fourth consonant are used (Samantha -> SNT | Thomas -> TMS).
+ - Less than 3 consonants then vowels will replace missing characters in the same order they appear (Bob -> BBO | Paula -> PLA).
+ - Less than three letters then "X" will take the the third slot after the consonant and the vowel (Al -> LAX).
+
+- Generate 2 numbers, 1 letter and 2 numbers from date of birth and gender:
+
+ - Take the last two digits of the year of birth (1985 -> 85).
+ - Generate a letter corresponding to the month of birth (January -> A | December -> T) using the table for conversion included in the code.
+ - For males take the day of birth adding one zero at the start if is less than 10 (any 9th day -> 09 | any 20th day -> 20).
+ - For females take the day of birth and sum 40 to it (any 9th day -> 49 | any 20th day -> 60).
+
+### Examples:
+
+```javascipt
+fiscalCode({
+ name: "Matt",
+ surname: "Edabit",
+ gender: "M",
+ dob: "1/1/1900"
+}) ➞ "DBTMTT00A01"
+
+fiscalCode({
+ name: "Helen",
+ surname: "Yu",
+ gender: "F",
+ dob: "1/12/1950"
+}) ➞ "YUXHLN50T41"
+
+fiscalCode({
+ name: "Mickey",
+ surname: "Mouse",
+ gender: "M",
+ dob: "16/1/1928"
+}) ➞ "MSOMKY28A16"
+```
+
+**Notes:**
+- Code letters must be uppercase.
+- Date of birth is given in D/M/YYYY format.
+- The conversion table for months is already in the starting code.
+- Y is not a vowel.
diff --git a/L-A/0011 The Fiscal Code/TheFiscalCode.js b/L-A/0011 The Fiscal Code/TheFiscalCode.js
new file mode 100644
index 0000000..f1f8a2d
--- /dev/null
+++ b/L-A/0011 The Fiscal Code/TheFiscalCode.js
@@ -0,0 +1,79 @@
+function fiscalCode(data) {
+ const monthsConversion = {
+ '01': 'A', '02': 'B', '03': 'C', '04': 'D', '05': 'E', '06': 'H',
+ '07': 'L', '08': 'M', '09': 'P', '10': 'R', '11': 'S', '12': 'T'
+ };
+
+ // Helper function to generate code for names and surnames
+ function generateCode(name, isSurname) {
+ const vowels = 'AEIOU';
+ let consonants = '';
+ let code = '';
+
+ // Helper function to check if a character is a consonant
+ function isConsonant(char) {
+ return /[BCDFGHJKLMNPQRSTVWXYZ]/.test(char);
+ }
+
+ for (let i = 0; i < name.length && consonants.length < 3; i++) {
+ const char = name[i].toUpperCase();
+ if (isConsonant(char)) {
+ consonants += char;
+ }
+ }
+
+ if (consonants.length < 3) {
+ for (let i = 0; i < name.length && consonants.length < 3; i++) {
+ const char = name[i].toUpperCase();
+ if (vowels.includes(char)) {
+ consonants += char;
+ }
+ }
+ }
+
+ if (consonants.length < 3) {
+ consonants += 'X'.repeat(3 - consonants.length);
+ }
+
+ code = consonants;
+
+ if (isSurname) {
+ code += 'XXX';
+ } else {
+ code += name.length >= 3 ? name[0] + name[2] + name[3] : name + 'XX';
+ }
+
+ return code;
+ }
+
+ const surnameCode = generateCode(data.surname, true);
+ const nameCode = generateCode(data.name, false);
+
+ const year = data.dob.split('/')[2].slice(-2);
+ const month = monthsConversion[data.dob.split('/')[1]];
+ const day = (data.gender === 'F' ? 40 + parseInt(data.dob.split('/')[0]) : parseInt(data.dob.split('/')[0])).toString().padStart(2, '0');
+
+ return `${surnameCode}${nameCode}${year}${month}${day}`;
+}
+
+// Examples
+console.log(fiscalCode({
+ name: "Matt",
+ surname: "Edabit",
+ gender: "M",
+ dob: "1/1/1900"
+})); // ➞ "DBTMTT00A01"
+
+console.log(fiscalCode({
+ name: "Helen",
+ surname: "Yu",
+ gender: "F",
+ dob: "1/12/1950"
+})); // ➞ "YUXHLN50T41"
+
+console.log(fiscalCode({
+ name: "Mickey",
+ surname: "Mouse",
+ gender: "M",
+ dob: "16/1/1928"
+})); // ➞ "MSOMKY28A16"
diff --git a/L-A/0012 SVG Path Data Parser/README.md b/L-A/0012 SVG Path Data Parser/README.md
new file mode 100644
index 0000000..24c40f4
--- /dev/null
+++ b/L-A/0012 SVG Path Data Parser/README.md
@@ -0,0 +1,54 @@
+# SVG Path Data Parser
+[Edabit Problem](https://edabit.com/challenge/ysMrKPGby3FXiYtQn)
+
+A `` element can usually be found inside an `