2.5 - Sum Lists - C/Cpp and OS

Search…

Templates and methods

Linked List with C

Linked List with C++

Graphs with C/C++

Trees with C/C++

DS with C

Reverse Linked List

Implement Queue with LL

Find mid of LL without traverse

Delete a Node from LL

Create a Binary search tree

String and Array

implement strcmp in C

Maximum Subarray

CTCI

Ch 01 - Arrays and Strings

Ch 02 - Linked List

2.1 - Remove Duplicates

2.2 - Return Kth to Last

2.3 - Delete Middle Node

2.4 - Partition

2.5 - Sum Lists

2.6 - Palindrome

2.7 - Intersection

2.8 - Loop Detection

16.25 - LRU Cache

Algorithm

Basic Concept in C

Understand about pointer

Pre/Post Increment Operator

string and constant charaters

buffer overflow

Short-circuit evaluation

Allocate memory for 2D array dynamically

OS review

Reference

Question Collecting:

Template on Linux

Powered By GitBook

2.5 - Sum Lists

You have two numbers represented by a linked list, where each node contains a single digit.
The digits are stored in reverse order, such that the 1's digit is at the head of the list.
Write a function that adds the two numbers and returns the sum as a linked list.

EXAMPLE

Input: (7-> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 295.
Output: 2 -> 1 -> 9. That is, 912.

FOLLOW UP
Suppose the digits are stored in forward order. Repeat the above problem.

EXAMPLE
Input: (6 -> 1 -> 7) + (2 -> 9 -> 5).That is, 617 + 295.
Output: 9 -> 1 -> 2. That is, 912.

2.4 - Partition

2.6 - Palindrome

Last modified 5mo ago

Copy link