Algorithm (2139) 썸네일형 리스트형 (C++) - LeetCode (easy) 1037. Valid Boomerang https://leetcode.com/problems/valid-boomerang/description/ Valid Boomerang - LeetCode Can you solve this real interview question? Valid Boomerang - Given an array points where points[i] = [xi, yi] represents a point on the X-Y plane, return true if these points are a boomerang. A boomerang is a set of three points that are all distinct and leetcode.com 직선의 기울기를 이용한 문제였습니다. 📕 풀이방법 📔 풀이과정 📕 Code 📔.. (C++) - LeetCode (easy) 1030. Matrix Cells in Distance Order https://leetcode.com/problems/matrix-cells-in-distance-order/description/ Matrix Cells in Distance Order - LeetCode Can you solve this real interview question? Matrix Cells in Distance Order - You are given four integers row, cols, rCenter, and cCenter. There is a rows x cols matrix and you are on the cell with the coordinates (rCenter, cCenter). Return the coordinates leetcode.com bfs 문제였습니다. 📕.. (C++) - LeetCode (easy) 1025. Divisor Game https://leetcode.com/problems/divisor-game/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 구현 문제였습니다. 📕 풀이방법 📔 풀이과정 0 < x < n 며 n의 인수 x 중에서 최적으로 정답을 고르는 경우는 1을 고르는 것입니다.서로 1을 고르게 된다면 최종적으로 1이 남으면 그 사람이 지므로 짝수인 .. (C++) - LeetCode (easy) 1021. Remove Outermost Parentheses https://leetcode.com/problems/remove-outermost-parentheses/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 간단 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 정답 변수 ans, 깊이 depth를 선언해줍니다. 📔 풀이과정 valid한 형태의 문자열이 들어오므로 s의 원소를 순회하며 바.. (C++, Rust) - LeetCode (easy) 1013. Partition Array Into Three Parts With Equal Sum https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 자료구조 순회 문제였습니다. 📕 풀이방법 📔 풀이과정 트리를 직선형태로 순회하며 그 직선 형태의 길별로 값을 더하는 형태이므로 dfs형식으로 순회하는 것이 구현에 편리합니다... (C++) - LeetCode (easy) 1018. Binary Prefix Divisible By 5 https://leetcode.com/problems/binary-prefix-divisible-by-5/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 정답 ans와 현황 cur를 선언해준 후 적절히 초기화해줍니다. 📔 풀이과정 nums의 길이가 10^5(10만)이므로 매번 전체 십진.. (C++, Rust) - LeetCode (easy) 1013. Partition Array Into Three Parts With Equal Sum https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/ LeetCode - The World's Leading Online Programming Learning Platform 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 간단 구현 문제였습니다. 📕 풀이방법 📔 풀이과정 1. 3등분으로 나눠지며 각 부분들은 전체 원소 합 / 3이 되어야 함을 생각하면 편합니다. 또한 부분들이 3등분을 초과하.. (C++, Rust) - LeetCode (easy) 1009. Complement of Base 10 Integer https://leetcode.com/problems/complement-of-base-10-integer/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 bit masking으로 해결한 문제였습니다. 📕 풀이방법 📔 풀이과정 n을 인자로 n의 bit를 반전하는 함수 get bit mask를 수행합니다. 이 함수는 n보다 크거나 작으며 .. 이전 1 ··· 58 59 60 61 62 63 64 ··· 268 다음
