Grokking-the-Coding-Interview-Patterns-for-Coding-Questions

上传者: 42168341 | 上传时间: 2022-07-03 14:51:58 | 文件大小: 135KB | 文件类型: ZIP
Grokking-the-Coding-Interview-Patterns-for-Coding-Questions

文件下载

资源详情

[{"title":"( 84 个子文件 135KB ) Grokking-the-Coding-Interview-Patterns-for-Coding-Questions","children":[{"title":"Grokking-the-Coding-Interview-Patterns-for-Coding-Questions-master","children":[{"title":"src","children":[{"title":"Pattern_1_Sliding_Window","children":[{"title":"StringPermutation.java <span style='color:#111;'> 4.41KB </span>","children":null,"spread":false},{"title":"LongestSubstringKDistinct.java <span style='color:#111;'> 4.64KB </span>","children":null,"spread":false},{"title":"CharacterReplacement.java <span style='color:#111;'> 3.62KB </span>","children":null,"spread":false},{"title":"MaxFruitCountOf2Types.java <span style='color:#111;'> 4.12KB </span>","children":null,"spread":false},{"title":"ReplacingOnes.java <span style='color:#111;'> 3.01KB </span>","children":null,"spread":false},{"title":"NoRepeatingSubString.java <span style='color:#111;'> 4.18KB </span>","children":null,"spread":false},{"title":"StringAnagrams.java <span style='color:#111;'> 4.51KB </span>","children":null,"spread":false},{"title":"MaxSumSubArrayOfSizeK.java <span style='color:#111;'> 2.12KB </span>","children":null,"spread":false},{"title":"MinimumWindowSubstring.java <span style='color:#111;'> 6.05KB </span>","children":null,"spread":false},{"title":"MinSizeSubArraySum.java <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_8_Binary_Tree_DFS","children":[{"title":"FindAllTreePaths.java <span style='color:#111;'> 5.00KB </span>","children":null,"spread":false},{"title":"PathWithGivenSequence.java <span style='color:#111;'> 5.17KB </span>","children":null,"spread":false},{"title":"TreeDiameter.java <span style='color:#111;'> 5.17KB </span>","children":null,"spread":false},{"title":"CountAllPathSum.java <span style='color:#111;'> 3.62KB </span>","children":null,"spread":false},{"title":"TreePathSum.java <span style='color:#111;'> 4.28KB </span>","children":null,"spread":false},{"title":"MaximumPathSum.java <span style='color:#111;'> 3.97KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_4_Merged_Intervals","children":[{"title":"MergeIntervals.java <span style='color:#111;'> 4.31KB </span>","children":null,"spread":false},{"title":"InsertIntervals.java <span style='color:#111;'> 4.34KB </span>","children":null,"spread":false},{"title":"IntervalsIntersection.java <span style='color:#111;'> 3.84KB </span>","children":null,"spread":false},{"title":"MaximumCPULoad.java <span style='color:#111;'> 3.61KB </span>","children":null,"spread":false},{"title":"MinimumMeetingRooms.java <span style='color:#111;'> 4.87KB </span>","children":null,"spread":false},{"title":"ConflictingAppointments.java <span style='color:#111;'> 3.39KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_9_Two_Heaps","children":[{"title":"FindMaximumCapital.java <span style='color:#111;'> 3.14KB </span>","children":null,"spread":false},{"title":"MedianOfAStream.java <span style='color:#111;'> 3.36KB </span>","children":null,"spread":false},{"title":"SlidingWindowMedian.java <span style='color:#111;'> 4.62KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_6_Reverse_LinkedList","children":[{"title":"RotateList.java <span style='color:#111;'> 3.49KB </span>","children":null,"spread":false},{"title":"ReverseEveryKElements.java <span style='color:#111;'> 3.77KB </span>","children":null,"spread":false},{"title":"ReverseLinkedList.java <span style='color:#111;'> 3.07KB </span>","children":null,"spread":false},{"title":"ReverseAlternatingKElements.java <span style='color:#111;'> 3.91KB </span>","children":null,"spread":false},{"title":"ReverseSubList.java <span style='color:#111;'> 3.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_11_Modified_Binary_Search","children":[{"title":"SearchInfiniteSortedArray.java <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"RotationCountOfRotatedArray.java <span style='color:#111;'> 5.35KB </span>","children":null,"spread":false},{"title":"FindRange.java <span style='color:#111;'> 4.82KB </span>","children":null,"spread":false},{"title":"MaxInBitonicArray.java <span style='color:#111;'> 3.15KB </span>","children":null,"spread":false},{"title":"NextLetter.java <span style='color:#111;'> 2.98KB </span>","children":null,"spread":false},{"title":"MinimumDifference.java <span style='color:#111;'> 3.29KB </span>","children":null,"spread":false},{"title":"SearchBitonicArray.java <span style='color:#111;'> 3.70KB </span>","children":null,"spread":false},{"title":"CeilingAndFloorOfANumber.java <span style='color:#111;'> 4.00KB </span>","children":null,"spread":false},{"title":"OrderAgnosticBinarySearch.java <span style='color:#111;'> 3.16KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_7_Binary_Tree_BFS","children":[{"title":"RightViewTree.java <span style='color:#111;'> 3.59KB </span>","children":null,"spread":false},{"title":"ReverseLevelOrderTraversal.java <span style='color:#111;'> 3.63KB </span>","children":null,"spread":false},{"title":"LevelOrderSuccessor.java <span style='color:#111;'> 3.41KB </span>","children":null,"spread":false},{"title":"LevelAverage.java <span style='color:#111;'> 3.55KB </span>","children":null,"spread":false},{"title":"MinimumBinaryTreeDepth.java <span style='color:#111;'> 3.55KB </span>","children":null,"spread":false},{"title":"ConnectLevelOrderSiblings.java <span style='color:#111;'> 4.36KB </span>","children":null,"spread":false},{"title":"ZigZagTraversal.java <span style='color:#111;'> 3.82KB </span>","children":null,"spread":false},{"title":"ConnectAllSiblings.java <span style='color:#111;'> 3.81KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_3_Fast_Slow_Pointers","children":[{"title":"LinkedListCycleStart.java <span style='color:#111;'> 3.13KB </span>","children":null,"spread":false},{"title":"RearrangeList.java <span style='color:#111;'> 3.75KB </span>","children":null,"spread":false},{"title":"LinkedListCycle.java <span style='color:#111;'> 3.24KB </span>","children":null,"spread":false},{"title":"PalindromicLinkedList.java <span style='color:#111;'> 3.75KB </span>","children":null,"spread":false},{"title":"HappyNumber.java <span style='color:#111;'> 2.73KB </span>","children":null,"spread":false},{"title":"LinkedListCycleLength.java <span style='color:#111;'> 3.59KB </span>","children":null,"spread":false},{"title":"MiddleOfLinkedList.java <span style='color:#111;'> 3.17KB </span>","children":null,"spread":false},{"title":"CircularArrayLoop.java <span style='color:#111;'> 3.29KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_5_Cyclic_Sort","children":[{"title":"FindAllDuplicate.java <span style='color:#111;'> 3.10KB </span>","children":null,"spread":false},{"title":"FirstKMissingPositive.java <span style='color:#111;'> 3.68KB </span>","children":null,"spread":false},{"title":"MissingNumber.java <span style='color:#111;'> 2.93KB </span>","children":null,"spread":false},{"title":"FindCorruptNums.java <span style='color:#111;'> 2.94KB </span>","children":null,"spread":false},{"title":"FindDuplicate.java <span style='color:#111;'> 2.89KB </span>","children":null,"spread":false},{"title":"AllMissingNumbers.java <span style='color:#111;'> 3.19KB </span>","children":null,"spread":false},{"title":"CyclicSort.java <span style='color:#111;'> 3.06KB </span>","children":null,"spread":false},{"title":"FirstMissingPositive.java <span style='color:#111;'> 2.95KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_2_Two_Pointers","children":[{"title":"TripletSumToZero.java <span style='color:#111;'> 3.49KB </span>","children":null,"spread":false},{"title":"QuadrupleSumToTarget.java <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"DutchFlag.java <span style='color:#111;'> 2.67KB </span>","children":null,"spread":false},{"title":"BackSpaceCompare.java <span style='color:#111;'> 3.35KB </span>","children":null,"spread":false},{"title":"SortedArraySquares.java <span style='color:#111;'> 3.01KB </span>","children":null,"spread":false},{"title":"TripleWithSmallerSum.java <span style='color:#111;'> 3.09KB </span>","children":null,"spread":false},{"title":"PairWithTargetSum.java <span style='color:#111;'> 2.86KB </span>","children":null,"spread":false},{"title":"TripleSumCloseToTarget.java <span style='color:#111;'> 3.94KB </span>","children":null,"spread":false},{"title":"RemoveDuplicates.java <span style='color:#111;'> 2.46KB </span>","children":null,"spread":false},{"title":"ShortestWindowSort.java <span style='color:#111;'> 3.16KB </span>","children":null,"spread":false}],"spread":true},{"title":"Pattern_10_Subsets","children":[{"title":"Permutations.java <span style='color:#111;'> 4.11KB </span>","children":null,"spread":false},{"title":"Subset.java <span style='color:#111;'> 2.93KB </span>","children":null,"spread":false},{"title":"LetterCaseStringPermutation.java <span style='color:#111;'> 3.35KB </span>","children":null,"spread":false},{"title":"SubsetWithDuplicates.java <span style='color:#111;'> 3.57KB </span>","children":null,"spread":false}],"spread":true}],"spread":false},{"title":".idea","children":[{"title":"misc.xml <span style='color:#111;'> 487B </span>","children":null,"spread":false},{"title":"uiDesigner.xml <span style='color:#111;'> 8.59KB </span>","children":null,"spread":false},{"title":"modules.xml <span style='color:#111;'> 292B </span>","children":null,"spread":false},{"title":".gitignore <span style='color:#111;'> 47B </span>","children":null,"spread":false},{"title":"vcs.xml <span style='color:#111;'> 180B </span>","children":null,"spread":false}],"spread":true},{"title":".gitignore <span style='color:#111;'> 29B </span>","children":null,"spread":false},{"title":"Coding Interview Questions.iml <span style='color:#111;'> 423B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明