Udemy JS Algorithms & Data Structures Masterclass- Section 6 Exercise 5

Multiple Pointers - isSubsequence

Write a function called isSubsequence which takes in two strings and checks whether the characters in the first string form a subsequence of the characters in the second string. In other words, the function should check whether the characters in the first string appear somewhere in the second string, without their order changing.

function isSubsequence(string1, string2) { //find letter in second string //each letter found after should come after the previous letter //each letter after should be searched after position of previous letter let pointer = 0; let pointer2 = 0; let match = 0; while (pointer < string1.length && pointer2 < string2.length) { if (string1.charAt(pointer) === string2.charAt(pointer2)) { pointer++; pointer2++; match++; } else if (string1.charAt(pointer) !== string2.charAt(pointer2)) { pointer2++; } } if (match === string1.length) return true; else return false; }

Comments

  1. ikeeshiafabryMarch 3, 2022 at 4:41 PM

    Caesars Palace Casino Review & Ratings by Experts - Dr
    Caesars Palace Casino is an online 토토사이트 gambling site that serves players from the 포항 출장샵 UK. The 구미 출장마사지 casino is 삼척 출장마사지 owned and operated 순천 출장마사지 by The Entertainment

    ReplyDelete

Post a Comment

Popular posts from this blog

Code Wars: Data Reverse (6 kyu)

Link to code challenge Code efficiency: Loops through string once (from the end) and with one new variable. String splicing- consider its efficiency? Try not to manipulate data when looping for efficiency. function dataReverse(data) { let arr = []; while (data.length) { arr.push(...data.splice(data.length - 8, data.length)); } return arr; }
Read more

Code Wars: longest_palindrome (6 kyu)

Link to code challenge Find the length of the longest substring in the given string s that is the same in reverse. As an example, if the input was “I like racecars that go fast”, the substring (racecar) length would be 7. If the length of the input string is 0, the return value must be 0. //Loop thru string and find longest substring that is also a palindrome //Efficiency- start with longest length first (each "outer" loop still looping to shorter //strings but done prior to "inner" loops which have longer strings- can be more efficient?) longestPalindrome=function(s){ if (s === "") return 0; else if (s.length === 1) return 1; let mainPointer = s.length; let subPointer = 0; let largest = 0; while (subPointer = 0) { //refactored- instead of pushing to new array let newString = s.slice(subPointer, mainPointer); //can this be refactored by comparing the two endpoints of the string but longer code? if ( newStr...
Read more

Code Wars: Find the odd int

https://www.codewars.com/kata/54da5a58ea159efa38000836/train/javascript Given an array, find the int that appears an odd number of times. There will always be only one integer that appears an odd number of times. function findOdd(A) {   let arr = A.sort((a,b) => a - b);   let counter = 1;     if (arr.length === 1) return arr[0];     for (let i = 0; i < arr.length - 1; i++) {         if (arr[i] === arr[i + 1]) {       counter++;     }     else if (arr[i] !== arr[i + 1]) {             if (counter % 2 !== 0) {         return arr[i];       }       // if it turns out to be last number in array with a count of 1 (since for loop doesnt get to it)       else if (i + 1 === arr.length - 1) {         return arr[i + 1];       }       count...
Read more