Skip to content

Commit 358674d

Browse files
gouthampradhangouthampradhan
committed
Code refactor
1 parent d880835 commit 358674d

94 files changed

Lines changed: 1414 additions & 382 deletions

File tree

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

‎problems/src/BTfromPreorder.java‎

Lines changed: 0 additions & 43 deletions
This file was deleted.

‎problems/src/GrayCode.java‎

Lines changed: 0 additions & 27 deletions
This file was deleted.

‎problems/src/LowestCommonAncestor.java‎

Lines changed: 0 additions & 29 deletions
This file was deleted.

‎problems/src/MedianOfTwoSortedArrays.java‎

Lines changed: 0 additions & 53 deletions
This file was deleted.

‎problems/src/Minesweeper.java‎

Lines changed: 0 additions & 67 deletions
This file was deleted.

‎problems/src/Test.java‎

Lines changed: 0 additions & 69 deletions
This file was deleted.

problems/src/PascalsTriangle.java renamed to problems/src/array/PascalsTriangle.java

Lines changed: 10 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,19 @@
1+
package array;
2+
13
import java.util.ArrayList;
24
import java.util.Arrays;
35
import java.util.List;
46

57
/**
68
* Created by gouthamvidyapradhan on 25/03/2017.
7-
* Accepted
9+
*
10+
* Given an index k, return the kth row of the Pascal's triangle.
11+
12+
For example, given k = 3,
13+
Return [1,3,3,1].
14+
15+
Note:
16+
Could you optimize your algorithm to use only O(k) extra space?
817
*/
918
public class PascalsTriangle
1019
{

‎problems/src/array/ProductOfArrayExceptSelf.java‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
package array;
2+
3+
/**
4+
Created by gouthamvidyapradhan on 04/05/2017.
5+
6+
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
7+
8+
Solve it without division and in O(n).
9+
10+
For example, given [1,2,3,4], return [24,12,8,6].
11+
12+
Follow up:
13+
Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)
14+
*/
15+
16+
public class ProductOfArrayExceptSelf
17+
{
18+
public static void main(String[] args)
19+
{
20+
int[] nums = {1,2,3,4};
21+
int[] result = new ProductOfArrayExceptSelf().productExceptSelf(nums);
22+
for (int r : result)
23+
System.out.print(r + " ");
24+
}
25+
26+
public int[] productExceptSelf(int[] nums)
27+
{
28+
int[] result = new int[nums.length];
29+
for(int i = 0, temp = 1, l = nums.length; i < l; i++)
30+
{
31+
result[i] = temp;
32+
temp *= nums[i];
33+
}
34+
for(int i = nums.length - 1, temp = 1; i >= 0; i--)
35+
{
36+
result[i] = result[i] * temp;
37+
temp *= nums[i];
38+
}
39+
return result;
40+
}
41+
42+
}

problems/src/RotateMatrix.java renamed to problems/src/array/RotateMatrix.java

Lines changed: 8 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,13 @@
1+
package array;
2+
13
/**
24
* Created by gouthamvidyapradhan on 21/03/2017.
3-
* Accepted
5+
* You are given an n x n 2D matrix representing an image.
6+
7+
Rotate the image by 90 degrees (clockwise).
8+
9+
Follow up:
10+
Could you do this in-place?
411
*/
512
public class RotateMatrix
613
{

problems/src/SetMatrixZeroes.java renamed to problems/src/array/SetMatrixZeroes.java

Lines changed: 11 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,19 @@
1+
package array;
2+
13
import java.util.HashSet;
24
import java.util.Set;
35

46
/**
57
* Created by pradhang on 3/28/2017.
6-
* Accepted
8+
* Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
9+
10+
click to show follow up.
11+
12+
Follow up:
13+
Did you use extra space?
14+
A straight forward solution using O(mn) space is probably a bad idea.
15+
A simple improvement uses O(m + n) space, but still not the best solution.
16+
Could you devise a constant space solution?
717
*/
818
public class SetMatrixZeroes
919
{

0 commit comments

Comments
 (0)