Welcome to Day 35 of the DSA Coding Challenge:

Todays Goals(Linked Lists):

Question 1:find duplicate number-Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and uses only constant extra space.

Question 2:Add 2 numbers-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. 0<=Node value<=9

All the best!