space of spadework

https://programmers.co.kr/learn/courses/30/lessons/42862 level1 def solution(n, lost, reserve): answer = 0 for i in range(1, n+1): if i in lost and i in reserve: lost.remove(i) reserve.remove(i) for i in range(1, n+1): if i not in lost: answer += 1 else: if i in reserve: answer +=1 reserve.remove(i) continue elif i-1 in reserve: answer += 1 reserve.remove(i-1) continue elif i+1 in reserve: answe..

https://www.hackerrank.com/interview/interview-preparation-kit/stacks-queues/challenges level2 #!/bin/python3 import math import os import random import re import sys # Complete the isBalanced function below. def isBalanced(s): front = ["{", "[", "("] end = ["}", "]", ")"] dict = { front[0] : end[0], front[1] : end[1], front[2] : end[2], } stack = [] for item in s: if len(stack) == 0: stack.appe..

https://www.hackerrank.com/interview/interview-preparation-kit/dictionaries-hashmaps/challenges level1 #!/bin/python3 import math import os import random import re import sys # Complete the checkMagazine function below. def checkMagazine(magazine, note): dict = {} for item in magazine: if item not in dict: dict[item] = 1 else: dict[item] += 1 for n in note: if n not in dict: return "No" else: di..

https://www.hackerrank.com/interview/interview-preparation-kit/strings/challenges 아.. 또 노가다로 푼거 같다. #!/bin/python3 import math import os import random import re import sys # Complete the isValid function below. def isValid(s): diff = {} for i in s: if i not in diff: diff[i] = 1 else: diff[i] += 1 print(diff) a = sorted([i for i in diff.values()]) l = len(a) if a[0] == a[l-1]: return "YES" elif a..

https://programmers.co.kr/learn/courses/30/lessons/42840 오.. 노가다로 풀었다. level1 def solution(answers): answer = [] n = [0,0,0] num1 = [1,2,3,4,5] * 2000 num2 = [2,1,2,3,2,4,2,5] * 1250 num3 = [3,3,1,1,2,2,4,4,5,5] * 1000 for i in range(len(answers)): ans = answers[i] if ans == num1[i]: n[0] +=1 if ans == num2[i]: n[1] +=1 if ans == num3[i]: n[2] +=1 big = sorted(n)[-1] for i in range(len(n)): if n..

https://programmers.co.kr/learn/courses/30/lessons/42626 솔직히 파이썬 아니고 heapq 구현하라고 했으면 못 풀었을 것 같다. python 내장 모듈 heapq는 min heap 이고 scoville[0]은 항상 최소값이다. level2 import heapq def solution(scoville, K): answer = 0 heapq.heapify(scoville) while scoville[0] < K: if len(scoville) < 2: return -1 one = heapq.heappop(scoville) # logN two = heapq.heappop(scoville) heapq.heappush(scoville,one+two*2) answer+..

https://programmers.co.kr/learn/courses/30/lessons/42588 level2 스택, 큐 문제인데 좀 야매로 풀었다는 느낌이 든다. def solution(heights): answer = [] while(heights): h = heights.pop() for i in range(1, len(heights)+1): if heights[-i] > h: answer.append(len(heights)+1-i) break else: answer.append(0) answer.reverse() return answer

문제를 이해하기 어렵게 만들었다. https://programmers.co.kr/learn/courses/30/lessons/42747 level2 인데 문제 이해만 잘했다면 쉬운 편이다. def solution(citations): if sum(citations) == 0: return 0 citations.sort(reverse=True) big = [] for item in citations: if item < len(big): if big[-1] < len(big): return big[-1] return len(big) else: big.append(item) return len(big)

level1은 역시 쉽다. https://programmers.co.kr/learn/courses/30/lessons/42748 def solution(array, commands): answer = [] for com in commands: temp = array[com[0]-1:com[1]] temp.sort() answer.append(temp[com[2]-1]) return answer

아ㅏㅏㅏ 모르겠다. 아무리 해도 시간초과 뜨자너 https://programmers.co.kr/learn/courses/30/lessons/42746 level2 def solution(arr): if sum(arr) == 0: return '0' answer = '' arr = list(map(str, arr)) arr = sorted(arr, sort, reverse=True) for i in range(len(arr)-1): if len(arr[i]) != len(arr[i+1]): n1 = arr[i] + arr[i+1] n2 = arr[i+1] + arr[i] if n1 >= n2: answer = answer + arr[i] else: arr[i], arr[i+1] = arr[i+1], arr..

프로그래머스 코딩테스트 문제를 풀고 있다. https://programmers.co.kr/learn/courses/30/parts/12077 level1 def solution(participant, completion): participant.sort() completion.sort() for i in range(0, len(completion)): if participant[i] != completion[i]: return participant[i] return participant[len(participant)-1] 2021.12.09 추가 Counter를 사용하면 객체간의 빼기가 가능하다. - Counter를 사용한 문제풀이 import collections def solution(particip..

프로그래머스 코딩테스트 문제를 풀고 있다. https://programmers.co.kr/learn/courses/30/parts/12077 level2 def solution(phone_book): if len(phone_book)

5가지 sort python으로 구현 SelectionSort, InsertionSort, BubbleSort, MergeSort, QuickSort #-*- coding: utf-8 -*- def selectionSort(arr): """ 시간 O(n^2) 공간 O(n) (현재위치에 값을 찾음) 정렬되지 않은 리스트를 첫번째 index에서부터 시작 해당 index값을 포함하여 그 뒤 값들과 비교하고 최소값과 위치를 바꾼다. (swap) """ for i in range(len(arr) - 1): min_idx = i for j in range(i + 1, len(arr)): if arr[j] < arr[min_idx]: min_idx = j arr[i], arr[min_idx] = arr[min_idx..

문제 : https://www.acmicpc.net/problem/1049 #include int min(int a, int b){ if(a

#include #include using namespace std; int circle[5][8]; int k; int pow(int a, int n) { int ret = 1; for (int i = 0; i num >> direct; func(num, direct); } int ret = 0; for (int i = 1; i