Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit aaa7e54

Browse files
2 parents f4e0d89 + 0823a89 commit aaa7e54

File tree

1 file changed

+14
-0
lines changed

1 file changed

+14
-0
lines changed

‎Mock interviews/README.md

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -11,6 +11,20 @@ Leetcode 57 Insert interval - hard level
1111
http://juliachencoding.blogspot.com/2018/05/being-interviewee-insert-intervals.html
1212

1313

14+
Third mock interview
15+
16+
Sort the array - using one iteration
17+
18+
https://gist.github.com/jianminchen/bed337318339a36e20a7d2a3b8311288
19+
20+
21+
Given a non-empty list of words, return the k most frequent elements.
22+
23+
Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the
24+
lower alphabetical order comes first.
25+
26+
https://gist.github.com/jianminchen/fa927d3de4cfc01874222902e0c3bc92
27+
1428

1529

1630

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /