Created
November 4, 2017 08:04
-
-
Save razvanch/85697897d686a33fe661aa5c11b8eff0 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
debug probleme: #debugging | |
code review probleme: #code-review | |
probleme clasificate pe companii: http://www.learn4master.com/interview-questions/leetcode/leetcode-problems-classified-by-company | |
warm-up: | |
https://leetcode.com/problems/valid-parentheses/description/ | |
https://leetcode.com/problems/two-sum/description/ | |
https://leetcode.com/problems/majority-element/description/ | |
https://leetcode.com/problems/min-stack/description/ | |
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ | |
https://leetcode.com/problems/increasing-triplet-subsequence/ (@mihaitish) | |
https://leetcode.com/problems/invert-binary-tree/ | |
fun: | |
https://leetcode.com/problems/validate-binary-search-tree/description/ | |
https://leetcode.com/problems/house-robber/description/ | |
https://leetcode.com/problems/house-robber-iii/description/ | |
https://leetcode.com/problems/find-k-closest-elements/description/ | |
https://leetcode.com/problems/queue-reconstruction-by-height/description/ | |
https://leetcode.com/problems/copy-list-with-random-pointer/description/ | |
https://leetcode.com/problems/find-median-from-data-stream/description/ | |
https://leetcode.com/problems/minimum-time-difference/description/ | |
https://leetcode.com/problems/lru-cache/description/ | |
funfun: | |
https://leetcode.com/problems/find-the-duplicate-number/description/ | |
https://leetcode.com/problems/counting-bits/description/ | |
https://leetcode.com/problems/redundant-connection/description/ | |
https://leetcode.com/problems/shuffle-an-array/description/ (@crisu_love) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment