Ви просили ми зробили.
Top 20 most frequently asked LeetCode questions in Canada:
1 26. Remove Duplicates from Sorted Array (leetcode.com/problems/remove-duplicates-from-sorted-array/);
2 442. Find All Duplicates in an Array (leetcode.com/problems/find-all-duplicates-in-an-array/);
3 258. Add Digits (leetcode.com/problems/add-digits/);
4 215. Kth Largest Element in an Array (leetcode.com/problems/kth-largest-element-in-an-array/);
5 283. Move Zeroes (leetcode.com/problems/move-zeroes/);
6 1047. Remove All Adjacent Duplicates In String (leetcode.com/problems/remove-all-adjacent-duplicates-in-string/);
7 20. Valid Parentheses (leetcode.com/problems/valid-parentheses/);
8 349. Intersection of Two Arrays (leetcode.com/problems/intersection-of-two-arrays/);
9 771. Jewels and Stones (leetcode.com/problems/jewels-and-stones/);
10 387. First Unique Character in a String (leetcode.com/problems/first-unique-character-in-a-string/);
11 242. Valid Anagram (leetcode.com/problems/valid-anagram/);
12 1. Two Sum (leetcode.com/problems/two-sum/);
13 1512. Number of Good Pairs (leetcode.com/problems/number-of-good-pairs/);
14 14. Longest Common Prefix (leetcode.com/problems/longest-common-prefix/);
15 345. Reverse Vowels of a String (leetcode.com/problems/reverse-vowels-of-a-string/);
16 520. Detect Capital (leetcode.com/problems/detect-capital/);
17 657. Robot Return to Origin (leetcode.com/problems/robot-return-to-origin/);
18 1221. Split a String in Balanced Strings (leetcode.com/problems/split-a-string-in-balanced-strings/) and similar (leetcode.com/discuss/interview-question/718692/facebook-training-balanced-split);
19 125. Valid Palindrome (leetcode.com/problems/valid-palindrome/);
20 153. Find Minimum in Rotated Sorted Array (leetcode.com/problems/find-minimum-in-rotated-sorted-array/);
Починайте з них. Heppy coding!
Що треба мати наувазі. Ці задачі не просто так найпоширеніші. Кожна з них має два яскраво виражені рішення, brute force та optimal). Очікується, що ви за 5 хвилин вирішите задачку простим методом (using if, else, for loop etc.), а потім вдосконалите її (using HashMap, PriorityQueue etc.).
