공대생 공부노트(Notes for Engineering Studies)

https://leetcode.com/problems/sum-of-two-integers/ Sum of Two Integers - 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 (Sum of Two Integers 문제는 위 링크에서 풀어보실 수 있습니다.) Sum of Two Integers 문제는 다음과 같다. Given two integers a and b, return the sum of the two..

https://leetcode.com/problems/missing-number/ Missing Number - 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 (Missing Number 문제는 위 링크에서 풀어보실 수 있습니다.) Missing Number 문제는 다음과 같다. Given an array nums containing n distinct numbers in the range [0, n], return ..

https://leetcode.com/problems/reverse-bits/ Reverse Bits - 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 (Reverse Bits 문제는 위 링크에서 풀어보실 수 있습니다.) Reverse Bits 문제는 다음과 같다. Reverse bits of a given 32 bits unsigned integer. 부호가 없는 32비트 정수를 입력받아 비트의 순서를 뒤집어 리턴하여라..

https://leetcode.com/problems/number-of-1-bits Number of 1 Bits - 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 (Number of 1 Bits 문제는 위 링크에서 풀어보실 수 있습니다.) Number of 1 Bits 문제는 다음과 같다. Write a function that takes an unsigned integer and returns the numbe..

https://leetcode.com/problems/counting-bits/ Counting Bits - 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 (Counting Bits 문제는 위 링크에서 풀어보실 수 있습니다.) Counting Bits 문제는 다음과 같다. Given an integer n, return an array ans of length n+1 such that for each i (0