Jun 16, 2023 · Jun 13, 2023
diff --git a/Data-Structures/Heap/MinPriorityQueue.js b/Data-Structures/Heap/MinPriorityQueue.js

 /* 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

 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

 /*
 *
 *  Unique Paths
diff --git a/Project-Euler/Problem011.js b/Project-Euler/Problem011.js

 /*
 *
 * 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

 /**
 * @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

 /**
 * @function Fibonacci
 * @description Function to return the N-th Fibonacci number.
diff --git a/Sorts/TopologicalSort.js b/Sorts/TopologicalSort.js

 export function TopologicalSorter () {
  const graph = {}
  let isVisitedNode
Original file line number	Diff line number	Diff line change
		@@ -1,4 +1,3 @@

		/* Minimum Priority Queue
		* It is a part of heap data structure
		* A heap is a specific tree based data structure
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -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)
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -1,4 +1,3 @@

		/*
		*
		* In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -1,4 +1,3 @@

		/**
		* @function BinarySearch
		* @description Search the integer inside the sorted integers array using Binary Search Algorithm.
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -1,4 +1,3 @@

		/**
		* @function Fibonacci
		* @description Function to return the N-th Fibonacci number.
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -1,4 +1,3 @@

		export function TopologicalSorter () {
		const graph = {}
		let isVisitedNode
Expand Down