Problem link : https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/submissions/ Count Unique Characters of All Substrings of a Given String - 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 I don't think this problem is good. Because this probl..
Problem link : https://leetcode.com/explore/interview/card/top-interview-questions-easy/93/linked-list/603/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com When we write code for adding or removing node, we have to dist..
문제 링크입니다 : https://leetcode.com/problems/longest-palindromic-substring/ Longest Palindromic Substring - 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 C++ class Solution { public: string longestPalindrome(string s) { string result = ""; int maxLength = 0; if (s.size() == 1) { retu..
문제 링크입니다 : https://leetcode.com/problems/add-two-numbers/ Add Two Numbers - 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 C++ /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(..

문제 링크입니다 : https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ Binary Tree Level Order Traversal II - 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 전형적인 트리 순회문제였습니다. 하나 특이한 점이 기존 순회는 root에서 reef 방향으로 진행하는데 이 문제에서는 reef에서 root방향으로 문제를 물어봤습니다. 그래서 기존처럼 root에서 부터 순회를..

문제 링크입니다 : https://leetcode.com/problems/binary-tree-inorder-traversal/ Binary Tree Inorder Traversal - 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 전형적인 트리 순회 문제이다. 그 중에서도 중위 순회 문제이다. C++ /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; ..

문제 링크입니다 : https://leetcode.com/problems/two-sum/ Two Sum - 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 이 문제는 두 가지 방법으로 풀 수가 있다. 첫 번째로 브루트 포스 문제로 풀 수 있는데, 정말 간단하게 모든 경우의 수를 다 돌려보면 된다. 그런데 문제에서 인풋에 대한 정보가 없고, 제한 시간에 대한 정보도 없다. 인풋이 둘 다 적당히 적다면 브루트 포스도 괜찮은 것 같다. 하지만 인풋이 조금만 커지면 총 ..