GeeksforGeeks

cc150

Problem	C++	comment
1.4	cc150_1_4.cpp
9.4	cc150_9_4.cpp
9.4	cc150_9_8.cpp

Practice

Problem	C++	comment
min heap	min_heap.h min_heap.cpp

HackerRank

Regex

Problem	C++	Go	comment
Detect HTML links		detect_html_links.go
The Power Sum		the_power_sum.go
Contacts	cantacts.cpp		Trie

LeetCode

Problem	C++	Go	comment
1. Two Sum		1.go
2. Add Two Numbers		2.go
3. Longest Substring Without Repeating Characters	3.cpp	3.go
4. Median of Two Sorted Arrays	4.cpp	4.go	❤️
5. Longest Palindromic Substring	5.cpp	5.go
6. ZigZag Conversion	6.cpp
7. Reverse Integer		7.go
14. Longest Common Prefix		14.go
15. 3Sum		15.go
16. 3Sum Closest		16.go
17. Letter Combinations of a Phone Number	17.cpp	17.go
18. 4Sum		18.go
19. Remove Nth Node From End of List		19.go
20. Valid Parentheses	20.cpp
22. Generate Parentheses	22.cpp	22.go
23. Merge Two Sorted Lists		22.go
24. Swap Nodes in Pairs		24.go
26. Remove Duplicates from Sorted Array		26.go
27. Remove Element		27.go
29. Divide Two Integers		29.go
32. Longest Valid Parentheses	32.cpp
33. Search in Rotated Sorted Array		33.go	Rotated Sorted Array
34. Find First and Last Position of Element in Sorted Array	34.cpp	34.go	use stl equal_range in cpp solution
35. Search Insert Position		35.go
50. Pow(x, n)		50.go
54. Spiral Matrix	54.cpp	54.go
56. Merge Intervals		56.go
70. Climbing Stairs		70.go
71. Simplify Path	71.cpp
74. Search a 2D Matrix		74.go
81. Search in Rotated Sorted Array II		81.go
93. Restore IP Addresses		93.go
94. Binary Tree Inorder Traversal	94.cpp	94.go	❤️
98. Validate Binary Search Tree	98.cpp		minNode && maxNode ❤️
100. Same Tree		100.go
101. Symmetric Tree		101.go
102. Binary Tree Level Order Traversal		102.go
103. Binary Tree Zigzag Level Order Traversal		103.go
104. Maximum Depth of Binary Tree		104.go
107. Binary Tree Level Order Traversal II		107.go
108. Convert Sorted Array to Binary Search Tree		108.go
110. Balanced Binary Tree		110.go
111. Minimum Depth of Binary Tree		111.go
112. Path Sum		112.go
113. Path Sum II		113.go
114. Flatten Binary Tree to Linked List		114.go
124. Binary Tree Maximum Path Sum		124.go	❤️
153. Find Minimum in Rotated Sorted Array		153.go	Rotated Sorted Array ❤️
154. Find Minimum in Rotated Sorted Array II		154.go	Rotated Sorted Array ❤️
155. Min Stack	155.cpp	155.go	Min Stack ❤️
222. Count Complete Tree Nodes	222.cpp
226. Invert Binary Tree		226.go
227. Basic Calculator II	227.cpp
230. Kth Smallest Element in a BST		230.go
240. Search a 2D Matrix II	240.cpp		❤️
287. Find the Duplicate Number		287.go	Linked List Cycle ❤️
300. Longest Increasing Subsequence		300.go
349. Intersection of Two Arrays		349.go
350. Intersection of Two Arrays II		350.go	What if the given array is already sorted? How would you optimize your algorithm? What if nums1's size is small compared to nums2's size? Which algorithm is better? What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
450. Delete Node in a BST	450.cpp		❤️
#. Title	#.cpp	#.go