tiagopereira17

public class BinaryGap {
	
	public int solution(int N) {
		int max = 0;
		int counter = 0;
		boolean isCounting = false;
		
		while(N > 0) {
			if((N & 1) == 1) {
				if(isCounting) {

tiagopereira17

public class CyclicRotation {
	
	public int[] rotate(int[] A, int K) {
		if(A == null || A.length == 0) {
			return new int[0];
		}
		
		int length = A.length;
		
		if(K > length) {

tiagopereira17

public class OddOccurrencesInArray {
	public int solution(int[] A) {
		if(A == null || A.length == 0) {
			return 0;
		}
		
		if(A.length == 1) {
			return A[0];
		}
		

tiagopereira17

public class FrogJump {
	public int countJumps(int X, int Y, int D) {
		if(X > Y) {
			return 0;
		}
		
		return (int) Math.ceil((Y - X) / (double) D);
	}
}

tiagopereira17

public class TapeEquilibrium {
	
	public int solution(int[] A) {
		int start = A[0];
		int end = sum(A) - start;
		int minDif = Math.abs(start - end);
		
		for(int i = 1; i < A.length - 1; i++) {
			start += A[i];
			end -= A[i];

tiagopereira17

public class PermMissingElem {
	
	 public int findMissingElement(int[] A) {
		 if(A == null || A.length == 0) {
			 return 1;
		 }
		 
		 long N = A.length + 1;
		 long total = N * (N + 1) / 2;
		 

tiagopereira17

public class FrogRiverOne {
	public int solution(int X, int[] A) {
		if(A == null || A.length == 0) {
			return -1;
		}
		
		int[] passed = new int[X];
		for(int i = 1; i <= passed.length; i++) {
			passed[i-1] = -1;
		}

tiagopereira17

public class PermCheck {
	public int checkIfIsPermutation(int[] A) {
		if(A == null || A.length == 0) {
			return -1;
		}
		
		int[] passed = new int[A.length];
		for(int i = 0; i < passed.length; i++) {
			passed[i] = -1;
		}

tiagopereira17

public class MissingInteger {
	public int minMissingInteger(int[] A) {
		if(A == null || A.length == 0) {
			return -1;
		}
		
		int[] items = new int[A.length + 1];
		for(int i = 0; i < items.length; i++) {
			items[i] = -1;
		}

tiagopereira17

public class PassingCars {
	public int solution(int[] A) {
		// 0 - east, 1 - west
		int west = 0;
		int passing = 0;
		
		for(int i = A.length - 1; i >= 0; i--) {
			if(A[i] == 0) {
				passing += west;
				if(passing > 1000000000) {