걸스인텍 정다은

Algorithm문제풀이: LeetCode의 “141. Linked List Cycle” 🧑‍🚀문제링크: https://leetcode.com/problems/linked-list-cycle/ Given head, the head of a linked list, determine if the linked list has a cycle in it. T...... 더 보기

Algorithm문제풀이: LeetCode의 “234. Palindrome Linked List” 🧑‍🚀문제링크: https://leetcode.com/problems/palindrome-linked-list/ Given the head of a singly linked list, return true if it is a palindrome or f...... 더 보기

Algorithm문제풀이: LeetCode의 “102. Binary Tree Level Order Traversal” 🧑‍🚀문제링크: https://leetcode.com/problems/binary-tree-level-order-traversal/ Given the root of a binary tree, return the level order ...... 더 보기

Algorithm문제풀이: LeetCode의 “​​108. Convert Sorted Array to Binary Search Tree” 🧑‍🚀문제링크: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ Given an integer array nums where th...... 더 보기

Algorithm문제풀이: LeetCode의 “​​461. Hamming Distance” 🧑‍🚀문제링크: https://leetcode.com/problems/hamming-distance/ The Hamming distance between two integers is the number of positions at which the corres...... 더 보기

Algorithm문제풀이: LeetCode의 “53. Maximum Subarray” 🧑‍🚀문제링크: https://leetcode.com/problems/maximum-subarray/ Given an integer array nums, find the contiguous subarray (containing at least one number) ...... 더 보기

Algorithm문제풀이: LeetCode의 “48. Rotate Image” 🧑‍🚀문제링크: https://leetcode.com/problems/rotate-image/ You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise)....... 더 보기

Algorithm문제풀이: LeetCode의 “118. Pascal's Triangle” 🧑‍🚀문제링크: https://leetcode.com/problems/pascals-triangle/ Given an integer numRows, return the first numRows of Pascal's triangle. In Pascal's tria...... 더 보기

Algorithm문제풀이: LeetCode의 “278. First Bad Version” 🧑‍🚀문제링크: https://leetcode.com/problems/first-bad-version/ You are a product manager and currently leading a team to develop a new product. Unfortu...... 더 보기

Algorithm문제풀이: LeetCode의 “217. Contains Duplicate” 🧑‍🚀문제링크: https://leetcode.com/problems/contains-duplicate/ Given an integer array nums, return true if any value appears at least twice in the a...... 더 보기

Algorithm문제풀이: LeetCode의 “13. Roman to Integer” 🧑‍🚀문제링크: https://leetcode.com/problems/roman-to-integer/ Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol ...... 더 보기

Algorithm문제풀이: LeetCode의 “14. Longest Common Prefix” 🧑‍🚀문제링크: https://leetcode.com/problems/longest-common-prefix/ Write a function to find the longest common prefix string amongst an array of st...... 더 보기

Algorithm문제풀이: LeetCode의 “122. Best Time to Buy and Sell Stock II” 🧑‍🚀문제링크: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ You are given an integer array prices where prices[i] ...... 더 보기

Algorithm문제풀이: LeetCode의 “19. Remove Nth Node From End of List” 🧑‍🚀문제링크: https://leetcode.com/problems/remove-nth-node-from-end-of-list/ Given the head of a linked list, remove the nth node from t...... 더 보기

Algorithm문제풀이: LeetCode의 “283. Move Zeroes” 🧑‍🚀문제링크: https://leetcode.com/problems/move-zeroes/ Given an integer array nums, move all 0's to the end of it while maintaining the relative order of t...... 더 보기

Algorithm문제풀이: LeetCode의 “26. Remove Duplicates from Sorted Array” 🧑‍🚀문제링크: https://leetcode.com/problems/remove-duplicates-from-sorted-array/ Given an integer array nums sorted in non-decreasing ...... 더 보기

Algorithm문제풀이: “2021 카카오 블라인드 테스트 - 신규 아이디 추천” 🧑‍🚀문제링크: https://school.programmers.co.kr/learn/courses/30/lessons/72410?language=javascript Description 카카오에 입사한 신입 개발자 네오는 "카카오계정개발팀"에 배치되어, 카카오 서비...... 더 보기

Algorithm문제풀이: LeetCode의 “190. Reverse Bits” 🧑‍🚀문제링크: https://leetcode.com/problems/reverse-bits/ Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java,...... 더 보기

Algorithm문제풀이: LeetCode의 “36. Valid Sudoku” 🧑‍🚀문제링크: https://leetcode.com/problems/valid-sudoku/ Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to...... 더 보기

Algorithm문제풀이: LeetCode의 “268. Missing Number” 🧑‍🚀문제링크: https://leetcode.com/problems/missing-number/ Given an array nums containing n distinct numbers in the range [0, n], return the only number ...... 더 보기