Sun 12 Sep 2021
### Maximum Subarray

^{1}
..

Tue 08 Jan 2019### Merge Two Sorted Lists

Tue 13 Nov 2018### Three Sum Problem

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.Continue reading → programming leetcode code dp

Tue 08 Jan 2019

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.

Continue reading → programming leetcode code

Tue 13 Nov 2018

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.^{1}
..

Continue reading → programming leetcode code