From 6debd5c1a20fcdffe435c35b5b901e7a1e61971e Mon Sep 17 00:00:00 2001
From: Umesh Patidar <50135590+umeshdangrecha@users.noreply.github.com>
Date: Sat, 17 Jun 2023 01:49:21 +0530
Subject: [PATCH] =?UTF-8?q?chore:=20=F0=9F=A4=96=20remove=20extra=20lines?=
 =?UTF-8?q?=20(#1330)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

I ran the command yarn style and that got failed, so I fixed that
---
 Data-Structures/Heap/MinPriorityQueue.js | 1 -
 Dynamic-Programming/SudokuSolver.js      | 1 -
 Dynamic-Programming/UniquePaths.js       | 1 -
 Project-Euler/Problem011.js              | 1 -
 Recursive/BinarySearch.js                | 1 -
 Recursive/FibonacciNumberRecursive.js    | 1 -
 Sorts/TopologicalSort.js                 | 1 -
 7 files changed, 7 deletions(-)

diff --git a/Data-Structures/Heap/MinPriorityQueue.js b/Data-Structures/Heap/MinPriorityQueue.js
index bc4f26f78..5b543ce94 100644
--- a/Data-Structures/Heap/MinPriorityQueue.js
+++ b/Data-Structures/Heap/MinPriorityQueue.js
@@ -1,4 +1,3 @@
-
 /* Minimum Priority Queue
 * It is a part of heap data structure
 * A heap is a specific tree based data structure
diff --git a/Dynamic-Programming/SudokuSolver.js b/Dynamic-Programming/SudokuSolver.js
index 75f174a31..b077f6ec1 100644
--- a/Dynamic-Programming/SudokuSolver.js
+++ b/Dynamic-Programming/SudokuSolver.js
@@ -1,4 +1,3 @@
-
 const isValid = (board, row, col, k) => {
   for (let i = 0; i < 9; i++) {
     const m = 3 * Math.floor(row / 3) + Math.floor(i / 3)
diff --git a/Dynamic-Programming/UniquePaths.js b/Dynamic-Programming/UniquePaths.js
index 4b3d67a1a..a37049b2f 100644
--- a/Dynamic-Programming/UniquePaths.js
+++ b/Dynamic-Programming/UniquePaths.js
@@ -1,4 +1,3 @@
-
 /*
  *
  *  Unique Paths
diff --git a/Project-Euler/Problem011.js b/Project-Euler/Problem011.js
index 4135702c8..190295c8a 100644
--- a/Project-Euler/Problem011.js
+++ b/Project-Euler/Problem011.js
@@ -1,4 +1,3 @@
-
 /*
  *
  * In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
diff --git a/Recursive/BinarySearch.js b/Recursive/BinarySearch.js
index 4c9a2d78a..ba622daaa 100644
--- a/Recursive/BinarySearch.js
+++ b/Recursive/BinarySearch.js
@@ -1,4 +1,3 @@
-
 /**
  * @function BinarySearch
  * @description Search the integer inside the sorted integers array using Binary Search Algorithm.
diff --git a/Recursive/FibonacciNumberRecursive.js b/Recursive/FibonacciNumberRecursive.js
index 4b32e9cb4..911d078e9 100644
--- a/Recursive/FibonacciNumberRecursive.js
+++ b/Recursive/FibonacciNumberRecursive.js
@@ -1,4 +1,3 @@
-
 /**
  * @function Fibonacci
  * @description Function to return the N-th Fibonacci number.
diff --git a/Sorts/TopologicalSort.js b/Sorts/TopologicalSort.js
index 589044953..72487615b 100644
--- a/Sorts/TopologicalSort.js
+++ b/Sorts/TopologicalSort.js
@@ -1,4 +1,3 @@
-
 export function TopologicalSorter () {
   const graph = {}
   let isVisitedNode