There's an interesting problem I recently solved on leetcode based on dynamic programming. My Github repository contains list of all problems that I have solved.Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array.1 ..
Merge two sorted linked lists and return it as a new list.1. The new list should be made by splicing together the nodes of the first two lists.It's an easy problem in Leetcode for practicing linked list. It's similar to the merge step of the Merge sort. ..