Title: Add Solution for "Add Two Numbers Using Linked Lists" Problem

[janWICKEDpro]

Initiative (Required)

Hacktoberfest 2024 🎃

Is your proposal related to a problem? Please describe.

PROBLEM DESCRIPTION

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.

Example 1

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

Example 2

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

Constraints

• The number of nodes in each linked list is in the range [1, 100]
• 0 <= Node.val <= 9
• It is guaranteed that the list represents a number that does not have leading zeros.

Add any other context or screenshots about the proposal request here.

I'm interested in contributing to this repository as part of Hacktoberfest and would love the opportunity to work on this issue. @Kushal997-das Could you please assign it to me?

[github-actions]

@janWICKEDpro

It's great having you contribute to this project

Thanks for opening this Issue 🙌 , Welcome to SkillShow 💖 We will review everything and get back to you.
Make sure to give a star to this repo before making a fork! Thank you :)

[github-actions]

Hi @janWICKEDpro 👋, your issue #20 has been successfully closed ✅. Thank you for your valuable contribution! 🙌