TechWithTy

/**
 * @param {number[]} nums
 * @return {number}
 */
var removeDuplicates = function(nums) {
   nums.forEach((num,i) => {
       if(nums[i+1] !== null && nums[i+1] == nums[i] ){
            nums.splice(i, 1);
           console.log(nums)
           removeDuplicates(nums)

TechWithTy

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var runningSum = function(nums) {
    let newNums = [];
    let numsSum = 0;
    nums.forEach((num,i) =>{
            
        if(nums[i] !== null){

TechWithTy

// /**
//  * @param {string} s
//  * @return {boolean}
//  */
let brackets = {
    "(": ")",
    "[": "]",
    "{": "}",
};

TechWithTy

let mergeTwoLists = function (l1, l2) {
  let dummy = new ListNode(-1);
  let head = dummy;

  while (l1 !== null && l2 !== null) {
    if (l1.val <= l2.val) {
      dummy.next = l1;
      l1 = l1.next;
    } else {
      dummy.next = l2;

TechWithTy

/** Initial Hypothesis
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    let splitWords = [];
    let commonPrefix =[];
    strs.forEach((word,i) =>{
        splitWords[i] = word.split('');
    })

TechWithTy

/**
 * @param {string} s
 * @return {number}
 */
var romanToInt = function(s) {
    romanNumerals = {
        I: 1,
        V: 5,
        X: 10,
        L: 50,

TechWithTy

/**
 * @param {number} x
 * @return {boolean}
 */
var isPalindrome = function(x) {
    let reversedNum = 0
    //Passes
    if(x < 0){
        return false;
    }else{

TechWithTy

/**
 * @param {number} x
 * @return {number}
 */
var reverse = function (x) {
  return parseFloat(x.toString().split('').reverse().join('')) * Math.sign(x);
};


//https://www.freecodecamp.org/news/js-basics-how-to-reverse-a-number-9aefc20afa8d/

TechWithTy

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    previousValues = {}; // Set Previous Hash Values
for (let i = 0; i < nums.length; i++){ // Loop through entire array
    currentNum = nums[i]; // Get Current Loop Number
    neededNum = target - currentNum; //Calculate Number Needed

TechWithTy

const LinkedList = require('./LinkedList')

describe('#insertAtHead', () => {
  test('it adds the element to the beginning of the list', () => {
    const ll = new LinkedList()
    ll.insertAtHead(10)
    const oldHead = ll.head
    ll.insertAtHead(20)

    expect(ll.head.value).toBe(20)