algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-27 20:22:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents(algo): split recommended qns into essential vs practice

Browse Source
This commit is contained in:
Yangshun Tay
2022-05-14 07:56:48 +08:00
parent 87a923079d
commit 016f1250b9
20 changed files with 175 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
contents/algorithms/sorting-searching.md
View File

@ -83,11 +83,18 @@ When a given sequence is in a sorted order (be it ascending or descending), usin
[Counting sort](https://en.wikipedia.org/wiki/Counting_sort) is a non-comparison-based sort you can use on numbers where you know the range of values beforehand. Examples: [H-Index](https://leetcode.com/problems/h-index/)
## Recommended questions
## Essential questions
_These are essential questions to practice if you're studying for this topic._
- [Binary Search](https://leetcode.com/problems/binary-search/)
- [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)
- [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)
## Recommended practice questions
_These are recommended questions to practice after you have studied for the topic and have practiced the essential questions._
- [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)
- [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)
- [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)
- [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)