{"id":47825262,"url":"https://github.com/kenshin579/tutorials-interview-questions","last_synced_at":"2026-04-03T19:37:14.313Z","repository":{"id":53694652,"uuid":"152071974","full_name":"kenshin579/tutorials-interview-questions","owner":"kenshin579","description":"Interview Questions Collection","archived":false,"fork":false,"pushed_at":"2022-01-02T11:49:03.000Z","size":704,"stargazers_count":1,"open_issues_count":35,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2023-05-06T22:50:51.971Z","etag":null,"topics":["algorithm","amazon","facebook","google","interview","java","leetcode","naver","questions","string","tree","trie"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kenshin579.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-10-08T11:56:27.000Z","updated_at":"2023-05-06T22:50:51.971Z","dependencies_parsed_at":"2022-09-14T06:31:59.249Z","dependency_job_id":null,"html_url":"https://github.com/kenshin579/tutorials-interview-questions","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"purl":"pkg:github/kenshin579/tutorials-interview-questions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenshin579%2Ftutorials-interview-questions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenshin579%2Ftutorials-interview-questions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenshin579%2Ftutorials-interview-questions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenshin579%2Ftutorials-interview-questions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kenshin579","download_url":"https://codeload.github.com/kenshin579/tutorials-interview-questions/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenshin579%2Ftutorials-interview-questions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31373046,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-03T17:53:18.093Z","status":"ssl_error","status_checked_at":"2026-04-03T17:53:17.617Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","amazon","facebook","google","interview","java","leetcode","naver","questions","string","tree","trie"],"created_at":"2026-04-03T19:37:13.583Z","updated_at":"2026-04-03T19:37:14.290Z","avatar_url":"https://github.com/kenshin579.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![Hits](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2Fkenshin579%2Ftutorials-interview-questions\u0026count_bg=%2379C83D\u0026title_bg=%23555555\u0026icon=\u0026icon_color=%23E7E7E7\u0026title=hits\u0026edge_flat=false)](https://hits.seeyoufarm.com)\n\n# Algorithm - Table of Contents\n\nUpdated 2021-03-19\n\n### Total Number of Studied Algorithms\n| Site  | Total |\n| :---------: | :-----------: |\n| codility | 1 |\n| java | 5 |\n| hackerrank | 1 |\n| google | 1 |\n| programmers | 13 |\n| baekjoon | 1 |\n| leetcode | 46 |\n| geeksforgeeks | 11 |\n\n## codility\n\n* Remove String In Order (RemoveStringInOrder.java)\n\n## java\n\n* Object Oriented Problem (Coffee.java)\n* Binary Search (BinarySearch.java)\n* String Permutation (StringPermutation.java)\n* Maximize Num Of Things (MaximizeNumOfThings.java)\n* Remove duplicate from an array of integers (LinkedList.java)\n\n## hackerrank\n\n* 높이(height) : 루트 노드에서 가장 깊숙히 있는 노드의 깊이 (HeightOfBinaryTree.java)\n\n## google\n\n* Balanced Parenthesis (BalancedParenthesis.java)\n\n## programmers\n\n* 월간 코드 챌린지 시즌1 \u003e 트리 트리오 중간값 (TreeTrioMediumValue.java)\n* 월간 코드 챌린지 시즌1 \u003e 이진 변환 반복하기 (BinaryBitOperation.java)\n* 월간 코드 챌린지 시즌1 \u003e 3진법 뒤집기 (DotProduct.java)\n* 시간 초가 이슈도 있음 (Problem4.java)\n* 월간 코드 챌린지 시즌1 \u003e 두 개 뽑아서 더하기 (AddTwoIntegers.java)\n* 월간 코드 챌린지 시즌1 \u003e 3진법 뒤집기 (ConvertToTernary.java)\n* 월간 코드 챌린지 시즌1 \u003e 쿼드압축 후 개수 세기 (QuadTree.java)\n* 찾아라 프로그래밍 마에스터 \u003e 게임 맵 최단거리 (GameMapShortestPath.java)\n* 42747 HIndex (HIndex.java)\n* 크레인 인형뽑기 게임 - 2019 카카오 개발자 겨울 인턴쉽 (CraneDoll.java)\n* 주식 가격 스택/큐 문제 (StockPrice.java)\n* 더 맵게 Heap 문제 (MoreSpicy.java)\n* Budget (Budget.java)\n\n## baekjoon\n\n* 2003 : 수들의 합2 (SubSum.java)\n\n## leetcode\n\n| Difficulty | Easy | Medium | Hard | \n| :------: | :------: | :------: | :------: |\n| Total  | 29 | 17 | 0 | \n\n| Tags | Array | BinarySearch | BitManipulation | Etc | Graph | Hash | LinkedList | Map | Set | String | Tree | Trie | \n| :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: | :------: |\n| Total | 3 | 1 | 1 | 5 | 2 | 1 | 6 | 1 | 1 | 11 | 11 | 3 |\n\n\n#### Easy\n* 1\\. Two Sum (TwoSum.java)\n* 14\\. Longest Common Prefix (LongestCommonPrefix.java)\n* 20\\. Valid Parentheses (IsValid.java)\n* 21\\. Merge Two Sorted Lists (MergeTwoLists.java)\n* 100\\. Same Tree (SameTree.java)\n* 104\\. Maximum Depth of Binary Tree (MaxDepth.java)\n* 107\\. Binary Tree Level Order Traversal II (LevelOrderBottom.java)\n* 111\\. Minimum Depth of Binary Tree (MinDepth.java)\n* 112\\. Path Sum (PathSum.java)\n* 118\\. Pascal's Triangle (PascalTriangle.java)\n* 125\\. Valid Palindrome (ValidPalindrome.java)\n* 206\\. Reverse Linked List (ReverseList.java)\n* 342\\. Power of Four (PowerOfFour.java)\n* 344\\. Reverse String (ReverseString.java)\n* 387\\. First Unique Character in a String (FirstUniqChar.java)\n* 392\\. Is Subsequence (IsSubsequence.java)\n* 404\\. Sum of Left Leaves (SumOfLeftLeaves.java)\n* 409\\. Longest Palindrome (LongestPalindrome.java)\n* 520\\. Detect Capital (DetectCapital.java)\n* 541\\. Reverse String II (ReverseStr.java)\n* 543\\. Diameter of Binary Tree (DiameterOfBinaryTree.java)\n* 557\\. Reverse Words in a String III (ReverseWords.java)\n* 704\\. Binary Search (Search.java)\n* 705\\. Design HashSet (MyHashSet.java)\n* 744\\. Find Smallest Letter Greater Than Target (FindSmallestLetterGreaterThanTarget.java)\n* 874\\. Walking Robot Simulation (RobotSim.java)\n* 876\\. Middle of the Linked List (MiddleNode.java)\n* 1290\\. Convert Binary Number in a Linked List to Integer (GetDecimalValue.java)\n* 1512\\. Number of Good Pairs (NumberOfGoodPairs.java)\n\n#### Medium\n* 56\\. Merge Intervals (MergeIntervals.java)\n* 77\\. Combinations (Combinations.java)\n* 78\\. Subsets (Subsets.java)\n* 92\\. Reverse Linked List II (ReverseBetween.java)\n* 102\\. Binary Tree Level Order Traversal (LevelOrder.java)\n* 144\\. Binary Tree Preorder Traversal (PreorderTraversal.java)\n* 147\\. Insertion Sort List (InsertionSortList.java)\n* 200\\. Number of Islands (NumIslands.java)\n* 208\\. Implement Trie (Prefix Tree) (TrieWithMap.java)\n* 208\\. Implement Trie (Prefix Tree) (Trie.java)\n* 211\\. Add and Search Word - Data structure design (WordDictionary.java)\n* 287\\. Find the Duplicate Number (FindDuplicate.java)\n* 394\\. Decode String (DecodeString.java)\n* 435\\. Non-overlapping Intervals (EraseOverlapInterval.java)\n* 560\\. Subarray Sum Equals K (SubarraySum.java)\n* 701\\. Insert into a Binary Search Tree (InsertIntoBST.java)\n* 1008\\. Construct Binary Search Tree from Preorder Traversal (BstFromPreorder.java)\n\n## geeksforgeeks\n\n* Job Sequence 문제 (JobSequenceWithDealine.java)\n* Transform String (TransformString.java)\n* 최대 긴 Common Sub String 출력 (CommonSubString.java)\n* 0-1 Knapsack (Knapsack.java)\n* SubsetSum (SubsetSum.java)\n* Graph (인접 리스트로 구현) (Graph.java)\n* Minimum value of distance of farthest node in a Graph (MinFarthestDistance.java)\n* Insertion Sort (InsertionSort.java)\n* Look and Say Sequence (LookAndSaySequence.java)\n* FractionalKnapsack (FractionalKnapsack.java)\n* Left Right Rotate of String (LeftRightRotateOfString.java)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkenshin579%2Ftutorials-interview-questions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkenshin579%2Ftutorials-interview-questions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkenshin579%2Ftutorials-interview-questions/lists"}