October 2014 – Program Creek

LeetCode – Maximum Size Subarray Sum Equals k (Java)

May 14, 2019October 27, 2014 by ProgramCreek

Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn’t one, return 0 instead. Note: The sum of the entire nums array is guaranteed to fit within the 32-bit signed integer range. Example 1: Given nums = [1, -1, 5, -2, 3], … Read more

LeetCode – Sparse Matrix Multiplication (Java)

March 5, 2018October 26, 2014 by ProgramCreek

Given two sparse matrices A and B, return the result of AB. You may assume that A’s column number is equal to B’s row number. 1. Naive Method We can implement Sum(A_ik * B_kj) -> C_ij as a naive solution. public int[][] multiply(int[][] A, int[][] B) { //validity check int[][] C = new int[A.length][B[0].length]; … Read more