Apes Together Strong.

https://leetcode.com/problems/maximum-depth-of-binary-tree/description Maximum Depth of Binary Tree - LeetCode Can you solve this real interview question? Maximum Depth of Binary Tree - Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf leetcode.com Q. 입력된 이진트리의 최대 dep..

https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/description Maximum Twin Sum of a Linked List - LeetCode Can you solve this real interview question? Maximum Twin Sum of a Linked List - In a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0 next; fast = fast->next->next; } // 전반부는 뒤집는다. ListNode* ri..

https://leetcode.com/problems/reverse-linked-list/description Reverse Linked List - LeetCode Can you solve this real interview question? Reverse Linked List - Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: [https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg] Input: head = [1,2,3,4,5] O leetcode.com Q. 주어진 노드를 뒤집고, 그 head를 반환하라. Solution..

https://leetcode.com/problems/odd-even-linked-list/description Odd Even Linked List - LeetCode Can you solve this real interview question? Odd Even Linked List - Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list. The first node is considered od leetcode.com Q. input list head가 주어질때, 홀수끼리먼저 ..

https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/description Delete the Middle Node of a Linked List - LeetCode Can you solve this real interview question? Delete the Middle Node of a Linked List - You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. The middle node of a linked list of size n is the ⌊n / leetcode.c..

https://leetcode.com/problems/decode-string/description Decode String - LeetCode Can you solve this real interview question? Decode String - Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is g leetcode.com Q. k[string] 꼴의 입력이 들어올때, string을 k번 출력하게 디코딩 하..

https://leetcode.com/problems/asteroid-collision/description Asteroid Collision - LeetCode Can you solve this real interview question? Asteroid Collision - We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning leetcode.com Q. input array ast에서 각 값은 운석의 크기를, 부호..

https://leetcode.com/problems/removing-stars-from-a-string/description Removing Stars From a String - LeetCode Can you solve this real interview question? Removing Stars From a String - You are given a string s, which contains stars *. In one operation, you can: * Choose a star in s. * Remove the closest non-star character to its left, as well as remove the star it leetcode.com Q. input string s..

https://leetcode.com/problems/equal-row-and-column-pairs/description Equal Row and Column Pairs - LeetCode Can you solve this real interview question? Equal Row and Column Pairs - Given a 0-indexed n x n integer matrix grid, return the number of pairs (ri, cj) such that row ri and column cj are equal. A row and column pair is considered equal if they contain th leetcode.com Q. 해당 모든 행의 값들 순서와 해당..

https://leetcode.com/problems/determine-if-two-strings-are-close/description Determine if Two Strings Are Close - LeetCode Can you solve this real interview question? Determine if Two Strings Are Close - Two strings are considered close if you can attain one from the other using the following operations: * Operation 1: Swap any two existing characters. * For example, abcde -> leetcode.com Q. 두 문..