restructure directories and add dsa-based games section

serverx-org · Oct 17, 2024 · 66ecd34 · 66ecd34
1 parent 589b7d4
commit 66ecd34
Show file tree

Hide file tree

Showing 63 changed files with 129 additions and 139 deletions.
diff --git a/DSA-Roadmap/dsa-roadmap.pdf → 00-dsa-roadmap/dsa-roadmap.pdf b/DSA-Roadmap/dsa-roadmap.pdf → 00-dsa-roadmap/dsa-roadmap.pdf
diff --git a/DSA-Roadmap/dsa-roadmap.png → 00-dsa-roadmap/dsa-roadmap.png b/DSA-Roadmap/dsa-roadmap.png → 00-dsa-roadmap/dsa-roadmap.png
diff --git a/... - Data_Structures/Kadane's_Algorithm.cpp → ...tures/00-algorithms/Kadanes_Algorithm.cpp b/... - Data_Structures/Kadane's_Algorithm.cpp → ...tures/00-algorithms/Kadanes_Algorithm.cpp
diff --git a/C++/02 - Data_Structures/Sieve_Algorithm.cpp → ...uctures/00-algorithms/Sieve_Algorithm.cpp b/C++/02 - Data_Structures/Sieve_Algorithm.cpp → ...uctures/00-algorithms/Sieve_Algorithm.cpp
diff --git a/.../Beginner/Dutch_National_Flag_Problem.cpp → .../Beginner/Dutch_National_Flag_Problem.cpp b/.../Beginner/Dutch_National_Flag_Problem.cpp → .../Beginner/Dutch_National_Flag_Problem.cpp
diff --git a/.../01 - Arrays/Beginner/Largest_element.cpp → ...es/01-arrays/Beginner/Largest_element.cpp b/.../01 - Arrays/Beginner/Largest_element.cpp → ...es/01-arrays/Beginner/Largest_element.cpp
diff --git a/...01 - Arrays/Beginner/Leaders_in_Array.cpp → ...s/01-arrays/Beginner/Leaders_in_Array.cpp b/...01 - Arrays/Beginner/Leaders_in_Array.cpp → ...s/01-arrays/Beginner/Leaders_in_Array.cpp
diff --git a/...ures/01 - Arrays/Beginner/Left_rotate.cpp → ...ctures/01-arrays/Beginner/Left_rotate.cpp b/...ures/01 - Arrays/Beginner/Left_rotate.cpp → ...ctures/01-arrays/Beginner/Left_rotate.cpp
diff --git a/.../Beginner/Longest_subarray_with_sum_K.cpp → .../Beginner/Longest_subarray_with_sum_K.cpp b/.../Beginner/Longest_subarray_with_sum_K.cpp → .../Beginner/Longest_subarray_with_sum_K.cpp
diff --git a/...1 - Arrays/Beginner/Remove_duplicates.cpp → .../01-arrays/Beginner/Remove_duplicates.cpp b/...1 - Arrays/Beginner/Remove_duplicates.cpp → .../01-arrays/Beginner/Remove_duplicates.cpp
diff --git a/...rays/Beginner/Reverse_Array_In_Groups.cpp → ...rays/Beginner/Reverse_Array_In_Groups.cpp b/...rays/Beginner/Reverse_Array_In_Groups.cpp → ...rays/Beginner/Reverse_Array_In_Groups.cpp
diff --git a/...Arrays/Beginner/Second_LargestElement.cpp → ...arrays/Beginner/Second_LargestElement.cpp b/...Arrays/Beginner/Second_LargestElement.cpp → ...arrays/Beginner/Second_LargestElement.cpp
diff --git a/...ctures/01 - Arrays/Beginner/quicksort.cpp → ...ructures/01-arrays/Beginner/quicksort.cpp b/...ctures/01 - Arrays/Beginner/quicksort.cpp → ...ructures/01-arrays/Beginner/quicksort.cpp
diff --git a/... - Arrays/Hard/Sliding_Window_Maximum.cpp → ...01-arrays/Hard/Sliding_Window_Maximum.cpp b/... - Arrays/Hard/Sliding_Window_Maximum.cpp → ...01-arrays/Hard/Sliding_Window_Maximum.cpp
diff --git a/...uctures/01 - Arrays/Hard/Valid_Number.cpp → ...tructures/01-arrays/Hard/Valid_Number.cpp b/...uctures/01 - Arrays/Hard/Valid_Number.cpp → ...tructures/01-arrays/Hard/Valid_Number.cpp
diff --git a/...rrays/Intermediate/Kadane's_Algorithm.cpp → ...rrays/Intermediate/Kadane's_Algorithm.cpp b/...rrays/Intermediate/Kadane's_Algorithm.cpp → ...rrays/Intermediate/Kadane's_Algorithm.cpp
diff --git a/... Arrays/Intermediate/Majority_Element.cpp → ...-arrays/Intermediate/Majority_Element.cpp b/... Arrays/Intermediate/Majority_Element.cpp → ...-arrays/Intermediate/Majority_Element.cpp
diff --git a/...rays/Intermediate/Majority_Element_II.cpp → ...rays/Intermediate/Majority_Element_II.cpp b/...rays/Intermediate/Majority_Element_II.cpp → ...rays/Intermediate/Majority_Element_II.cpp
diff --git a/...s/01 - Arrays/Intermediate/Merge_Sort.cpp → ...res/01-arrays/Intermediate/Merge_Sort.cpp b/...s/01 - Arrays/Intermediate/Merge_Sort.cpp → ...res/01-arrays/Intermediate/Merge_Sort.cpp
diff --git a/... Arrays/Intermediate/Next_Permutation.cpp → ...-arrays/Intermediate/Next_Permutation.cpp b/... Arrays/Intermediate/Next_Permutation.cpp → ...-arrays/Intermediate/Next_Permutation.cpp
diff --git a/...01 - Arrays/Intermediate/Peak_element.cpp → ...s/01-arrays/Intermediate/Peak_element.cpp b/...01 - Arrays/Intermediate/Peak_element.cpp → ...s/01-arrays/Intermediate/Peak_element.cpp
diff --git a/...s/01 - Arrays/Intermediate/Quick_Sort.cpp → ...res/01-arrays/Intermediate/Quick_Sort.cpp b/...s/01 - Arrays/Intermediate/Quick_Sort.cpp → ...res/01-arrays/Intermediate/Quick_Sort.cpp
diff --git a/...Arrays/Intermediate/Set_Matrix_Zeroes.cpp → ...arrays/Intermediate/Set_Matrix_Zeroes.cpp b/...Arrays/Intermediate/Set_Matrix_Zeroes.cpp → ...arrays/Intermediate/Set_Matrix_Zeroes.cpp
diff --git a/...diate/longest_Consecutive_Subsequence.cpp → ...diate/longest_Consecutive_Subsequence.cpp b/...diate/longest_Consecutive_Subsequence.cpp → ...diate/longest_Consecutive_Subsequence.cpp
diff --git a/...s/02 - Sorting Algorithms/bubble-Sort.cpp → ...res/02-sorting-algorithms/bubble_sort.cpp b/...s/02 - Sorting Algorithms/bubble-Sort.cpp → ...res/02-sorting-algorithms/bubble_sort.cpp
diff --git a/...2 - Sorting Algorithms/insertion-Sort.cpp → .../02-sorting-algorithms/insertion_sort.cpp b/...2 - Sorting Algorithms/insertion-Sort.cpp → .../02-sorting-algorithms/insertion_sort.cpp
diff --git a/...es/02 - Sorting Algorithms/merge-sort.cpp → ...ures/02-sorting-algorithms/merge_sort.cpp b/...es/02 - Sorting Algorithms/merge-sort.cpp → ...ures/02-sorting-algorithms/merge_sort.cpp
diff --git a/...es/02 - Sorting Algorithms/quick-sort.cpp → ...ures/02-sorting-algorithms/quick_sort.cpp b/...es/02 - Sorting Algorithms/quick-sort.cpp → ...ures/02-sorting-algorithms/quick_sort.cpp
diff --git a/...2 - Sorting Algorithms/selection-Sort.cpp → .../02-sorting-algorithms/selection_Sort.cpp b/...2 - Sorting Algorithms/selection-Sort.cpp → .../02-sorting-algorithms/selection_Sort.cpp
diff --git a/...ures/02 - Sorting Algorithms/tim-sort.cpp → ...ctures/02-sorting-algorithms/tim_sort.cpp b/...ures/02 - Sorting Algorithms/tim-sort.cpp → ...ctures/02-sorting-algorithms/tim_sort.cpp
diff --git a/... - Searching Algorithms/Binary-search.cpp → ...03-searching-algorithms/binary_search.cpp b/... - Searching Algorithms/Binary-search.cpp → ...03-searching-algorithms/binary_search.cpp
diff --git a/... - Searching Algorithms/Linear-search.cpp → ...03-searching-algorithms/linear_search.cpp b/... - Searching Algorithms/Linear-search.cpp → ...03-searching-algorithms/linear_search.cpp
diff --git a/C++/Data_Structures/Sorting Algorithms/Quick-Sort.c++ b/C++/Data_Structures/Sorting Algorithms/Quick-Sort.c++
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
@@ -3,49 +3,55 @@
 Thank you for considering contributing to this repository! Here are some ways you can contribute:
 
 ## 1. Documentation Improvement
