분류 전체보기 (20) 썸네일형 리스트형 Java Queue vs BlockingQueue & Leetcode 215. Kth Largest Element in an Array https://leetcode.com/problems/kth-largest-element-in-an-array/description/?envType=study-plan-v2&envId=top-interview-150 Kth Largest Element in an Array - LeetCode Can you solve this real interview question? Kth Largest Element in an Array - Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not .. Binary Search Tree with LeetCode https://github.com/fineman999/algorithm_java/issues/11 Binary Search Tree(BST) · Issue #11 · fineman999/algorithm_java 199. Binary Tree Right Side View 230. Kth Smallest Element in a BST github.com https://leetcode.com/problems/binary-tree-right-side-view/ Binary Tree Right Side View - LeetCode Can you solve this real interview question? Binary Tree Right Side View - Given the root of a binary t.. Hash Collision & Open Addressing - Linear Probing Hash Table https://github.com/fineman999/algorithm_java/issues/10 HashMap & Hash collision · Issue #10 · fineman999/algorithm_java github.com 1. 서론 원티드 프리온보딩 2주 차 2번째 과제로 Linear Probing 방식의 Hash Table를 구현하는 과제가 주어졌다. 해시 테이블에서는 충돌이 발생할 수 있는 데 해결 방법으로 두 가지를 나눌 수 있다. 첫 번째로 Seperate Chaing이 있다. Sepearte Chaing은 충돌이 일어나는 bucket에서 새로운 공간(overflow enties)을 연결해서 저장하는 방식으로 해시 충돌을 방지할 수 있다. 두 번째로 Open Addressing이 있다.. [@ToString, Divide and Conquer] Leetcode 148. Sort List https://leetcode.com/problems/sort-list/description/?envType=study-plan-v2&envId=top-interview-150 Sort List - LeetCode Can you solve this real interview question? Sort List - Given the head of a linked list, return the list after sorting it in ascending order. Example 1: [https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg] Input: head = [4,2,1,3] Output: [1, leetcode.com https://git.. [Stack + Swith Expression] 150. Evaluate Reverse Polish Notation https://leetcode.com/problems/evaluate-reverse-polish-notation/?envType=study-plan-v2&envId=top-interview-150 Evaluate Reverse Polish Notation - LeetCode Can you solve this real interview question? Evaluate Reverse Polish Notation - You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation [http://en.wikipedia.org/wiki/Reverse_Polish_notation].. 155. Min Stack https://leetcode.com/problems/min-stack/description/?envType=study-plan-v2&envId=top-interview-150 Min Stack - LeetCode Can you solve this real interview question? Min Stack - Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: * MinStack() initializes the stack object. * void push(int val) pushes t leetcode.com https://.. [이진 탐색] Leetcode 74. Search a 2D Matrix https://leetcode.com/problems/search-a-2d-matrix/description/?envType=study-plan-v2&envId=top-interview-150 Search a 2D Matrix - LeetCode Can you solve this real interview question? Search a 2D Matrix - You are given an m x n integer matrix matrix with the following two properties: * Each row is sorted in non-decreasing order. * The first integer of each row is greater than the last integer leet.. [토끼와 거북이 알고리즘 + 테스트 코드] Leetcode 141. Linked List Cycle https://leetcode.com/problems/linked-list-cycle/description/?envType=study-plan-v2&envId=top-interview-150 Linked List Cycle - LeetCode Can you solve this real interview question? Linked List Cycle - 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 that can be reached again by continuo leetc.. 이전 1 2 3 다음
