[C++] Leetcode 104. Maximum Depth of Binary Tree (Hint, Solution)

Problem https://leetcode.com/problems/maximum-depth-of-binary-tree/ 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 Hint Try using recursi..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 5. 19.
• textsms

[C++] Leetcode 424. Longest Repeating Character Replacement (Hint, Solution)

Problem https://leetcode.com/problems/longest-repeating-character-replacement/ Longest Repeating Character Replacement - LeetCode Can you solve this real interview question? Longest Repeating Character Replacement - You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operati leetcode.co..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 5. 18.
• textsms

[C++] Leetcode 57. Insert Interval (Hint, Solution)

Problem https://leetcode.com/problems/insert-interval/ Insert Interval - LeetCode Can you solve this real interview question? Insert Interval - You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order b leetcode.com Hint Solution Code Simple class Solution { pub..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 4. 27.
• textsms

[C++] Leetcode 3. Longest Substring Without Repeating Characters (Hint, Solution, Time and Space Complexity)

Problem https://leetcode.com/problems/longest-substring-without-repeating-characters/

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 4. 21.
• textsms

[C++] Leetcode 23. Merge k Sorted Lists (Hint, Solution)

Problem https://leetcode.com/problems/merge-k-sorted-lists Merge k Sorted Lists - LeetCode Can you solve this real interview question? Merge k Sorted Lists - You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. Example 1: Input: lis leetcode.com You are given an array of k linked-lists..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 4. 19.
• textsms

[C++] Leetcode 73. Set Matrix Zeroes (Hint, Solution)

Problem https://leetcode.com/problems/set-matrix-zeroes Set Matrix Zeroes - LeetCode Can you solve this real interview question? Set Matrix Zeroes - Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place [https://en.wikipedia.org/wiki/In-place_algorithm]. Example 1: [https leetcode.com Given an m x n integer matrix matrix, if an el..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 4. 7.
• textsms

[C++] Leetcode 322. Coin Change (Hint, Solution)

Problem https://leetcode.com/problems/coin-change Coin Change - LeetCode Can you solve this real interview question? Coin Change - You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make leetcode.com You are given an integer array coins representing coins..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 3. 30.
• textsms

[C++] Leetcode 70. Climbing Stairs (Hint, Solution)

Problem https://leetcode.com/problems/climbing-stairs/ Climbing Stairs - LeetCode Can you solve this real interview question? Climbing Stairs - You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Outpu leetcode.com You are climbing a staircase. It takes n steps to..

• format_list_bulleted 알고리즘 문제/Leetcode
• · 2023. 3. 29.
• textsms