-   - Enhance the README file by correcting grammar and syntax errors.
-   - Improve the structure and layout of the content.
-   - Write the same structure present in the README file in Java, JavaScript, Python, or any other language.
+
+- Enhance the README file by correcting grammar and syntax errors.
+- Improve the structure and layout of the content.
+- Write the same structure present in the README file in Java, JavaScript, Python, or any other language.
 
 ## 2. Share Resources
-   - Link resources to cover missed topics in the README content.
-   - Provide additional resources with content.
-   - Add more useful content.
+
+- Link resources to cover missed topics in the README content.
+- Provide additional resources with content.
+- Add more useful content.
 
 ## 3. Code Contribution
-   - Add files implementing data structures (insertion, deletion, searching).
-   - Include conceptual implementation codes in C, C++, Java, Python, or any other language of your choice.
-   - Respective Algorithms implementation 
+
+- Add files implementing data structures (insertion, deletion, searching).
+- Include conceptual implementation codes in C, C++, Java, Python, or any other language of your choice.
+- Respective Algorithms implementation
 
 **Important**: Make any of the above changes in an organized and proper structure.
 
 **Note**: You can add your own content if you wish.
 
+## Code Contribution Folder Structure
 
-# Code Contribution Folder Structure
+### For Data Structures Code Folders
 
