LeetCode

[리트코드] 6. ZigZag Conversion / Javascript

문제주소 : https://leetcode.com/problems/zigzag-conversion/ ZigZag Conversion - 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 더보기 The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for ..

[리트코드] 142. Linked List Cycle II / Javascript

문제주소 :https://leetcode.com/problems/linked-list-cycle-ii/ Linked List Cycle 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 더보기 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some no..

[리트코드] 141. Linked List Cycle / Javascript

문제주소 :https://leetcode.com/problems/linked-list-cycle/ Linked List Cycle - 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 더보기 Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list ..

[리트코드] 139. Word Break / Javascript

문제주소 :https://leetcode.com/problems/word-break/ Word Break - 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 더보기 Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the s..

[리트코드] 42. Trapping Rain Water / Javascript

문제주소 :https://leetcode.com/problems/trapping-rain-water/ Trapping Rain Water - 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 더보기 Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example..