├── .gitignore ├── Interview ├── main_1.py ├── main_2.py ├── main_3.py ├── main_4.py ├── main_5.py ├── main_6.py ├── main_7.py ├── main_8.py └── main_9.py ├── LICENSE ├── LeetCode ├── Array and Strings │ ├── 1. Two Sum │ │ └── solution.py │ ├── 125. Valid Palindrome │ │ └── solution.py │ ├── 15. 3Sum │ │ └── solution.py │ ├── 151. Reverse Words in a String │ │ └── solution.py │ ├── 189. Rotate Array │ │ └── solution.py │ ├── 20. Valid Parentheses │ │ └── solution.py │ ├── 215. Kth Largest Element in an Array │ │ └── solution.py │ ├── 238. Product of Array Except Self │ │ └── solution.py │ ├── 283. Move Zeroes │ │ └── solution.py │ ├── 344. Reverse String │ │ └── solution.py │ ├── 347. Top K Frequent Elements │ │ └── solution.py │ ├── 42. Trapping Rain Water │ │ └── solution.py │ ├── 48. Rotate Image │ │ └── solution.py │ ├── 49. Group Anagrams │ │ └── solution.py │ ├── 5. Longest Palindromic Substring │ │ └── solution.py │ ├── 54. Spiral Matrix │ │ └── solution.py │ ├── 560. Subarray Sum Equals K │ │ └── solution.py │ ├── 66. Plus One │ │ └── solution.py │ ├── 76. Minimum Window Substring │ │ └── solution.py │ └── 8. String to Integer (atoi) │ │ └── solution.py ├── Backtracking │ ├── 17. Letter Combinations of a Phone Number │ │ └── solution.py │ ├── 22. Generate Parentheses │ │ └── solution.py │ ├── 39. Combination Sum │ │ └── solution.py │ ├── 46. Permutations │ │ └── solution.py │ └── 79. Word Search │ │ └── solution.py ├── Dynamic Programming │ ├── 120. Triangle │ │ └── solution.py │ ├── 121. Best Time to Buy and Sell Stock │ │ └── solution.py │ ├── 139. Word Break │ │ └── solution.py │ ├── 152. Maximum Product Subarray │ │ └── solution.py │ ├── 198. House Robber │ │ └── solution.py │ ├── 279. Perfect Squares │ │ └── solution.py │ ├── 300. Longest Increasing Subsequence │ │ └── solution.py │ ├── 53. Maximum Subarray │ │ └── solution.py │ ├── 560. Subarray Sum Equals K │ │ └── solution.py │ ├── 62. Unique Paths │ │ └── solution.py │ └── 70. Climbing Stairs │ │ └── solution.py ├── Linked List │ ├── 141. Linked List Cycle │ │ └── solution.py │ ├── 2. Add Two Numbers │ │ └── solution.py │ ├── 206. Reverse Linked List │ │ └── solution.py │ ├── 21. Merge Two Sorted Lists │ │ └── solution.py │ ├── 23. Merge k Sorted Lists │ │ └── solution.py │ └── 445. Add Two Numbers II │ │ └── solution.py ├── Sorting and Searching │ ├── 153. Find Minimum in Rotated Sorted Array │ │ └── solution.py │ ├── 154. Find Minimum in Rotated Sorted Array II │ │ └── solution.py │ ├── 240. Search a 2D Matrix II │ │ └── solution.py │ ├── 252. Meeting Rooms │ │ └── solution.py │ ├── 253. Meeting Rooms II │ │ └── solution.py │ ├── 26. Remove Duplicates from Sorted Array │ │ └── solution.py │ ├── 295. Find Median from Data Stream │ │ └── solution.py │ ├── 33. Search in Rotated Sorted Array │ │ └── solution.py │ ├── 56. Merge Intervals │ │ └── solution.py │ ├── 74. Search a 2D Matrix │ │ └── solution.py │ ├── 75. Sort Colors │ │ └── solution.py │ └── 88. Merge Sorted Array │ │ └── solution.py └── Trees and Graphs │ ├── 102. Binary Tree Level Order Traversal │ └── solution.py │ ├── 103. Binary Tree Zigzag Level Order Traversal │ └── solution.py │ ├── 104. Maximum Depth of Binary Tree │ └── solution.py │ ├── 105. Construct Binary Tree from Preorder and Inorder Traversal │ └── solution.py │ ├── 116. Populating Next Right Pointers in Each Node │ └── solution.py │ ├── 117. Populating Next Right Pointers in Each Node II │ └── solution.py │ ├── 173. Binary Search Tree Iterator │ └── solution.py │ ├── 200. Number of Islands │ └── solution.py │ ├── 235. Lowest Common Ancestor of a Binary Search Tree │ └── solution.py │ ├── 236. Lowest Common Ancestor of a Binary Tree │ └── solution.py │ ├── 257. Binary Tree Paths │ └── solution.py │ ├── 547. Friend Circles │ └── solution.py │ ├── 695. Max Area of Island │ └── solution.py │ ├── 94. Binary Tree Inorder Traversal │ └── solution.py │ └── 98. Validate Binary Search Tree │ └── solution.py ├── Legacy ├── 102. Linked List Cycle │ └── main.cpp ├── 103. Linked List Cycle II │ └── main.cpp ├── 104. Merge K Sorted Lists │ └── main.cpp ├── 105. Copy List with Random Pointer │ └── main.cpp ├── 113. Path Sum II [LeetCode] │ └── main.cpp ├── 114. Flatten Binary Tree to Linked List [LeetCode] │ └── main.cpp ├── 116. Jump Game │ └── main.cpp ├── 117. Jump Game II │ └── main.cpp ├── 120. Triangle [LeetCode] │ └── main.cpp ├── 153. Combination Sum II │ └── main.cpp ├── 165. Merge Two Sorted Lists │ └── main.cpp ├── 17. Subsets │ └── main.cpp ├── 174. Dungeon Game [LeetCode] │ └── main.cpp ├── 18. Subsets II │ └── main.cpp ├── 187. Repeated DNA Sequences [LeetCode] │ └── main.cpp ├── 198. House Robber [LeetCode] │ └── main.cpp ├── 199. Binary Tree Right Side View [LeetCode] │ └── main.cpp ├── 236. Lowest Common Ancestor of a Binary Tree [LeetCode] │ └── main.cpp ├── 290. Word Pattern [LeetCode] │ └── main.cpp ├── 3. Longest Substring Without Repeating Characters [LeetCode] │ └── main.cpp ├── 300. Longest Increasing Subsequence [LeetCode] │ └── main.cpp ├── 315. Count of Smaller Numbers After Self [LeetCode] │ └── main.cpp ├── 322. Coin Change [LeetCode] │ └── main.cpp ├── 33. N-Queens │ └── main.cpp ├── 33. Search in Rotated Sorted Array [LeetCode] │ └── main.cpp ├── 34. Search for a Range [LeetCode] │ └── main.cpp ├── 35. Reverse Linked List │ └── main.cpp ├── 35. Search Insert Position [LeetCode] │ └── main.cpp ├── 36. Reverse Linked List II │ └── main.cpp ├── 366. Fibonacci │ └── main.cpp ├── 375. Guess Number Higher or Lower II [LeetCode] │ └── main.cpp ├── 376. Wiggle Subsequence [LeetCode] │ └── main.cpp ├── 380. Intersection of Two Linked Lists │ └── main.cpp ├── 402. Remove K Dights [LeetCode] │ └── main.cpp ├── 409. Longest Palindrome [LeetCode] │ └── main.cpp ├── 413. Arithmetic Slices [LeetCode] │ └── main.cpp ├── 427. Generate Parentheses │ └── main.cpp ├── 449. Serialize and Deserialize BST [LeetCode] │ └── main.cpp ├── 452. Minimum Number of Arrows to Burst Balloons │ └── main.cpp ├── 48. Majority Number III │ └── main.cpp ├── 49. Group Anagrams [LeetCode] │ └── main.cpp ├── 5. Kth Largest Element │ └── main.cpp ├── 53. Maximum Subarray [LeetCode] │ └── main.cpp ├── 64. Minimum Path Sum [LeetCode] │ └── main.cpp ├── 76. Minimum Window Substring [LeetCode] │ └── main.cpp ├── 81. Data Stream Median │ └── main.cpp ├── 9. Fizz Buzz │ └── main.cpp ├── 96. Partition List │ └── main.cpp ├── Immortals.xcodeproj │ ├── project.pbxproj │ ├── project.xcworkspace │ │ ├── contents.xcworkspacedata │ │ ├── xcshareddata │ │ │ └── IDEWorkspaceChecks.plist │ │ └── xcuserdata │ │ │ └── shuyu.xcuserdatad │ │ │ └── UserInterfaceState.xcuserstate │ └── xcuserdata │ │ └── shuyu.xcuserdatad │ │ ├── xcdebugger │ │ └── Breakpoints_v2.xcbkptlist │ │ └── xcschemes │ │ ├── 402. Remove K Dights [LeetCode].xcscheme │ │ └── xcschememanagement.plist ├── LICENSE └── README.md └── README.md /.gitignore: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/.gitignore -------------------------------------------------------------------------------- /Interview/main_1.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_1.py -------------------------------------------------------------------------------- /Interview/main_2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_2.py -------------------------------------------------------------------------------- /Interview/main_3.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_3.py -------------------------------------------------------------------------------- /Interview/main_4.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_4.py -------------------------------------------------------------------------------- /Interview/main_5.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_5.py -------------------------------------------------------------------------------- /Interview/main_6.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_6.py -------------------------------------------------------------------------------- /Interview/main_7.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_7.py -------------------------------------------------------------------------------- /Interview/main_8.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_8.py -------------------------------------------------------------------------------- /Interview/main_9.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Interview/main_9.py -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LICENSE -------------------------------------------------------------------------------- /LeetCode/Array and Strings/1. Two Sum/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/1. Two Sum/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/125. Valid Palindrome/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/125. Valid Palindrome/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/15. 3Sum/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/15. 3Sum/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/151. Reverse Words in a String/solution.py: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /LeetCode/Array and Strings/189. Rotate Array/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/189. Rotate Array/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/20. Valid Parentheses/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/20. Valid Parentheses/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/215. Kth Largest Element in an Array/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/215. Kth Largest Element in an Array/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/238. Product of Array Except Self/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/238. Product of Array Except Self/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/283. Move Zeroes/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/283. Move Zeroes/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/344. Reverse String/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/344. Reverse String/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/347. Top K Frequent Elements/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/347. Top K Frequent Elements/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/42. Trapping Rain Water/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/42. Trapping Rain Water/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/48. Rotate Image/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/48. Rotate Image/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/49. Group Anagrams/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/49. Group Anagrams/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/5. Longest Palindromic Substring/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/5. Longest Palindromic Substring/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/54. Spiral Matrix/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/54. Spiral Matrix/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/560. Subarray Sum Equals K/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/560. Subarray Sum Equals K/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/66. Plus One/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/66. Plus One/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/76. Minimum Window Substring/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/76. Minimum Window Substring/solution.py -------------------------------------------------------------------------------- /LeetCode/Array and Strings/8. String to Integer (atoi)/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Array and Strings/8. String to Integer (atoi)/solution.py -------------------------------------------------------------------------------- /LeetCode/Backtracking/17. Letter Combinations of a Phone Number/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Backtracking/17. Letter Combinations of a Phone Number/solution.py -------------------------------------------------------------------------------- /LeetCode/Backtracking/22. Generate Parentheses/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Backtracking/22. Generate Parentheses/solution.py -------------------------------------------------------------------------------- /LeetCode/Backtracking/39. Combination Sum/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Backtracking/39. Combination Sum/solution.py -------------------------------------------------------------------------------- /LeetCode/Backtracking/46. Permutations/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Backtracking/46. Permutations/solution.py -------------------------------------------------------------------------------- /LeetCode/Backtracking/79. Word Search/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Backtracking/79. Word Search/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/120. Triangle/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/120. Triangle/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/121. Best Time to Buy and Sell Stock/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/121. Best Time to Buy and Sell Stock/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/139. Word Break/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/139. Word Break/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/152. Maximum Product Subarray/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/152. Maximum Product Subarray/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/198. House Robber/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/198. House Robber/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/279. Perfect Squares/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/279. Perfect Squares/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/300. Longest Increasing Subsequence/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/300. Longest Increasing Subsequence/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/53. Maximum Subarray/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/53. Maximum Subarray/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/560. Subarray Sum Equals K/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/560. Subarray Sum Equals K/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/62. Unique Paths/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/62. Unique Paths/solution.py -------------------------------------------------------------------------------- /LeetCode/Dynamic Programming/70. Climbing Stairs/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Dynamic Programming/70. Climbing Stairs/solution.py -------------------------------------------------------------------------------- /LeetCode/Linked List/141. Linked List Cycle/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Linked List/141. Linked List Cycle/solution.py -------------------------------------------------------------------------------- /LeetCode/Linked List/2. Add Two Numbers/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Linked List/2. Add Two Numbers/solution.py -------------------------------------------------------------------------------- /LeetCode/Linked List/206. Reverse Linked List/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Linked List/206. Reverse Linked List/solution.py -------------------------------------------------------------------------------- /LeetCode/Linked List/21. Merge Two Sorted Lists/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Linked List/21. Merge Two Sorted Lists/solution.py -------------------------------------------------------------------------------- /LeetCode/Linked List/23. Merge k Sorted Lists/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Linked List/23. Merge k Sorted Lists/solution.py -------------------------------------------------------------------------------- /LeetCode/Linked List/445. Add Two Numbers II/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Linked List/445. Add Two Numbers II/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/153. Find Minimum in Rotated Sorted Array/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/153. Find Minimum in Rotated Sorted Array/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/154. Find Minimum in Rotated Sorted Array II/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/154. Find Minimum in Rotated Sorted Array II/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/240. Search a 2D Matrix II/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/240. Search a 2D Matrix II/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/252. Meeting Rooms/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/252. Meeting Rooms/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/253. Meeting Rooms II/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/253. Meeting Rooms II/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/26. Remove Duplicates from Sorted Array/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/26. Remove Duplicates from Sorted Array/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/295. Find Median from Data Stream/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/295. Find Median from Data Stream/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/33. Search in Rotated Sorted Array/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/33. Search in Rotated Sorted Array/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/56. Merge Intervals/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/56. Merge Intervals/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/74. Search a 2D Matrix/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/74. Search a 2D Matrix/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/75. Sort Colors/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/75. Sort Colors/solution.py -------------------------------------------------------------------------------- /LeetCode/Sorting and Searching/88. Merge Sorted Array/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Sorting and Searching/88. Merge Sorted Array/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/102. Binary Tree Level Order Traversal/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/102. Binary Tree Level Order Traversal/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/103. Binary Tree Zigzag Level Order Traversal/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/103. Binary Tree Zigzag Level Order Traversal/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/104. Maximum Depth of Binary Tree/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/104. Maximum Depth of Binary Tree/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/105. Construct Binary Tree from Preorder and Inorder Traversal/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/105. Construct Binary Tree from Preorder and Inorder Traversal/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/116. Populating Next Right Pointers in Each Node/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/116. Populating Next Right Pointers in Each Node/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/117. Populating Next Right Pointers in Each Node II/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/117. Populating Next Right Pointers in Each Node II/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/173. Binary Search Tree Iterator/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/173. Binary Search Tree Iterator/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/200. Number of Islands/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/200. Number of Islands/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/235. Lowest Common Ancestor of a Binary Search Tree/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/235. Lowest Common Ancestor of a Binary Search Tree/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/236. Lowest Common Ancestor of a Binary Tree/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/236. Lowest Common Ancestor of a Binary Tree/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/257. Binary Tree Paths/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/257. Binary Tree Paths/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/547. Friend Circles/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/547. Friend Circles/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/695. Max Area of Island/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/695. Max Area of Island/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/94. Binary Tree Inorder Traversal/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/94. Binary Tree Inorder Traversal/solution.py -------------------------------------------------------------------------------- /LeetCode/Trees and Graphs/98. Validate Binary Search Tree/solution.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/LeetCode/Trees and Graphs/98. Validate Binary Search Tree/solution.py -------------------------------------------------------------------------------- /Legacy/102. Linked List Cycle/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/102. Linked List Cycle/main.cpp -------------------------------------------------------------------------------- /Legacy/103. Linked List Cycle II/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/103. Linked List Cycle II/main.cpp -------------------------------------------------------------------------------- /Legacy/104. Merge K Sorted Lists/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/104. Merge K Sorted Lists/main.cpp -------------------------------------------------------------------------------- /Legacy/105. Copy List with Random Pointer/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/105. Copy List with Random Pointer/main.cpp -------------------------------------------------------------------------------- /Legacy/113. Path Sum II [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/113. Path Sum II [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/114. Flatten Binary Tree to Linked List [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/114. Flatten Binary Tree to Linked List [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/116. Jump Game/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/116. Jump Game/main.cpp -------------------------------------------------------------------------------- /Legacy/117. Jump Game II/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/117. Jump Game II/main.cpp -------------------------------------------------------------------------------- /Legacy/120. Triangle [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/120. Triangle [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/153. Combination Sum II/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/153. Combination Sum II/main.cpp -------------------------------------------------------------------------------- /Legacy/165. Merge Two Sorted Lists/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/165. Merge Two Sorted Lists/main.cpp -------------------------------------------------------------------------------- /Legacy/17. Subsets/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/17. Subsets/main.cpp -------------------------------------------------------------------------------- /Legacy/174. Dungeon Game [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/174. Dungeon Game [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/18. Subsets II/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/18. Subsets II/main.cpp -------------------------------------------------------------------------------- /Legacy/187. Repeated DNA Sequences [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/187. Repeated DNA Sequences [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/198. House Robber [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/198. House Robber [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/199. Binary Tree Right Side View [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/199. Binary Tree Right Side View [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/236. Lowest Common Ancestor of a Binary Tree [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/236. Lowest Common Ancestor of a Binary Tree [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/290. Word Pattern [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/290. Word Pattern [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/3. Longest Substring Without Repeating Characters [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/3. Longest Substring Without Repeating Characters [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/300. Longest Increasing Subsequence [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/300. Longest Increasing Subsequence [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/315. Count of Smaller Numbers After Self [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/315. Count of Smaller Numbers After Self [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/322. Coin Change [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/322. Coin Change [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/33. N-Queens/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/33. N-Queens/main.cpp -------------------------------------------------------------------------------- /Legacy/33. Search in Rotated Sorted Array [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/33. Search in Rotated Sorted Array [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/34. Search for a Range [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/34. Search for a Range [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/35. Reverse Linked List/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/35. Reverse Linked List/main.cpp -------------------------------------------------------------------------------- /Legacy/35. Search Insert Position [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/35. Search Insert Position [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/36. Reverse Linked List II/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/36. Reverse Linked List II/main.cpp -------------------------------------------------------------------------------- /Legacy/366. Fibonacci/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/366. Fibonacci/main.cpp -------------------------------------------------------------------------------- /Legacy/375. Guess Number Higher or Lower II [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/375. Guess Number Higher or Lower II [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/376. Wiggle Subsequence [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/376. Wiggle Subsequence [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/380. Intersection of Two Linked Lists/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/380. Intersection of Two Linked Lists/main.cpp -------------------------------------------------------------------------------- /Legacy/402. Remove K Dights [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/402. Remove K Dights [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/409. Longest Palindrome [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/409. Longest Palindrome [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/413. Arithmetic Slices [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/413. Arithmetic Slices [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/427. Generate Parentheses/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/427. Generate Parentheses/main.cpp -------------------------------------------------------------------------------- /Legacy/449. Serialize and Deserialize BST [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/449. Serialize and Deserialize BST [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/452. Minimum Number of Arrows to Burst Balloons/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/452. Minimum Number of Arrows to Burst Balloons/main.cpp -------------------------------------------------------------------------------- /Legacy/48. Majority Number III/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/48. Majority Number III/main.cpp -------------------------------------------------------------------------------- /Legacy/49. Group Anagrams [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/49. Group Anagrams [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/5. Kth Largest Element/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/5. Kth Largest Element/main.cpp -------------------------------------------------------------------------------- /Legacy/53. Maximum Subarray [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/53. Maximum Subarray [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/64. Minimum Path Sum [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/64. Minimum Path Sum [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/76. Minimum Window Substring [LeetCode]/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/76. Minimum Window Substring [LeetCode]/main.cpp -------------------------------------------------------------------------------- /Legacy/81. Data Stream Median/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/81. Data Stream Median/main.cpp -------------------------------------------------------------------------------- /Legacy/9. Fizz Buzz/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/9. Fizz Buzz/main.cpp -------------------------------------------------------------------------------- /Legacy/96. Partition List/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/96. Partition List/main.cpp -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/project.pbxproj: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/project.pbxproj -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/project.xcworkspace/contents.xcworkspacedata: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/project.xcworkspace/contents.xcworkspacedata -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/project.xcworkspace/xcuserdata/shuyu.xcuserdatad/UserInterfaceState.xcuserstate: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/project.xcworkspace/xcuserdata/shuyu.xcuserdatad/UserInterfaceState.xcuserstate -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/xcuserdata/shuyu.xcuserdatad/xcdebugger/Breakpoints_v2.xcbkptlist: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/xcuserdata/shuyu.xcuserdatad/xcdebugger/Breakpoints_v2.xcbkptlist -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/xcuserdata/shuyu.xcuserdatad/xcschemes/402. Remove K Dights [LeetCode].xcscheme: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/xcuserdata/shuyu.xcuserdatad/xcschemes/402. Remove K Dights [LeetCode].xcscheme -------------------------------------------------------------------------------- /Legacy/Immortals.xcodeproj/xcuserdata/shuyu.xcuserdatad/xcschemes/xcschememanagement.plist: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/Immortals.xcodeproj/xcuserdata/shuyu.xcuserdatad/xcschemes/xcschememanagement.plist -------------------------------------------------------------------------------- /Legacy/LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/LICENSE -------------------------------------------------------------------------------- /Legacy/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/Legacy/README.md -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ceruleanacg/Crack-Interview/HEAD/README.md --------------------------------------------------------------------------------