Leetcode

Leetcode copied to clipboard

mkraghav

mkraghav

mkraghav

mkraghav

SysSn13

mkraghav

#322 has the incorrect answer

1

It is the solution for #518 which is the same coin change question but requires a different answer for minimum required vs number of combinations. Comment also links to #518.

jimsmithm3

Another Solution for leetcode java 1217

1

class Solution { public int minCostToMoveChips(int[] position) { int even = 0; int odd = 0; for(int i : position) { if(i % 2 == 0) even++; else odd++; }...

Aiyaret-Sandhu

ashmichheda

Nedzhin