It's one of the most popular questions on leetcode that seems very easy at first. Coin change is a classic dynamic programming problem. I will proceed with an obvious (albeit wrong) solution and subsequently proceed to an efficient correct solution.
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1. You may assume that you have an infinite number of each kind of coin...Continue reading → programming leetcode code dp java python
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. I often start with a brute force approach without fretting about time complexity. Later I try to improve my algorithm for a better efficient solution.
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 ..Continue reading → programming leetcode code dp
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. ..Continue reading → programming leetcode code
Continue reading → programming leetcode code