|
181 | 181 | 0922310922FA497500F0F5AF /* searchInsert.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = searchInsert.h; sourceTree = "<group>"; };
|
182 | 182 | 0922310C22FA50DD00F0F5AF /* maxSubArray.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = maxSubArray.h; sourceTree = "<group>"; };
|
183 | 183 | 0922310F22FAFEEE00F0F5AF /* merge.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = merge.h; sourceTree = "<group>"; };
|
| 184 | + 0922D94323CCBC7F00E7EF1E /* IsContinuous2.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = IsContinuous2.h; sourceTree = "<group>"; }; |
| 185 | + 0922D94623CCC58B00E7EF1E /* LastRemaining_Solution.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = LastRemaining_Solution.h; sourceTree = "<group>"; }; |
184 | 186 | 0924B8E622F9D8A400435980 /* twoSum.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = twoSum.h; sourceTree = "<group>"; };
|
185 | 187 | 0924B8E922F9E06000435980 /* removeDuplicates.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = removeDuplicates.h; sourceTree = "<group>"; };
|
186 | 188 | 09255F962360A57300B38E3D /* getMaxRectSize.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = getMaxRectSize.h; sourceTree = "<group>"; };
|
|
204 | 206 | 0943DB3D2382EDEE00E995BB /* getIntersectNode.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = getIntersectNode.h; sourceTree = "<group>"; };
|
205 | 207 | 094524B7234790CD00CCBFB9 /* coinChange.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = coinChange.h; sourceTree = "<group>"; };
|
206 | 208 | 094524BA234A32D000CCBFB9 /* levenshtein_distance.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = levenshtein_distance.h; sourceTree = "<group>"; };
|
| 209 | + 09452DC323A7D56700737465 /* removeRepeatNode.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = removeRepeatNode.h; sourceTree = "<group>"; }; |
207 | 210 | 0946B01522F68BA50043469D /* FirstNotRepeatingChar.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = FirstNotRepeatingChar.h; sourceTree = "<group>"; };
|
208 | 211 | 0946B01822F695CE0043469D /* ReverseSentence.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = ReverseSentence.h; sourceTree = "<group>"; };
|
209 | 212 | 0946B01B22F6A5BF0043469D /* StrToInt.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = StrToInt.h; sourceTree = "<group>"; };
|
|
232 | 235 | 095A524923364FC800D29259 /* permutation_sequence.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = permutation_sequence.h; sourceTree = "<group>"; };
|
233 | 236 | 095A524C23371ADA00D29259 /* combinations.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = combinations.h; sourceTree = "<group>"; };
|
234 | 237 | 095A524F2339193400D29259 /* subsets.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = subsets.h; sourceTree = "<group>"; };
|
| 238 | + 095D844523C0476800102FB0 /* ReOrder.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = ReOrder.h; sourceTree = "<group>"; }; |
235 | 239 | 095E32C223706CCA00331B4A /* josephusKill.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = josephusKill.h; sourceTree = "<group>"; };
|
236 | 240 | 095F60122322B3390072CF0C /* searchInRotatedSortedArrayII.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = searchInRotatedSortedArrayII.h; sourceTree = "<group>"; };
|
237 | 241 | 0965B3CB23045219009A153E /* lengthOfLastWord.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = lengthOfLastWord.h; sourceTree = "<group>"; };
|
|
280 | 284 | 09BEFF3622E141D300FF7CD3 /* kthSmallest.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = kthSmallest.h; sourceTree = "<group>"; };
|
281 | 285 | 09C5E0D82301C30300EDD63B /* strStr.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = strStr.h; sourceTree = "<group>"; };
|
282 | 286 | 09C8705F231D5EBE00ABE173 /* bucketSort.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = bucketSort.h; sourceTree = "<group>"; };
|
| 287 | + 09C9413823BF8AB00086EDAE /* Print1ToMaxOfNDigits.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = Print1ToMaxOfNDigits.h; sourceTree = "<group>"; }; |
| 288 | + 09C9413B23BF983C0086EDAE /* DeleteNodeO1.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = DeleteNodeO1.h; sourceTree = "<group>"; }; |
283 | 289 | 09CA9FAD2318A7A500BE2B39 /* combinationSum.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = combinationSum.h; sourceTree = "<group>"; };
|
284 | 290 | 09CA9FAE2318A7A500BE2B39 /* permutations.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = permutations.h; sourceTree = "<group>"; };
|
285 | 291 | 09CA9FAF2319744400BE2B39 /* longestUnivaluePath.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = longestUnivaluePath.h; sourceTree = "<group>"; };
|
|
675 | 681 | 3A65DBC822F813F10026166D /* FindNumbersWithSum.h */,
|
676 | 682 | 3A65DBCB22F819060026166D /* FindContinuousSequence.h */,
|
677 | 683 | 3A65DBCE22F823AD0026166D /* GetUglyNumber_Solution.h */,
|
| 684 | + 09C9413823BF8AB00086EDAE /* Print1ToMaxOfNDigits.h */, |
| 685 | + 0922D94323CCBC7F00E7EF1E /* IsContinuous2.h */, |
678 | 686 | );
|
679 | 687 | path = "coding-interviews";
|
680 | 688 | sourceTree = "<group>";
|
|
694 | 702 | 0943DB3A2382E20100E995BB /* addList.h */,
|
695 | 703 | 0943DB3D2382EDEE00E995BB /* getIntersectNode.h */,
|
696 | 704 | 091E1CED238EBFB100680649 /* reverseKNodes.h */,
|
| 705 | + 09452DC323A7D56700737465 /* removeRepeatNode.h */, |
697 | 706 | );
|
698 | 707 | path = itinterviews;
|
699 | 708 | sourceTree = "<group>";
|
|
848 | 857 | 09E18E5A22F56EDB002D0227 /* PrintMinNumber.h */,
|
849 | 858 | 09E18E5D22F58301002D0227 /* GetNumberOfK.h */,
|
850 | 859 | 09E18E6022F588E8002D0227 /* FindNumsAppearOnce.h */,
|
| 860 | + 095D844523C0476800102FB0 /* ReOrder.h */, |
851 | 861 | );
|
852 | 862 | path = "coding-interviews";
|
853 | 863 | sourceTree = "<group>";
|
|
934 | 944 | 3A091A7422F41C4200EFA79C /* FindFirstCommonNode.h */,
|
935 | 945 | 3A091A7722F4201800EFA79C /* deleteDuplication.h */,
|
936 | 946 | 3A091A6B22F3E3F600EFA79C /* creatlist.h */,
|
| 947 | + 09C9413B23BF983C0086EDAE /* DeleteNodeO1.h */, |
| 948 | + 0922D94623CCC58B00E7EF1E /* LastRemaining_Solution.h */, |
937 | 949 | );
|
938 | 950 | path = "coding-interviews";
|
939 | 951 | sourceTree = "<group>";
|
|
0 commit comments