-## For Data Structures Code Folders
 Example:
-  * JavaScript-DSA `(folder)`
-    * 01-Introduction `(folder)`
-    * 02-Data-Structures `(folder)`
-      * Linked-List `(folder)`
-        * Operations `(folder)`
-          * Singly-Linked-List `(folder)`
-            - insertion.js or insertion.md `(file)`
-            - deletion.js or deletion.md `(file)`
-          * Doubly-Linked-List
-            - insertion.js or insertion.md `(file)`
-            - deletion.js or deletion.md `(file)`
-
-## For Algorithms Code Folders
+
+- JavaScript-DSA `(folder)`
+  - 01-Introduction `(folder)`
+  - 02-Data-Structures `(folder)`
+    - Linked-List `(folder)`
+      - Operations `(folder)`
+        - Singly-Linked-List `(folder)`
+          - insertion.js or insertion.md `(file)`
+          - deletion.js or deletion.md `(file)`
+        - Doubly-Linked-List
+          - insertion.js or insertion.md `(file)`
+          - deletion.js or deletion.md `(file)`
+
+### For Algorithms Code Folders
+
 Example:
-  * 03-Algorithms
-    * Greedy Method `(folder)`
-      * Fractional-Knapsack-Problem.cpp `(file)` 
-    * Recursion `(folder)`
-    * Divide and Conquer `(folder)`
+
+- 03-Algorithms
+  - Greedy Method `(folder)`
+    - Fractional-Knapsack-Problem.cpp `(file)`
+  - Recursion `(folder)`
+  - Divide and Conquer `(folder)`
 
 Thanks! :heart: :heart: :heart:
 
