초보 개발자의 기록

Sort Colors problemStatementGiven an array, colors, which contains a combination of the following three elements:0 (representing red)1 (representing white)2 (representing blue)Sort the array in place so that the elements of the same color are adjacent, with the colors in the order of red, white, and blue. To improve your problem-solving skills, do not utilize the built-in sort function.Constrain..

Remove Nth Node from End of List ProblemStatementGiven a singly linked list, remove the n^th node from the end of the list and return its head.ConstraintsThe number of nodes in the list is k.1≤1≤ k ≤10^3−10^3≤ Node.data ≤10^31≤ n ≤ kApproaches1. Set two pointers, right and left, at the head of the linked list.2. Move the right pointer n steps forward.3. Move both the right and left pointers forw..

3Sum ProblemStatementGiven an integer array nums, find and return all unique triplets [nums[i], nums[j], nums[k]], where the indexes satisfy i≠j, i≠k, and j≠k, and the sum of the elements nums[i] + nums[j] + nums[k] == 0.Constraints3≤ nums.length ≤500−10^3≤ nums[i] ≤10^3Approaches* All numbers in the array are positive, so it is impossible to find any combination of three numbers that addes up t..

Valid Palindrome ProblemStatementWrite a function that takes a string, s, as an input and determines whether or not it is a palindrome. Constraints1≤1≤ s.length ≤2×10^5≤2×10^5The string s will not contain any white space and will only consist of ASCII characters(digits and letters).문자열 s의 길이가 최소 1에서 최대 200000까지 가능.문자열의 길이는 최소 1 이상이므로, 빈 문자열은 들어올 수 없음200,000까지 가능하므로, 시간 복잡도가 너무 크면 성능이 떨어질 수 있음O(n..

Two pointersVersatile techinique used in problem-solving to efficiently traverse or manipulate sequential data structures, such as arrays or linked lists.It involves maintaining two pointers that traverse the data structure in a coordinated manner, typically starting from different positions or moving in opposite directions. These pointers dynamically adjust based on specitic conditions or crite..