RMIT 2019 Algorithm Analysis
Special thanks to QMZiT
This is practise repo of RMIT 2019 Algorithm Analysis.
Hands-on training on real coding interview questions, for fun (-:
I came here because I want to ...
| Title |
Solution |
Difficulty |
Time |
Space |
Docs |
| Fixed Array |
Java, Swift |
Easy |
O(n) |
O(n) |
Docs |
| Max Consecutive Ones |
Java, Swift |
Easy |
O(n) |
O(1) |
|
| Heaters |
Java, Swift |
Easy |
O(nlogn) |
O(1) |
|
| Number of Boomerangs |
Java, Swift |
Easy |
O(n ^ 2) |
O(n) |
|
| Valid Tic-Tac-Toe State |
Java, Swift |
Medium |
O(n ^ 2) |
O(n ^ 2) |
|
| Island Perimeter |
Java, Swift |
Easy |
O(nm) |
O(1) |
|
| Majority Element |
Java, Swift |
Easy |
O(n) |
O(1) |
|
| Majority Element II |
Java, Swift |
Medium |
O(n) |
O(1) |
|
| Intersection of Two Arrays |
Java, Swift |
Easy |
O(n) |
O(n) |
|
| Intersection of Two Arrays II |
Java, Swift |
Easy |
O(n) |
O(n) |
|
| Contains Duplicate |
Java, Swift |
Easy |
O(n) |
O(n) |
|
| Contains Duplicate II |
Java, Swift |
Easy |
O(n) |
O(n) |
|
| Remove Duplicates from Sorted Array |
Java, Swift |
Easy |
O(n) |
O(1) |
|
| Remove Duplicates from Sorted Array II |
Java, Swift |
Medium |
O(n) |
O(1) |
|
| Move Zeroes |
Java, Swift |
Easy |
O(n) |
O(1) |
|
| Remove Element |
Java, Swift |
Easy |
O(n) |
O(1) |
|
| Subsets |
Java, Swift |
Easy |
O(n) |
O(1) |
|
| Two Sum |
Java, Swift |
Easy |
O(n) |
O(n) |
|
| 3Sum |
Java, Swift |
Medium |
O(n^2) |
O(nC3) |
|
| 3Sum Closest |
Java, Swift |
Medium |
O(n^2) |
O(nC3) |
|
| 4Sum |
Java, Swift |
Medium |
O(n^3) |
O(nC4) |
|
| Summary Ranges |
Swift |
Medium |
O(n) |
O(n) |
|
| Shortest Word Distance |
Swift |
Easy |
O(n) |
O(1) |
|
| Shortest Word Distance III |
Swift |
Medium |
O(n) |
O(1) |
|
| Minimum Size Subarray Sum |
Swift |
Medium |
O(n) |
O(1) |
|
| Maximum Size Subarray Sum Equals k |
Swift |
Medium |
O(n) |
O(n) |
|
| Smallest Range |
Swift |
Hard |
O(nm) |
O(nm) |
|
| Product of Array Except Self |
Swift |
Medium |
O(n) |
O(n) |
|
| Rotate Array |
Swift |
Easy |
O(n) |
O(1) |
|
| Rotate Image |
Swift |
Medium |
O(n^2) |
O(1) |
|
| Spiral Matrix |
Swift |
Medium |
O(n^2) |
O(1) |
|
| Spiral Matrix II |
Swift |
Medium |
O(n^2) |
O(1) |
|
| Valid Sudoku |
Swift |
Easy |
O(n^2) |
O(n) |
|
| Set Matrix Zero |
Swift |
Medium |
O(n^2) |
O(1) |
|
| Next Permutation |
Swift |
Medium |
O(n) |
O(1) |
|
| Gas Station |
Swift |
Medium |
O(n) |
O(1) |
|
| Game of Life |
Swift |
Medium |
O(n) |
O(1) |
|
| Task Scheduler |
Swift |
Medium |
O(nlogn) |
O(n) |
|
| Sliding Window Maximum |
Swift |
Hard |
O(n) |
O(n) |
|
| Longest Consecutive Sequence |
Swift |
Hard |
O(n) |
O(n) |
|
| Title |
Solution |
Difficulty |
Time |
Space |
| Reverse Linked List |
Java, Swift |
Easy |
O(n) |
O(1) |
| Palindrome Linked List |
Java, Swift |
Easy |
O(n) |
O(1) |
| Reverse Nodes In k-Groups |
Java, Swift |
Hard |
O(n) |
O(1) |
| Partition List |
Java, Swift |
Medium |
O(n) |
O(1) |
| Reverse Linked List II |
Java, Swift |
Easy |
O(n) |
O(1) |
| Swap Two Nodes In Linked List |
Java, Swift |
Easy |
O(n) |
O(1) |
| Merge Two Sorted Lists |
Java, Swift |
Easy |
O(n) |
O(1) |
| Swap Nodes in Pairs |
Java, Swift |
Medium |
O(n) |
O(1) |
| Remove Linked List Elements |
Java, Swift |
Easy |
O(n) |
O(1) |
| Remove Duplicates from Sorted List |
Swift |
Easy |
O(n) |
O(1) |
| Remove Duplicates from Sorted List II |
Swift |
Medium |
O(n) |
O(1) |
| Remove Nth Node From End of List |
Swift |
Easy |
O(n) |
O(1) |
| Odd Even Linked List |
Swift |
Medium |
O(n) |
O(1) |
| Rotate List |
Java, Swift |
Medium |
O(n) |
O(1) |
| Reorder List |
Java, Swift |
Medium |
O(n) |
O(1) |
| Copy List With Random Pointer |
Java, Swift |
Medium |
O(n) |
O(1) |
| Linked List Cycle |
Java, Swift |
Easy |
O(n) |
O(1) |
| Sort List |
Java, Swift |
Medium |
O(nlogn) |
O(1) |
| Merge k Sorted Lists |
Swift |
Hard |
O(mlogn) |
O(1) |
... understand the structure
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent