Shortest Unsorted Continuous Subarray Length

README.md

@@ -17,6 +17,7 @@ Structures-Wiz is a JavaScript based npm package for using awesome data structur
 - [Usage](#usage)
     - [Algorithms](#algo)
       - [Longest Increasing Subsequence Length](#llisl)
+      - [Shortest Unsorted Continuous Subarray Length](#sucs)
       - [Is Cycle Present in a Graph](#isCyclePresent)
       - [Patience Sort](#pat-sort)
       - [Topological Sort in a Graph](#top-sort)
@@ -109,6 +110,21 @@ console.log("Length of longest increasing subsequence is :", longestLen);// 4
 
 ```
 
+#### Shortest Unsorted Continuous Subarray Length<a name="sucs"></a>
+Method to find the length of the shortest unsorted continuous subarray from an input array.
+
+```javascript
+
+import { getShortestUnsortedSubarray } from  'structures-wiz';
+
+const  list  =  [2,6,4,8,10,9,15];
+
+const  shortedSubArrayLen  =  getShortestUnsortedSubarray(list);
+
+console.log("Length of hortest Unsorted Continuous Subarray is :", shortedSubArrayLen);// 5
+
+```
+
 
 #### Is Cycle Present in Graph<a name="isCyclePresent"></a>
 Method to find the cycle is to use Topological sort. First we find the inDegree of each node and then add those 

algorithms/util/getShortestUnsortedSubarray.util.js

@@ -0,0 +1,22 @@
+const { getPatienceSortedList } = require("../sorting/getPatienceSortedList.sort");
+
+const getShortestUnsortedSubarray = nums => {
+
+    if(!nums || !Array.isArray(nums)){
+        return;
+    }
+    let copy = Array.from(nums);
+    copy.sort((a,b)=>a-b);
+    let min = Infinity, max = -Infinity;
+
+    for(let i=0;i<nums.length;i++){
+        if(copy[i] !== nums[i]){
+            min = Math.min(min, i);
+            max = Math.max(max, i);
+        }
+    }
+    return max-min + 1 === -Infinity ? 0 : max-min + 1;
+};
+
+
+module.exports.getShortestUnsortedSubarray = getShortestUnsortedSubarray;

index.js

@@ -3,6 +3,7 @@ const { LinkedList } = require("./data-structures/LinkedList");
 const { PriorityQueue } = require("./data-structures/PriorityQueue");
 const { isCyclePresentInGraph } = require("./algorithms/util/isCyclePresent.util");
 const { getPatienceSortedList }  = require("./algorithms/sorting/getPatienceSortedList.sort");
+const { getShortestUnsortedSubarray } = require("./algorithms/util/getShortestUnsortedSubarray.util");
 const { getTopologicallySortedGraph } = require("./algorithms/sorting/getTopologicallySortedGraph.sort");
 const { getLongestIncreasingSubsequenceLen } = require("./algorithms/util/getLongestIncreasingSubsequenceLen");
 
@@ -11,5 +12,6 @@ module.exports.LinkedList = LinkedList;
 module.exports.PriorityQueue = PriorityQueue;
 module.exports.isCyclePresentInGraph = isCyclePresentInGraph;
 module.exports.getPatienceSortedList = getPatienceSortedList;
+module.exports.getShortestUnsortedSubarray = getShortestUnsortedSubarray;
 module.exports.getTopologicallySortedGraph = getTopologicallySortedGraph;
 module.exports.getLongestIncreasingSubsequenceLen = getLongestIncreasingSubsequenceLen;

package.json

@@ -1,6 +1,6 @@
 {
   "name": "structures-wiz",
-  "version": "1.0.23",
+  "version": "1.0.24",
   "description": "Structures-Wiz is a JavaScript based npm package for using awesome data structures like Stacks, Queue, LinkedList, PriorityQueues.",
   "main": "index.js",
   "scripts": {