soicem's note

Software testing 관련 논문을 아침마다 시간정해놓고 읽으면 좋을듯 + ML

1. Algorithm ~2021년 11월 Leetcode 600문제, daily challenge + weekly contest ~2021년 12월 Leetcode 700문제, daily challenge + weekly contest ~2022 01~06월 (양치기 x, 풀었던 문제 복습 및 연관문제 풀이) My List, Get Well Prepared for Google Interview 복습 (별표 문제 및 중요문제) - 해당 문제 체화 및 연관문제 풀이 daily challenge + weekly content TAG: data stream, union find 마스터링

문제: https://leetcode.com/problems/iterator-for-combination/ Iterator for Combination - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class CombinationIterator { public: int n; int k; vector combinations; void backtrack(string& characters, int pos, string s, int k){ int n = charac..

문제: https://leetcode.com/problems/daily-temperatures/ Daily Temperatures - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 현재 날짜의 기온보다 높은 기온이 나오는 날짜의 차를 각각 구하는 문제다. class Solution { public: vector dailyTemperatures(vector& temperatures) { int n = temperatures.size(); vector ans(n, ..

문제: https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/ Number of Valid Words for Each Puzzle - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public: vector findNumOfValidWords(vector& words, vector& puzzles) { unordered_map wordCount; for(int i ..

https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/ Minimum Cost to Make at Least One Valid Path in a Grid - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public: vector directions = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; int dp[101..

https://leetcode.com/problems/smallest-string-with-swaps/ Smallest String With Swaps - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문자열에서 주어진 pair에 들어있는 index들을 스왑하는데, 해당 경우의 수 중 lexiographically하게 가장 작은 문자열을 구하는 문제다. class Solution { public: vector indices; string indiceStr; ve..

문제: https://leetcode.com/problems/count-good-meals/ Count Good Meals - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com deliciousness의 값 중 두 개를 더했을 때 2의 n승의 값이 되는지 판별하는 문제다. class Solution { public: int countPairs(vector& deliciousness) { int mod = 1000000000 + 7; vector twosPower; ..

문제: https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/ Check if Array Is Sorted and Rotated - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 정렬된 배열이 rotate되어있으면 true, 그렇지 않다면 false를 출력하는 문제다. 정렬이 되어있으면 nums[i] nums[(i + 1) % n]){ cnt++; } } return cnt > 1 ? false ..

문제: https://leetcode.com/problems/minimum-cost-for-tickets/ Minimum Cost For Tickets - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 주어진 days에 train 여행을 할 수 있는 티켓을 사는 경우 중 가장 작은 가격의 합을 구하는 문제다. 중요 포인트는 1일, 7일, 30일에 대한 티켓이 있고 이를 days에 있는 날들을 사용해서 푸는 것이다. 흠... class Solution { publ..