Oct 4, 2025 · Oct 4, 2025
diff --git a/Maths/MobiusFunction.js b/Maths/MobiusFunction.js
  return primeFactorsArray.length !== new Set(primeFactorsArray).size
    ? 0
    : primeFactorsArray.length % 2 === 0
    ? 1
    : -1
 ? 1
 : -1
 }
diff --git a/Sliding-Windows/MinimumWindowSubstring.js b/Sliding-Windows/MinimumWindowSubstring.js
 /*
 * Author: Mayank
 * Minimum Window Substring implementation in JavaScript
 * Finds the smallest substring of s that contains all characters of t.
 */

 function minWindowSubstring(s, t) {
  if (t.length > s.length) return ''

  const need = {}
  for (let char of t) {
    need[char] = (need[char] || 0) + 1
  }

  let left = 0
  let count = t.length
  let minLen = Infinity
  let minStart = 0

  for (let right = 0; right < s.length; right++) {
    if (need[s[right]] !== undefined) {
      if (need[s[right]] > 0) count--
      need[s[right]]--
    }

    while (count === 0) {
      if (right - left + 1 < minLen) {
        minLen = right - left + 1
        minStart = left
      }
      if (need[s[left]] !== undefined) {
        need[s[left]]++
        if (need[s[left]] > 0) count++
      }
      left++
    }
  }

  return minLen === Infinity ? '' : s.substring(minStart, minStart + minLen)
 }

 export { minWindowSubstring }
diff --git a/Sliding-Windows/test/MinimumWindowSubstring.test.js b/Sliding-Windows/test/MinimumWindowSubstring.test.js
 /*
 * Test file for Minimum Window Substring
 */

 import { minWindowSubstring } from '../MinimumWindowSubstring.js'

 test('return smallest window containing all characters', () => {
  expect(minWindowSubstring('ADOBECODEBANC', 'ABC')).toBe('BANC')
 })

 test('return empty string if no window found', () => {
  expect(minWindowSubstring('HELLO', 'XYZ')).toBe('')
 })

 test('return full string if it matches exactly', () => {
  expect(minWindowSubstring('ABC', 'ABC')).toBe('ABC')
 })
Original file line number	Diff line number	Diff line change
Expand Up		@@ -28,6 +28,6 @@ export const mobiusFunction = (number) => {
		return primeFactorsArray.length !== new Set(primeFactorsArray).size
		? 0
		: primeFactorsArray.length % 2 === 0
		? 1
		: -1
		? 1
		: -1
		}
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,42 @@
		/*
		* Author: Mayank
		* Minimum Window Substring implementation in JavaScript
		* Finds the smallest substring of s that contains all characters of t.
		*/

		function minWindowSubstring(s, t) {
		if (t.length > s.length) return ''

		const need = {}
		for (let char of t) {
		need[char] = (need[char] \|\| 0) + 1
		}

		let left = 0
		let count = t.length
		let minLen = Infinity
		let minStart = 0

		for (let right = 0; right < s.length; right++) {
		if (need[s[right]] !== undefined) {
		if (need[s[right]] > 0) count--
		need[s[right]]--
		}

		while (count === 0) {
		if (right - left + 1 < minLen) {
		minLen = right - left + 1
		minStart = left
		}
		if (need[s[left]] !== undefined) {
		need[s[left]]++
		if (need[s[left]] > 0) count++
		}
		left++
		}
		}

		return minLen === Infinity ? '' : s.substring(minStart, minStart + minLen)
		}

		export { minWindowSubstring }
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,17 @@
		/*
		* Test file for Minimum Window Substring
		*/

		import { minWindowSubstring } from '../MinimumWindowSubstring.js'

		test('return smallest window containing all characters', () => {
		expect(minWindowSubstring('ADOBECODEBANC', 'ABC')).toBe('BANC')
		})

		test('return empty string if no window found', () => {
		expect(minWindowSubstring('HELLO', 'XYZ')).toBe('')
		})

		test('return full string if it matches exactly', () => {
		expect(minWindowSubstring('ABC', 'ABC')).toBe('ABC')
		})