fcc-again

have to learn more and practice functional programming

Starts from here

• recursion thought process should be written and analyzed

• regex was good but didn't try to memorize rules and checked a few solutions

• Basic Data Structures section I did long ago, so did again for warm up with my second account

• longest word in a string caused some time consumption, separating by space I had to count the word length, but as the code was depended on space, the last word length counting was causing issue, the missing piece, so while counting the characters and increasing value, additonal check was added inside the "if" block "if the string position is the last one or not"

• only the if and inner if block

if(str[x] != " ")
{
  if(x == str.length - 1)
  {
    currentWordLength++
    if(currentWordLength > longestWordLength)
    {
      longestWordLength = currentWordLength;
      console.log("longest word length : " + longestWordLength)
    }

    currentWordLength = 0;  
  }
  else
  {
    currentWordLength++
  }
}

• fcc nearest solution

function findLongestWordLength(str) {
let longestLength = 0;
let currentLength = 0;

for (let i = 0; i < str.length; i++) {
  console.log("Current Character : " + str[i])
  if (str[i] === " ") {
    if (currentLength > longestLength) {
      longestLength = currentLength;
    }
    currentLength = 0;
  } else {
    currentLength++;
  }
}

// for last word section, this is the difference from my code
// for this section I had to put an additonal if block inside main if block, check above section code

if (currentLength > longestLength) {
  longestLength = currentLength;
}

return longestLength;
}

• in Return Largest Numbers in Arrays problem, when we had to find the max value inside an array, my basic idea was to comparing with 0 (which was set the initial max value) first with every array elements, but this worked for positive values, when negative values were there, had to set the max value array[x][0] and then we needed to compare
• the problem of ending matching can be done with regex but tried manually, concept is string index (string length - target length) and matching it with target index 0, if full matches return true, if one doesn't match return false.
• recursion Repeat a String Repeat a String

problem slice and splice

// so basically I am weak at js splice splice thing // but thinking process was okay

// for this problem we need to use separete array // then as splice can replace or remove in terms of (index and how many elements will be replaced) parameter

// using splice we needed to loop through the first array cause we have to add all the arr1 elements to a certain index number in arr2

/* from doc

Array.prototype.splice()

The splice() method changes the contents of an array by removing or replacing existing elements and/or adding new elements in place.

To create a new array with a segment removed and/or replaced without mutating the original array, use toSpliced(). To access part of an array without modifying it, see slice(). */

• using js problem solving sometime feels boring, because of advanced array methods like slice splice, no raw feel
• the last problem seems like same, it's kind of easier if we do solve this problem using slice but how does they work