-SERVER-X Team
+SERVERX Team
diff --git a/JavaScript/02 - Data-Structures/01 - Array/03 - Resources.md b/JavaScript/02 - Data-Structures/01 - Array/03 - Resources.md
diff --git a/...tructures/01 - Array/01 - Introduction.md → ...a-Structures/01-arrays/00-Introduction.md b/...tructures/01 - Array/01 - Introduction.md → ...a-Structures/01-arrays/00-Introduction.md
@@ -1,57 +1,68 @@
 # Introduction to Arrays in JavaScript
+
 An array in JavaScript or in General is a versatile and fundamental data structure that allows the storage of multiple values within a single variable. It provides a way to organize and access elements through a numerical index or key. Arrays in JavaScript can hold a mix of data types, including numbers, strings, objects, or even other arrays.
 
 ## Table of Index
 
-| Index | Topic                 |
-|-------|-----------------------|
-| 1     | Introduction           |
-| 2     | Operations related to Arrays in Javascript         |
+| Index | Topic                                               |
+| ----- | --------------------------------------------------- |
+| 1     | Introduction                                        |
+| 2     | Operations related to Arrays in Javascript          |
 | 3     | Resources to learn and Practice Arrays in Javascipt |
 
 ## Basic Operations of Arrays in JavaScript
 
 Arrays in JavaScript support a variety of operations that allow for efficient manipulation and retrieval of elements. Here are some basic operations:
 
 ### 1. **Declaration and Initialization:**
-   - Create an array and initialize it with elements.
+
+- Create an array and initialize it with elements.
 
 ## 2. **Accessing Elements:**
-   - Access elements by their index.
-   - Negative indexing to access elements from the end.
+
+- Access elements by their index.
+- Negative indexing to access elements from the end.
 
 ### 3. **Updating Elements:**
-   - Modify the value of an element at a specific index.
+
+- Modify the value of an element at a specific index.
 
 ### 4. **Adding Elements:**
-   - **Push:** Add an element to the end of the array.
-   - **Unshift:** Add an element to the beginning of the array.
-   - **Splice:** Add elements at a specific index.
+
+- **Push:** Add an element to the end of the array.
+- **Unshift:** Add an element to the beginning of the array.
+- **Splice:** Add elements at a specific index.
 
 ### 5. **Removing Elements:**
-   - **Pop:** Remove the last element of the array.
-   - **Shift:** Remove the first element of the array.
-   - **Splice:** Remove elements from a specific index.
+
+- **Pop:** Remove the last element of the array.
+- **Shift:** Remove the first element of the array.
+- **Splice:** Remove elements from a specific index.
 
 ### 6. **Concatenation:**
-   - Combine two or more arrays to create a new array.
+
+- Combine two or more arrays to create a new array.
 
 ### 7. **Slicing:**
-   - Extract a portion of the array to create a new array.
+
+- Extract a portion of the array to create a new array.
 
 ### 8. **Searching:**
-   - **IndexOf:** Find the index of a specific element.
-   - **Includes:** Check if an array contains a specific element.
+
+- **IndexOf:** Find the index of a specific element.
+- **Includes:** Check if an array contains a specific element.
 
 ### 9. **Sorting:**
-   - **Sort:** Arrange the elements in ascending or descending order.
+
+- **Sort:** Arrange the elements in ascending or descending order.
 
 ### 10. **Iterating:**
-   - Use loops or higher-order functions like forEach, map, filter, and reduce to iterate through elements.
+
+- Use loops or higher-order functions like forEach, map, filter, and reduce to iterate through elements.
 
 ### 11. **Length:**
-- Access the `length` property to determine the number of elements in the array.
 
+- Access the `length` property to determine the number of elements in the array.
 
 ## Conclution
 

diff --git a/...-Structures/01 - Array/02 - Operations.md → ...ata-Structures/01-arrays/01-Operations.md b/...-Structures/01 - Array/02 - Operations.md → ...ata-Structures/01-arrays/01-Operations.md
@@ -1,67 +1,95 @@
 # Basic Operations of Arrays in JavaScript
 
 ## 1. **Declaration and Initialization:**
