chore: 🤖 remove extra lines (#1330)

I ran the command yarn style and that got failed, so I fixed that
This commit is contained in:
Umesh Patidar
2023-06-17 01:49:21 +05:30
committed by GitHub
parent 1666c3a0be
commit 6debd5c1a2
7 changed files with 0 additions and 7 deletions

View File

@ -1,4 +1,3 @@
/* Minimum Priority Queue /* Minimum Priority Queue
* It is a part of heap data structure * It is a part of heap data structure
* A heap is a specific tree based data structure * A heap is a specific tree based data structure

View File

@ -1,4 +1,3 @@
const isValid = (board, row, col, k) => { const isValid = (board, row, col, k) => {
for (let i = 0; i < 9; i++) { for (let i = 0; i < 9; i++) {
const m = 3 * Math.floor(row / 3) + Math.floor(i / 3) const m = 3 * Math.floor(row / 3) + Math.floor(i / 3)

View File

@ -1,4 +1,3 @@
/* /*
* *
* Unique Paths * Unique Paths

View File

@ -1,4 +1,3 @@
/* /*
* *
* In the 20×20 grid below, four numbers along a diagonal line have been marked in red. * In the 20×20 grid below, four numbers along a diagonal line have been marked in red.

View File

@ -1,4 +1,3 @@
/** /**
* @function BinarySearch * @function BinarySearch
* @description Search the integer inside the sorted integers array using Binary Search Algorithm. * @description Search the integer inside the sorted integers array using Binary Search Algorithm.

View File

@ -1,4 +1,3 @@
/** /**
* @function Fibonacci * @function Fibonacci
* @description Function to return the N-th Fibonacci number. * @description Function to return the N-th Fibonacci number.

View File

@ -1,4 +1,3 @@
export function TopologicalSorter () { export function TopologicalSorter () {
const graph = {} const graph = {}
let isVisitedNode let isVisitedNode