An open API service indexing awesome lists of open source software.

https://github.com/kenshin579/tutorials-interview-questions

Interview Questions Collection
https://github.com/kenshin579/tutorials-interview-questions

algorithm amazon facebook google interview java leetcode naver questions string tree trie

Last synced: about 5 hours ago
JSON representation

Interview Questions Collection

Awesome Lists containing this project

README

          

[![Hits](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2Fkenshin579%2Ftutorials-interview-questions&count_bg=%2379C83D&title_bg=%23555555&icon=&icon_color=%23E7E7E7&title=hits&edge_flat=false)](https://hits.seeyoufarm.com)

# Algorithm - Table of Contents

Updated 2021-03-19

### Total Number of Studied Algorithms
| Site | Total |
| :---------: | :-----------: |
| codility | 1 |
| java | 5 |
| hackerrank | 1 |
| google | 1 |
| programmers | 13 |
| baekjoon | 1 |
| leetcode | 46 |
| geeksforgeeks | 11 |

## codility

* Remove String In Order (RemoveStringInOrder.java)

## java

* Object Oriented Problem (Coffee.java)
* Binary Search (BinarySearch.java)
* String Permutation (StringPermutation.java)
* Maximize Num Of Things (MaximizeNumOfThings.java)
* Remove duplicate from an array of integers (LinkedList.java)

## hackerrank

* 높이(height) : 루트 노드에서 가장 깊숙히 있는 노드의 깊이 (HeightOfBinaryTree.java)

## google

* Balanced Parenthesis (BalancedParenthesis.java)

## programmers

* 월간 코드 챌린지 시즌1 > 트리 트리오 중간값 (TreeTrioMediumValue.java)
* 월간 코드 챌린지 시즌1 > 이진 변환 반복하기 (BinaryBitOperation.java)
* 월간 코드 챌린지 시즌1 > 3진법 뒤집기 (DotProduct.java)
* 시간 초가 이슈도 있음 (Problem4.java)
* 월간 코드 챌린지 시즌1 > 두 개 뽑아서 더하기 (AddTwoIntegers.java)
* 월간 코드 챌린지 시즌1 > 3진법 뒤집기 (ConvertToTernary.java)
* 월간 코드 챌린지 시즌1 > 쿼드압축 후 개수 세기 (QuadTree.java)
* 찾아라 프로그래밍 마에스터 > 게임 맵 최단거리 (GameMapShortestPath.java)
* 42747 HIndex (HIndex.java)
* 크레인 인형뽑기 게임 - 2019 카카오 개발자 겨울 인턴쉽 (CraneDoll.java)
* 주식 가격 스택/큐 문제 (StockPrice.java)
* 더 맵게 Heap 문제 (MoreSpicy.java)
* Budget (Budget.java)

## baekjoon

* 2003 : 수들의 합2 (SubSum.java)

## leetcode

| Difficulty | Easy | Medium | Hard |
| :------: | :------: | :------: | :------: |
| Total | 29 | 17 | 0 |

| Tags | Array | BinarySearch | BitManipulation | Etc | Graph | Hash | LinkedList | Map | Set | String | Tree | Trie |
| :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: |
| Total | 3 | 1 | 1 | 5 | 2 | 1 | 6 | 1 | 1 | 11 | 11 | 3 |

#### Easy
* 1\. Two Sum (TwoSum.java)
* 14\. Longest Common Prefix (LongestCommonPrefix.java)
* 20\. Valid Parentheses (IsValid.java)
* 21\. Merge Two Sorted Lists (MergeTwoLists.java)
* 100\. Same Tree (SameTree.java)
* 104\. Maximum Depth of Binary Tree (MaxDepth.java)
* 107\. Binary Tree Level Order Traversal II (LevelOrderBottom.java)
* 111\. Minimum Depth of Binary Tree (MinDepth.java)
* 112\. Path Sum (PathSum.java)
* 118\. Pascal's Triangle (PascalTriangle.java)
* 125\. Valid Palindrome (ValidPalindrome.java)
* 206\. Reverse Linked List (ReverseList.java)
* 342\. Power of Four (PowerOfFour.java)
* 344\. Reverse String (ReverseString.java)
* 387\. First Unique Character in a String (FirstUniqChar.java)
* 392\. Is Subsequence (IsSubsequence.java)
* 404\. Sum of Left Leaves (SumOfLeftLeaves.java)
* 409\. Longest Palindrome (LongestPalindrome.java)
* 520\. Detect Capital (DetectCapital.java)
* 541\. Reverse String II (ReverseStr.java)
* 543\. Diameter of Binary Tree (DiameterOfBinaryTree.java)
* 557\. Reverse Words in a String III (ReverseWords.java)
* 704\. Binary Search (Search.java)
* 705\. Design HashSet (MyHashSet.java)
* 744\. Find Smallest Letter Greater Than Target (FindSmallestLetterGreaterThanTarget.java)
* 874\. Walking Robot Simulation (RobotSim.java)
* 876\. Middle of the Linked List (MiddleNode.java)
* 1290\. Convert Binary Number in a Linked List to Integer (GetDecimalValue.java)
* 1512\. Number of Good Pairs (NumberOfGoodPairs.java)

#### Medium
* 56\. Merge Intervals (MergeIntervals.java)
* 77\. Combinations (Combinations.java)
* 78\. Subsets (Subsets.java)
* 92\. Reverse Linked List II (ReverseBetween.java)
* 102\. Binary Tree Level Order Traversal (LevelOrder.java)
* 144\. Binary Tree Preorder Traversal (PreorderTraversal.java)
* 147\. Insertion Sort List (InsertionSortList.java)
* 200\. Number of Islands (NumIslands.java)
* 208\. Implement Trie (Prefix Tree) (TrieWithMap.java)
* 208\. Implement Trie (Prefix Tree) (Trie.java)
* 211\. Add and Search Word - Data structure design (WordDictionary.java)
* 287\. Find the Duplicate Number (FindDuplicate.java)
* 394\. Decode String (DecodeString.java)
* 435\. Non-overlapping Intervals (EraseOverlapInterval.java)
* 560\. Subarray Sum Equals K (SubarraySum.java)
* 701\. Insert into a Binary Search Tree (InsertIntoBST.java)
* 1008\. Construct Binary Search Tree from Preorder Traversal (BstFromPreorder.java)

## geeksforgeeks

* Job Sequence 문제 (JobSequenceWithDealine.java)
* Transform String (TransformString.java)
* 최대 긴 Common Sub String 출력 (CommonSubString.java)
* 0-1 Knapsack (Knapsack.java)
* SubsetSum (SubsetSum.java)
* Graph (인접 리스트로 구현) (Graph.java)
* Minimum value of distance of farthest node in a Graph (MinFarthestDistance.java)
* Insertion Sort (InsertionSort.java)
* Look and Say Sequence (LookAndSaySequence.java)
* FractionalKnapsack (FractionalKnapsack.java)
* Left Right Rotate of String (LeftRightRotateOfString.java)