added isOneEditDistanceDBG()

Author: shkvik

src/main.ts

@@ -1,6 +1,9 @@
 import { searchDBG } from "./array/search-in-rotated-sorted-array";
 import { flatDBG } from "./js_core/flatten";
 import { findAnagramsDBG } from "./string/find-anagrams";
+import { lengthOfLongestSubstringDBG } from "./string/longest-substring.string";
 import { testValidPalindrome } from "./string/valid-palindrome";
+import { EventEmitter } from 'node:events';
 
-testValidPalindrome()
+
+isOneEditDistanceDBG();

src/string/is-one-edit-distance.ts

@@ -19,3 +19,31 @@ function isOneEditDistance(s: string, t: string): boolean {
   }
   return lenS + 1 === lenT;
 }
+
+export const isOneEditDistanceDBG = () => {
+  const tests = [
+    {
+      input: { s: "ab", t: "acb" },
+      result: true
+    },
+    {
+      input: { s: "cab", t: "ad" },
+      result: false
+    },
+    {
+      input: { s: "1203", t: "1213" },
+      result: true
+    }
+  ];
+
+  tests.forEach((test, index) => {
+    const result = isOneEditDistance(test.input.s, test.input.t);
+    if (result === test.result) {
+      console.log(`${index} success`);
+    } else {
+      console.log(`${index} fail`);
+      console.log(`expected ${test.result}`);
+      console.log(`got ${result}`);
+    }
+  });
+} 

src/string/longest-substring.string.ts

@@ -1,16 +1,49 @@
 export function lengthOfLongestSubstring(s: string): number {
   let maxLength = 0;
-  let right = 0;
+  let left = 0;
   const charIndexMap = new Map<string, number>();
 
-  for (let left = 0; left < s.length; left++) {
-    const char = s[left];
+  for (let right = 0; right < s.length; right++) {
+    const char = s[right];
 
-    if (charIndexMap.has(char) && charIndexMap.get(char) >= right) {
-      right = charIndexMap.get(char)! + 1;
+    if (charIndexMap.has(char) && charIndexMap.get(char) >= left) {
+      left = charIndexMap.get(char)! + 1;
     }
-    charIndexMap.set(char, left);
-    maxLength = Math.max(maxLength, left - right + 1);
+    charIndexMap.set(char, right);
+    maxLength = Math.max(maxLength, right - left + 1);
   }
   return maxLength;
+}
+
+
+export const lengthOfLongestSubstringDBG = () => {
+  const tests = [
+    {
+      input: "abcabcdbb",
+      result: 4, // "abc"
+    },
+    {
+      input: "bbbbb",
+      result: 1, // "b"
+    },
+    {
+      input: "pwwkew",
+      result: 3, // "wke"
+    },
+    {
+      input: "",
+      result: 0, // пустая строка
+    }
+  ];
+  
+  tests.forEach((test, index) => {
+    const result = lengthOfLongestSubstring(test.input);
+    if (result === test.result) {
+      console.log(`${index} success`);
+    } else {
+      console.log(`${index} fail`);
+      console.log(`expected ${test.result}`);
+      console.log(`got ${result}`);
+    }
+  });
 }