refactor: dsa folder structure

data_structures/README.md

@@ -4,10 +4,13 @@ This section contains Data Structure and Algorithms in Java, Typescript and Fron
 
 ## Contents
 
+- [Data Structures](./src/DataStructures)
+- [Algorithms](./src/Algorithms)
 - [Sliding Window](./src/KeyPatterns/SlidingWindow/README.md)
+- [NeetCode 150](./neetcode_150/)
+- [Javascript Questions](./js_questions)
 
 ## Docs
 
 - [key-patterns](./docs/keys-patterns.md)
 - [js-questions](./docs/javascript-common-questions.md)
-- [neetcode-150](./neetcode_150/)

data_structures/neetcode_150/src/TopKFrequentElement.java

@@ -0,0 +1,22 @@
+package neetcode_150.src;
+
+/**
+ * Top K Frequent Elements
+ * 
+ * Given an integer array `nums` and integer `k`, return the `k`
+ * most frequent
+ * elements.
+ * 
+ * @apiNote
+ *          - [1,1,1,2,2,3], k = 2
+ *          - k = 2 which means we need to return the top two elements
+ *          - 1 = 3 times
+ *          - 2 = 2 times
+ *          - 3 = 1 times
+ *          - ans : [1,2]
+ */
+public class TopKFrequentElement {
+    public static void main(String[] args) {
+
+    }
+}

data_structures/src/SearchAlgorithms/SearchAlgorithms.java → data_structures/src/Algorithms/SearchAlgorithms/SearchAlgorithms.java

@@ -1,4 +1,4 @@
-package SearchAlgorithms;
+package Algorithms.SearchAlgorithms;
 
 /**
  * Search Algorithms

data_structures/src/SearchAlgorithms/SearchAlgorithmsUsages.java → data_structures/src/Algorithms/SearchAlgorithms/SearchAlgorithmsUsages.java

@@ -1,4 +1,4 @@
-package SearchAlgorithms;
+package Algorithms.SearchAlgorithms;
 
 public class SearchAlgorithmsUsages {
 

data_structures/src/DynamicArrays/DynamicArraySamples.java → data_structures/src/DataStructures/DynamicArrays/DynamicArraySamples.java

@@ -1,6 +1,6 @@
-package DynamicArrays;
+package DataStructures.DynamicArrays;
 
-import Shared.DynamicArray;
+import DataStructures.Shared.DynamicArray;
 
 public class DynamicArraySamples {
     public void SampleOne() {

data_structures/src/LinkedList/BrowserHistory.java → data_structures/src/DataStructures/LinkedList/BrowserHistory.java

@@ -1,17 +1,19 @@
-package LinkedList;
+package DataStructures.LinkedList;
 
 import java.util.LinkedList;
 
 /**
  * Browser History
+ * 
  * @description
- * - Stores the URLs visited. You can go back and forth using a doubly linked list.
+ *              - Stores the URLs visited. You can go back and forth using a
+ *              doubly linked list.
  */
 public class BrowserHistory {
     private LinkedList<String> history = new LinkedList<String>();
     private int currentIndex = -1;
 
-    public void visit(String url){
+    public void visit(String url) {
         while (history.size() > currentIndex + 1) {
             history.removeLast();
         }

data_structures/src/LinkedList/LinkedListSamples.java → data_structures/src/DataStructures/LinkedList/LinkedListSamples.java

@@ -1,4 +1,5 @@
-package LinkedList;
+package DataStructures.LinkedList;
+
 import java.util.Deque;
 import java.util.LinkedList;
 import java.util.Queue;

data_structures/src/Queues/PriorityQueueSamples.java → data_structures/src/DataStructures/Queues/PriorityQueueSamples.java

@@ -1,4 +1,4 @@
-package Queues;
+package DataStructures.Queues;
 
 import java.util.Collections;
 import java.util.PriorityQueue;

data_structures/src/Queues/QueueSamples.java → data_structures/src/DataStructures/Queues/QueueSamples.java

@@ -1,12 +1,13 @@
-package Queues;
+package DataStructures.Queues;
 
 import java.util.LinkedList;
 import java.util.Queue;
 
 public class QueueSamples {
     public void SampleOne() {
         System.out.println("\n===> Queue Sample One");
-        Queue<String> queue = new LinkedList<String>(){};
+        Queue<String> queue = new LinkedList<String>() {
+        };
         queue.offer("Karen");
         queue.offer("Chad");
         queue.offer("Steve");

data_structures/src/Shared/DynamicArray.java → data_structures/src/DataStructures/Shared/DynamicArray.java

@@ -1,4 +1,4 @@
-package Shared;
+package DataStructures.Shared;
 
 public class DynamicArray {
     private int size;

data_structures/src/Stacks/StackSamples.java → data_structures/src/DataStructures/Stacks/StackSamples.java

@@ -1,10 +1,11 @@
-package Stacks;
+package DataStructures.Stacks;
 
 import java.util.Stack;
 
 public class StackSamples {
     /**
      * Stack Sample One
+     * 
      * @apiNote - This is stack sample usage one
      */
     public void SampleOne() {

data_structures/src/Stacks/UndoRedoManager.java → data_structures/src/DataStructures/Stacks/UndoRedoManager.java

@@ -1,4 +1,4 @@
-package Stacks;
+package DataStructures.Stacks;
 
 import java.util.Stack;
 

data_structures/src/Main.java

@@ -1,10 +1,10 @@
-import DynamicArrays.DynamicArraySamples;
-import LinkedList.LinkedListSamples;
-import Queues.PriorityQueueSamples;
-import Queues.QueueSamples;
-import SearchAlgorithms.SearchAlgorithmsUsages;
-import Stacks.StackSamples;
-import Stacks.UndoRedoManager;
+import Algorithms.SearchAlgorithms.SearchAlgorithmsUsages;
+import DataStructures.DynamicArrays.DynamicArraySamples;
+import DataStructures.LinkedList.LinkedListSamples;
+import DataStructures.Queues.PriorityQueueSamples;
+import DataStructures.Queues.QueueSamples;
+import DataStructures.Stacks.StackSamples;
+import DataStructures.Stacks.UndoRedoManager;
 
 public class Main {
     public static void main(String[] args) {