392. Is Subsequence - Easy

 Given two strings s and t, return true if s is a subsequence of t, or false otherwise. A subsequence of a string is a new string that is formed from the original characters without disturbing the relative positions of the remaining characters e.g "ace" is a subsequence of "abcde" while "aec" is not.

Example:
Input: s = "abc", t = "ahbgdc"

Output: true

Constraints:
0 <= s.length <= 100

0 <= t.length <= 10**4

s and t consist only of lowercase English letters

Solution:
var isSubsequence = function(s, t) {

    let index = 0;

    let string = '';

    for (let i = 0; i < t.length; i++) {
        if (s[index] === t[i]) {

            string += t[i];

            index++;

        }

    }

     return string === s;

}

Thoughts:

Figured out the solution on my own, which is great. It's not the most efficient solution but I'm happy with it and would give myself a 8/10 for confidence. I just need to build my confidence up and do more problems to be comfortable doing these under time pressure and sharing my screen.

Comments

Post a Comment

Popular posts from this blog

28. Find the Index of the First Occurence in a String - Easy

Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if the needle is not part of haystack. Example: Input: haystack = 'sadbutsad', needle = 'sad' Output: 0 Explanation: 'sad' occurs at index 0 and 6. The first occurrence is at index 0, so we return 0. Constraints: 1 <= haystack.length, needle.length <= 10**4 haystack and needle consist of only lowercase English characters. Solution: var strStr = function(haystack, needle) {          return haystack.indexOf(needle); } Thoughts: 10/10 easy.
Read more

121. Best Time to Buy and Sell Stock - Easy

You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximise your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0 Example: Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6 - 1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. Constraints: 1 <= prices.length <= 10**5 0 <= prices[i] <= 10**4 Solution: var maxProfit = function(prices) {     let buyPrice = prices[0];     let profit = 0;     for (let i = 1; i < prices.length; i++) {          if (buyPrice > prices[i]) {               buyPrice = prices[i];         ...
Read more

58. Length of Last Word - Easy

Given a string s consisting of words and spaces, return the length of the last word in the string. A word is. a maximal substring consisting of non-space characters only. Example: Input: s = "Hello World" Output: 5 Explanation: The last word is "World" with length 5. Constraints: 1 <= s.length <= 10**4 s consists of only English letters and spaces ' '. There will be at least one word in s. Solution: var lenghtOfLastWord = function(s) {       return s.trim().split(' ').pop().length; } Thoughts: Super simple. 10/10 for confidence and understanding.
Read more