shinjjang ShinJJang

🎯

Focusing

Slack(adjective) developer

ShinJJang / minimum-swaps-2.java

Created January 29, 2020 07:04

	static int minimumSwaps(int[] arr) {
	if (arr.length == 1) {
	return 0;
	}

	int swapCount = 0;
	int temp;
	for (int i = 1; i <= arr.length; i++) {
	if (i != arr[i-1]) {
	temp = arr[i-1];

ShinJJang / fish.java

Created January 11, 2020 06:53

https://app.codility.com/demo/results/trainingRDQ5FR-JJ4/

	// you can also use imports, for example:
	import java.util.*;

	// you can write to stdout for debugging purposes, e.g.
	// System.out.println("this is a debug message");

	class Solution {
	public int solution(int[] A, int[] B) {
	ArrayList<Integer> up_sizes = new ArrayList<>();
	int lives = 0;

ShinJJang / FrogRiverOne.java

Created January 10, 2020 14:14

https://app.codility.com/demo/results/trainingM5ZZT2-YBK/

	class Solution {
	public int solution(int X, int[] A) {
	// write your code in Java SE 8
	boolean[] checkArray = new boolean[X];

	for(int i=0; i<A.length; i++) {
	boolean is_leave = checkArray[A[i] - 1];
	if (is_leave == false) {
	checkArray[A[i]- 1] = true;
	X -= 1;

ShinJJang / tape_equilibrium.py

Created January 10, 2020 13:30

https://app.codility.com/demo/results/training89YXMA-C7G/

ShinJJang / perm_missing_elem.py

Created January 10, 2020 09:42

https://app.codility.com/demo/results/training2GAW7M-7CM/

	def solution(A):
	check_list = [False] * (len(A) + 1)

	for i in A:
	check_list[i-1] = True

	for idx, j in enumerate(check_list):
	if not j:
	return idx + 1

ShinJJang / odd_occurrences_in_array.py

Created January 10, 2020 09:30

https://app.codility.com/demo/results/trainingYCRGUG-WG3/

	def solution(A):
	check_dict = {}
	for i in A:
	is_unpaired = check_dict.get(i, False)
	if is_unpaired:
	del check_dict[i]
	else:
	check_dict[i] = True

	return list(check_dict.keys())[0]

ShinJJang / cyclic_rotation.py

Created January 10, 2020 09:18

https://app.codility.com/demo/results/training52UK9S-AQG/

	from collections import deque

	def solution(A, K):
	d = deque(A)
	d.rotate(K)
	return list(d)

ShinJJang / missing_integer.py

Created January 10, 2020 08:42

https://app.codility.com/demo/results/demoV7TT2S-SF7/

	def solution(A):
	min_value = 1000000
	missing_list = [True] * 1000000

	for num in A:
	if num > 0:
	missing_list[num-1] = False

	for idx, is_missing in enumerate(missing_list):
	if is_missing:

ShinJJang / binary_gap.py

Created January 10, 2020 08:41

https://app.codility.com/demo/results/trainingEZPSHD-KKN/

	def solution(N):
	max_length = 0
	length = 0
	quotient = N
	remainder = 0
	is_occur_one = False
	while quotient > 0:
	quotient, remainder = divmod(quotient, 2)
	if is_occur_one:
	if remainder == 1:

ShinJJang / 기능개발.py

Created January 4, 2020 08:20

https://programmers.co.kr/learn/courses/30/lessons/42586

	import math

	def solution(progresses, speeds):
	days = []
	for idx in range(len(progresses)):
	day = math.ceil((100 - progresses[idx]) / speeds[idx])
	days.append(day)


	result = []