Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

var addTwoNumbers = function(l1, l2) {

   var alpha1 = "" 
   var alpha2 = ""
   var arr = []


 // Looping through first list l1

   for(var i = 0; i< l1.length; i++){
   	alpha1 = l1[i]+alpha1

   	// converting 	l1 to string and setting it to ALPHA 1 
   }

   // Looping through second  list L2
   for(var i = 0; i< l2.length; i++){
   	alpha2 = l2[i]+alpha2

   	// converting 	l2 to string and setting it to ALPHA 2 
   }
   // Coverting alpha1 and apha2 to intergets and making their sum to a new variable string "New"
  var New = parseInt(alpha1) +  parseInt(alpha2)
   New = New + ""
 
  for(var i=0;i<New.length; i++){
// Pushing the New variable is reverse order to arr and also converting it back to interger
arr.push(parseInt(New[New.length-i-1]))

  }
  // Returning the array
  return arr
};
addTwoNumbers([9,9,9,9,9,9,9],[9,9,9,9])

Line 51 in solution.js
             throw new TypeError(__serialize__(ret) + " is not valid value for the expected return type ListNode";
             ^
TypeError: [null,null,null] is not valid value for the expected return type ListNode

tensazangetsu20:
You aren't even meant to solve this question like this at all. This is the famous sum of two linked list question asked in companies like Facebook and Google. I will send my solution but in java later. Lemme book space.

LikeAking:
U have learnt JS.

Nice one.

Use map.

use reduce.

reverse the arr with reverse.




Also drop the link.

I was trying to avoid normal javascript array methods at all cost

gistray:


I believe they are different ways to solve the question.

tensazangetsu20:

True but you aren't event iterating the linked list the right way. You are taking it as an array

gistray:


is there a list in javascript?
that's whats confusing me

LikeAking:
My solution.

function addTwoNumbers(a,b){

let xy = a.toString().replace(/,|\s/g,""

let xz = b.toString().replace(/,|\s/g,""

let zzz = Number(xy) + Number(xz)

return zzz.toString().split("".reverse().join(""

}
console.log(addTwoNumbers([9,9,9,9,9,9,9], [9,9,9,9]))

output = 89990001

NL dey convert some brackets to this green guy .

Any wia u see am use ) = bracket

gistray:


Hard to read.


How about not using regex

tensazangetsu20:
You aren't even meant to solve this question like this at all. This is the famous sum of two linked list question asked in companies like Facebook and Google. I will send my solution but in java later. Lemme book space.

Rgade:

Yoo boss, you do Java now?

tensazangetsu20:
public static class LinkedList {
public int value;
public LinkedList next;

public LinkedList(int value) {
this.value = value;
this.next = null;
}
}

public LinkedList sumOfLinkedLists(LinkedList linkedListOne, LinkedList linkedListTwo) {
LinkedList nextHeadPointer = new LinkedList(0);
LinkedList currentNode = nextHeadPointer;
int carry = 0;

LinkedList nodeOne = linkedListOne;
LinkedList nodeTwo = linkedListTwo;
while (nodeOne != null || nodeTwo != null || carry != 0){
int valueOne = (nodeOne != null) ? nodeOne.value : 0;
int valueTwo = (nodeTwo != null) ? nodeTwo.value : 0;
int sumOfValues = valueOne + valueTwo + carry;

int newValue = sumOfValues % 10;
LinkedList newNode = new LinkedList(newValue);
currentNode.next = newNode;
currentNode = newNode;

carry = sumOfValues / 10;
nodeOne = (nodeOne != null) ? nodeOne.next : null;
nodeTwo = (nodeTwo != null) ? nodeTwo.next : null;

}
return nextHeadPointer.next;
}

This is the solution in Java.

tensazangetsu20:

True but you aren't event iterating the linked list the right way. You are taking it as an array

gistray:



Maybe I just convert the array to a list afterwards?

tensazangetsu20:


So practically you are going to construct the new LinkedList and as you are iterating both linked list you are going to add both values and put them in the new linked list then return back that list.

gistray:


No, convert the return array to a list in JavaScript.

What's important is the end product right?

I can't even tell what a list is in JavaScript... Is it an object or what?

Deicide:
What you did there is not linked list

tensazangetsu20:


A linked list is its own data structure. You are taking it as an array but it isn't. That's why you are struggling.

gistray:


Can you help me in JavaScript?

tensazangetsu20:


Its the same thing I did too in Javascript the only difference is the LinkedList data structure will be a constructor( I dont think you have to created this, its always given in the code) and you add a math.floor to the new carry value in the while loop every other variable can be declared with const the ones reassigned can be done with let but its the exact same code.

gistray:



What matters is the returned value right v

gistray:


No, convert the return array to a list in JavaScript.

What's important is the end product right?

I can't even tell what a list is in JavaScript... Is it an object or what?

tensazangetsu20:
public static class LinkedList {
public int value;
public LinkedList next;

public LinkedList(int value) {
this.value = value;
this.next = null;
}
}

public LinkedList sumOfLinkedLists(LinkedList linkedListOne, LinkedList linkedListTwo) {
LinkedList nextHeadPointer = new LinkedList(0);
LinkedList currentNode = nextHeadPointer;
int carry = 0;

LinkedList nodeOne = linkedListOne;
LinkedList nodeTwo = linkedListTwo;
while (nodeOne != null || nodeTwo != null || carry != 0){
int valueOne = (nodeOne != null) ? nodeOne.value : 0;
int valueTwo = (nodeTwo != null) ? nodeTwo.value : 0;
int sumOfValues = valueOne + valueTwo + carry;

int newValue = sumOfValues % 10;
LinkedList newNode = new LinkedList(newValue);
currentNode.next = newNode;
currentNode = newNode;

carry = sumOfValues / 10;
nodeOne = (nodeOne != null) ? nodeOne.next : null;
nodeTwo = (nodeTwo != null) ? nodeTwo.next : null;

}
return nextHeadPointer.next;
}

This is the solution in Java.

gistray:
So i am solving this problem on leetcode and my solutions runs as expected on the console.
But if I run the code on Leetcode is throws an error

THE QUESTION

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

MY SOLUTION

var addTwoNumbers = function(l1, l2) {

   var alpha1 = "" 
   var alpha2 = ""
   var arr = []


 // Looping through first list l1

   for(var i = 0; i< l1.length; i++){
   	alpha1 = l1[i]+alpha1

   	// converting 	l1 to string and setting it to ALPHA 1 
   }

   // Looping through second  list L2
   for(var i = 0; i< l2.length; i++){
   	alpha2 = l2[i]+alpha2

   	// converting 	l2 to string and setting it to ALPHA 2 
   }
   // Coverting alpha1 and apha2 to intergets and making their sum to a new variable string "New"
  var New = parseInt(alpha1) +  parseInt(alpha2)
   New = New + ""
 
  for(var i=0;i<New.length; i++){
// Pushing the New variable is reverse order to arr and also converting it back to interger
arr.push(parseInt(New[New.length-i-1]))

  }
  // Returning the array
  return arr
};
addTwoNumbers([9,9,9,9,9,9,9],[9,9,9,9])

THE ERROR ON LEETCODE

Line 51 in solution.js
             throw new TypeError(__serialize__(ret) + " is not valid value for the expected return type ListNode";
             ^
TypeError: [null,null,null] is not valid value for the expected return type ListNode

WORST PART IS, THERE'S NO LINE 51 ON THE LEETCODE CODE MODULE LOL


I AM USING JAVASCRIPT

LikeAking:


drop d link to d question.

gistray:


Can you help me in JavaScript?

Rgade:

Omo

islamics:

I think it is the second question in the list of problem in leetcode. Check the second question under problems.


Try checking out Alvin YouTube video tutorial on Data structure. He does his solutions using JavaScript.


Real Omo.