import java.util.*; class Solution { public int[] solution(int[] progresses, int[] speeds) { int[] answer = {}; int sol = 0; int flag; int[] complete = new int[progresses.length]; ArrayList temp = new ArrayList(); for(int i=0; i

import java.util.*; class Solution { int answer = 0; public int solution(int[] numbers, int target) { ArrayList temp = new ArrayList(); for(int i=0; i=v.size()){ if(sum == dest){ answer++; } return; } dfs(v,dest,sum+v.get(idx),idx+1); dfs(v,dest,sum-v.get(idx),idx+1); } }

class Solution { public int[] solution(int[] prices) { int[] answer = new int[prices.length]; for(int i=0; i

class Solution { public int[] solution(int[] heights) { int[] answer = new int[heights.length]; for(int i= heights.length-1; i>0; i--){ for(int j=i-1; j>=0; j--){ if(heights[i]

import java.util.*; class Solution { public int solution(String skill, String[] skill_trees) { int answer = 0; HashMap map = new HashMap(); for(int i=0; i

import java.util.*; class Solution { public int[] solution(int N, int[] stages) { int[] answer = new int[N]; ArrayList temp = new ArrayList(); double[] failrate = new double[N+1]; double[] copymap = new double[N+1]; for(int i=1; i