컴퓨터공학

개발자가 되는 방법!! 코딩세끼 릿코드 스터디 지금 시작합니다 [안내영상]

코딩테스트 및 인터뷰, 면접을 준비하기 위한 첫 영상!!! 리트코드 스터디 영상을 시청하시기 전에 꼭 봐야할 가이드 영상입니다. 앞으로 어떻게 스터디를 진행하는지에 대한 설명이 있으니 꼭 시청바랍니다. 좋아요, 구독, 댓글, 알람설정 부탁드려요! https://youtu.be/wAS-RgtvC44

릿코드가 도대체 뭐야? 개발자가 되고 싶으면 뭐 부터 공부해야하지? 무조건 공부해야하는 코딩 테스트 준비!!

리트코드(릿코드, leetcode) 공부를 처음 시작하는 분들께 필요한 영상입니다. 어떻게 공부를 시작해야하는지 모르시는 분들, 릿코드 웹사이트에 어떤 서비스가 있는지 모르시는 분들을 위해 준비했습니다. https://youtu.be/SJ1xbxaZhqs - YouTube www.youtube.com

[LeetCode] 100 Same Tree [Easy] 같은 트리

100. Same Tree Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. Example 1: Input: p = [1,2,3], q = [1,2,3] Output: true Example 2: Input: p = [1,2], q = [1,null,2] Output: false Example 3: Input: p = [1,2,1], q = [1,1,2] Output: false ..

206 Reverse Linked List [LeetCode]

206 Reverse Linked List Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input: head = [1,2] Output: [2,1] Example 3: Input: head = [] Output: [] Constraints: The number of nodes in the list is the range [0, 5000]. -5000

[LeetCode] 280. Wiggle Sort

280. Wiggle Sort Medium Given an integer array nums, reorder it such that nums[0] = nums[2]

[LeetCode] 1523. Count Odd Numbers in an Interval Range

1523. Count Odd Numbers in an Interval Range Easy Given two non-negative integers low and high. Return the count of odd numbers between low and high (inclusive). Example 1: Input: low = 3, high = 7 Output: 3 Explanation: The odd numbers between 3 and 7 are [3,5,7]. Example 2: Input: low = 8, high = 10 Output: 1 Explanation: The odd numbers between 8 and 10 are [9]. Constraints: 0

[LeetCode] 2477. Minimum Fuel Cost to Report to the Capital

2477. Minimum Fuel Cost to Report to the Capital Medium There is a tree (i.e., a connected, undirected graph with no cycles) structure country network consisting of n cities numbered from 0 to n - 1 and exactly n - 1 roads. The capital city is city 0. You are given a 2D integer array roads where roads[i] = [ai, bi] denotes that there exists a bidirectional road connecting cities ai and bi. There..

[LeetCode] 567. Permutation in String

567. Permutation in String Medium Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1's permutations is the substring of s2. Example 1: Input: s1 = "ab", s2 = "eidbaooo" Output: true Explanation: s2 contains one permutation of s1 ("ba"). Example 2: Input: s1 = "ab", s2 = "eidboaoo" Output: false Constraints: 1 ..