Henry Saputra hsaputra

hsaputra / gist:a5252cc0f37537bc78565a5161fd884b

Created October 6, 2018 05:40

Minimum Path Sum - https://leetcode.com/problems/minimum-path-sum/description/

	class Solution {
	public int minPathSum(int[][] grid) {
	if (grid == null \|\| grid.length == 0 \|\| grid[0].length == 0) {
	return 0;
	}

	final int rows = grid.length;
	final int cols = grid[0].length;
	int[][] visited = new int[rows][cols];

hsaputra / gist:b16d322aaa6237c409770dddfd4f6cb2

Last active October 8, 2018 06:40

Merge k-way - https://leetcode.com/problems/merge-k-sorted-lists/description/

	/**
	* Definition for singly-linked list.
	* public class ListNode {
	* int val;
	* ListNode next;
	* ListNode(int x) { val = x; }
	* }
	*/
	class Solution {
	public ListNode mergeKLists(ListNode[] lists) {

hsaputra / gist:6ab49c77d140b84cc81ca4c34f4a306b

Created October 10, 2018 23:57

Combination Sum - https://leetcode.com/problems/combination-sum/description/

	class Solution {
	public List<List<Integer>> combinationSum(int[] candidates, int target) {
	if (candidates == null \|\| candidates.length == 0) {
	return new LinkedList<List<Integer>>();
	}

	List<List<Integer>> results = new LinkedList<>();
	List<Integer> prefix = new LinkedList<>();

	recurseSum(results, prefix, 0, candidates, target);

hsaputra / gist:a591b7347043d3ea1a51278600d367dc

Created October 27, 2018 05:26

Leetcode 109 Convert Sorted List to Binary Search Tree

	/**
	* Definition for singly-linked list.
	* public class ListNode {
	* int val;
	* ListNode next;
	* ListNode(int x) { val = x; }
	* }
	*/
	/**
	* Definition for a binary tree node.

hsaputra / gist:c8e142b5cacb4efb5bd1b34cc7acc50d

Created November 1, 2018 18:45

Convert Binary Search Tree to Sorted Doubly Linked List

	/*
	// Definition for a Node.
	class Node {
	public int val;
	public Node left;
	public Node right;

	public Node() {}

	public Node(int _val,Node _left,Node _right) {

hsaputra / gist:d2cc3a1fbe8cbb106b0d98679272d8c3

Last active November 10, 2018 17:41

33. Search in Rotated Sorted Array

	class Solution {
	// [4,5,6,7,0,1,2,3]
	// [6,7,0,1,2,3,4,5]
	public int search(int[] nums, int target) {
	if (nums == null \|\| nums.length == 0) {
	return -1;
	}

	final int numsLen = nums.length;

hsaputra / gist:668ceb02684ec052231b7030b5947412

Created November 8, 2018 22:33

621. Task Scheduler - https://leetcode.com/problems/task-scheduler/

	class Solution {
	public int leastInterval(char[] tasks, int n) {
	if (n < 0 ) {
	return 0;
	}

	// Group tasks
	int[] count = new int[26];
	for (char cur : tasks) {
	int pos = cur - 'A';

hsaputra / gist:9fea5013eab51d45d04aafc050bc8ff8

Created November 9, 2018 06:05

238. Product of Array Except Self - https://leetcode.com/problems/product-of-array-except-self/description/

	class Solution {
	public int[] productExceptSelf(int[] nums) {
	int[] results = new int[nums.length];

	int[] left = new int[nums.length];
	Arrays.fill(left, 1);

	// [1, 2, 3, 4]
	// [1, 1, 2, 6]
	for (int i = 1; i < nums.length; i++) {

hsaputra / gist:ec320d493bcc18ea67d2d4efd8dbdd6b

Created November 9, 2018 22:39

hsaputra / gist:f876ad5790c9b9162cc572f57af8c340

Created November 13, 2018 06:49

Meeting Rooms II - https://leetcode.com/problems/meeting-rooms-ii/description/

	/**
	* Definition for an interval.
	* public class Interval {
	* int start;
	* int end;
	* Interval() { start = 0; end = 0; }
	* Interval(int s, int e) { start = s; end = e; }
	* }
	*/
	class Solution {