-   - Create an array and initialize it with elements.
 
-   ```javascript
+- Create an array and initialize it with elements.
+
+```javascript
    let fruits = ['apple', 'orange', 'banana'];
 ```
-## 2. Accessing Elements:
+
+## 2. Accessing Elements
+
 - Access elements by their index.
 - Negative indexing to access elements from the end.
+
 ```javascript
 let firstFruit = fruits[0];       // Access the first element
 let lastFruit = fruits[fruits.length - 1];  // Access the last element using negative indexing
 ```
-## 3. Updating Elements:
+
+## 3. Updating Elements
+
 - Modify the value of an element at a specific index.
+
 ```javascript
 fruits[1] = 'grape';  // Update the second element
 ```
-# 4. Adding Elements:
+
+# 4. Adding Elements
+
 - Push: Add an element to the end of the array.
 - Unshift: Add an element to the beginning of the array.
 - Splice: Add elements at a specific index.
+
 ``` javascript
 fruits.push('kiwi');            // Add 'kiwi' to the end
 fruits.unshift('pineapple');     // Add 'pineapple' to the beginning
 fruits.splice(2, 0, 'lemon');    // Add 'lemon' at index 2
 ```
-## 5. Removing Elements:
+
+## 5. Removing Elements
+
 - Pop: Remove the last element of the array.
 - Shift: Remove the first element of the array.
 - Splice: Remove elements from a specific index.
+
 ```javascript
 let removedLast = fruits.pop();         // Remove and return the last element
 let removedFirst = fruits.shift();      // Remove and return the first element
 let removedAtIndex = fruits.splice(1, 2); // Remove 2 elements starting from index 1
 ```
-## 6. Concatenation:
+
+## 6. Concatenation
+
 - Combine two or more arrays to create a new array.
+
 ```javascript
 let moreFruits = ['mango', 'pear'];
 let combinedArray = fruits.concat(moreFruits);
 ```
-## 7. Slicing:
+
+## 7. Slicing
+
 - Extract a portion of the array to create a new array.
+
 ```javascript
 let slicedArray = fruits.slice(1, 3);  // Extract elements from index 1 to 2
 ```
-## 8. Searching:
+
+## 8. Searching
+
 - IndexOf: Find the index of a specific element.
 - Includes: Check if an array contains a specific element.
+
 ```javascript
 let indexOfBanana = fruits.indexOf('banana');  // Returns the index of 'banana'
 let includesMango = fruits.includes('mango');  // Returns true if 'mango' is present
 ```
-## 9. Sorting:
+
+## 9. Sorting
+
 - Sort: Arrange the elements in ascending or descending order.
+
 ```javascript
 fruits.sort();      // Sort elements in ascending order
 fruits.reverse();   // Reverse the order of elements
 ```
-## 10. Iterating:
+
+## 10. Iterating
+
 - Use loops or higher-order functions like `forEach`, `map`, `filter`, and `reduce` to iterate through elements.
+
 ```javascript
 // Using forEach
 fruits.forEach(fruit => {
@@ -71,10 +99,15 @@ fruits.forEach(fruit => {
 // Using map
 let upperCaseFruits = fruits.map(fruit => fruit.toUpperCase());
 ```
-## 11. Length:
+
+## 11. Length
+
 - Access the `length` property to determine the number of elements in the array.
+
 ```javascript
 let arrayLength = fruits.length;  // Returns the number of elements in the array
 ```
+
 # Conclution
-These concepts provide a foundational understanding of array operations in JavaScript. Feel free to use and modify these examples for your projects.
+
+These concepts provide a foundational understanding of array operations in JavaScript. Feel free to use and modify these examples for your projects.
diff --git a/JavaScript/Data-Structures/01-arrays/02-Resources.md b/JavaScript/Data-Structures/01-arrays/02-Resources.md
@@ -0,0 +1,15 @@
+# Resources to Learn Arrays in JavaScript
+
+| Type         | Title                                                           | Author/Instructor     | Link                                                                                              |
+| ------------ | --------------------------------------------------------------- | --------------------- | ------------------------------------------------------------------------------------------------- |
+| **Books**    | "JavaScript: The Good Parts"                                    | Douglas Crockford     | [Amazon](https://www.amazon.com/JavaScript-Good-Parts-Douglas-Crockford/dp/0596517742)            |
+|              | "Eloquent JavaScript"                                           | Marijn Haverbeke      | [Eloquent JavaScript](https://eloquentjavascript.net/)                                            |
+|              | "You Don't Know JS - Scope & Closures"                          | Kyle Simpson          | [GitHub](https://github.com/getify/You-Dont-Know-JS/blob/2nd-ed/scope-closures/README.md)         |
+| **Websites** | Mozilla Developer Network (MDN)                                 | Mozilla               | [MDN Web Docs](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Indexed_collections) |
+|              | W3Schools                                                       | W3Schools             | [W3Schools JavaScript Arrays](https://www.w3schools.com/js/js_arrays.asp)                         |
+|              | GeeksforGeeks                                                   | GeeksforGeeks         | [GeeksforGeeks JavaScript Arrays](https://www.geeksforgeeks.org/javascript-array/)                |
+| **YouTube**  | "JavaScript Arrays - Beau teaches JavaScript"                   | Traversy Media        | [YouTube Playlist](https://www.youtube.com/playlist?list=PLillGF-RfqbaEmlPcX5e_ejaK7Y5MydkW)      |
+|              | "JavaScript Tutorial for Beginners: Learn JavaScript in 1 Hour" | Programming with Mosh | [YouTube](https://www.youtube.com/watch?v=W6NZfCO5SIk)                                            |
+|              | "JavaScript Arrays Explained"                                   | Programming with Mosh | [YouTube](https://www.youtube.com/watch?v=oigfaZ5ApsM)                                            |
+
+These resources cover a variety of formats, including books, websites, and YouTube playlists, offering different learning experiences. Choose the ones that best fit your learning preferences and level of expertise.
diff --git a/...res/02 - Linked-List/01 - Introduction.md → ...uctures/02-linked-list/00-Introduction.md b/...res/02 - Linked-List/01 - Introduction.md → ...uctures/02-linked-list/00-Introduction.md
diff --git a/...ked-List/01 - Operations/01 - Creation.md → ...-Linked-List/01-Operations/01-Creation.md b/...ked-List/01 - Operations/01 - Creation.md → ...-Linked-List/01-Operations/01-Creation.md
diff --git a/...ed-List/01 - Operations/02 - Insertion.md → ...Linked-List/01-Operations/02-Insertion.md b/...ed-List/01 - Operations/02 - Insertion.md → ...Linked-List/01-Operations/02-Insertion.md
diff --git a/...ked-List/01 - Operations/03 - Deletion.md → ...-Linked-List/01-Operations/03-Deletion.md b/...ked-List/01 - Operations/03 - Deletion.md → ...-Linked-List/01-Operations/03-Deletion.md
diff --git a/...ked-List/01 - Operations/00 - Creation.md → ...-Linked-List/01-Operations/01-Creation.md b/...ked-List/01 - Operations/00 - Creation.md → ...-Linked-List/01-Operations/01-Creation.md
diff --git a/...ed-List/01 - Operations/01 - Insertion.md → ...Linked-List/01-Operations/02-Insertion.md b/...ed-List/01 - Operations/01 - Insertion.md → ...Linked-List/01-Operations/02-Insertion.md
diff --git a/...ked-List/01 - Operations/02 - Deletion.md → ...-Linked-List/01-Operations/03-Deletion.md b/...ked-List/01 - Operations/02 - Deletion.md → ...-Linked-List/01-Operations/03-Deletion.md
diff --git a/...inked-List/05 - Resources and Practice.md → ...-linked-list/03-Resources-and-Practice.md b/...inked-List/05 - Resources and Practice.md → ...-linked-list/03-Resources-and-Practice.md
diff --git a/...ructures/03 - Stacks/01 - Introduction.md → ...a-Structures/03-stacks/00-Introduction.md b/...ructures/03 - Stacks/01 - Introduction.md → ...a-Structures/03-stacks/00-Introduction.md
diff --git a/...tacks/02 - Operations.md/01- Insertion.md → ...3-stacks/01-Operations.md/01-Insertion.md b/...tacks/02 - Operations.md/01- Insertion.md → ...3-stacks/01-Operations.md/01-Insertion.md
diff --git a/...tacks/02 - Operations.md/02 - Deletion.md → ...03-stacks/01-Operations.md/02-Deletion.md b/...tacks/02 - Operations.md/02 - Deletion.md → ...03-stacks/01-Operations.md/02-Deletion.md
diff --git a/...ons.md/03 - Other-Important-Operations.md → ...tions.md/03-Other-Important-Operations.md b/...ons.md/03 - Other-Important-Operations.md → ...tions.md/03-Other-Important-Operations.md
diff --git a/...3 - Stacks/03 - Resources-and-Practice.md → ...es/03-stacks/02-Resources-and-Practice.md b/...3 - Stacks/03 - Resources-and-Practice.md → ...es/03-stacks/02-Resources-and-Practice.md
diff --git a/...ructures/04 - Queues/01 - Introduction.md → ...a-Structures/04-queues/00-Introduction.md b/...ructures/04 - Queues/01 - Introduction.md → ...a-Structures/04-queues/00-Introduction.md
diff --git a/... Queues/02 - Operations/01 - Insertion.md → ...s/04-queues/01-Operations/01-Insertion.md b/... Queues/02 - Operations/01 - Insertion.md → ...s/04-queues/01-Operations/01-Insertion.md
diff --git a/...- Queues/02 - Operations/02 - Deletion.md → ...es/04-queues/01-Operations/02-Deletion.md b/...- Queues/02 - Operations/02 - Deletion.md → ...es/04-queues/01-Operations/02-Deletion.md
diff --git a/...ations/03 - Other-Important-Operations.md → ...erations/03-Other-Important-Operations.md b/...ations/03 - Other-Important-Operations.md → ...erations/03-Other-Important-Operations.md
diff --git a/...4 - Queues/03 - Resources-and-Practice.md → ...es/04-queues/02-Resources-and-Practice.md b/...4 - Queues/03 - Resources-and-Practice.md → ...es/04-queues/02-Resources-and-Practice.md
diff --git a/...s/01 - Arrays/Easy/Maximum_in_Array.ipynb → ...res/01-arrays/Easy/Maximum_in_Array.ipynb b/...s/01 - Arrays/Easy/Maximum_in_Array.ipynb → ...res/01-arrays/Easy/Maximum_in_Array.ipynb
diff --git a/...1 - Arrays/Medium/Remove_duplicates.ipynb → .../01-arrays/Medium/Remove_duplicates.ipynb b/...1 - Arrays/Medium/Remove_duplicates.ipynb → .../01-arrays/Medium/Remove_duplicates.ipynb
diff --git a/...res/linked-list/easy/ReverseLinkedList.py → ...02-linked-lists/easy/ReverseLinkedList.py b/...res/linked-list/easy/ReverseLinkedList.py → ...02-linked-lists/easy/ReverseLinkedList.py
diff --git a/...Structures/linked-list/medium/2DtoList.py → ...ctures/02-linked-lists/medium/2DtoList.py b/...Structures/linked-list/medium/2DtoList.py → ...ctures/02-linked-lists/medium/2DtoList.py
diff --git a/...es/02 - Stack/Easy/Stack_operations.ipynb → ...res/03-stacks/Easy/Stack_operations.ipynb b/...es/02 - Stack/Easy/Stack_operations.ipynb → ...res/03-stacks/Easy/Stack_operations.ipynb
diff --git a/...k/Medium/Reverse_string_using_stack.ipynb → ...s/Medium/Reverse_string_using_stack.ipynb b/...k/Medium/Reverse_string_using_stack.ipynb → ...s/Medium/Reverse_string_using_stack.ipynb
diff --git a/games-based-on-dsa/.gitkeep b/games-based-on-dsa/.gitkeep