How to set autocomplete in Ubuntu
Mofidy bash.bashrc
|
|
Find those code in the file
|
|
Remove #
Like below:
|
|
Source it
Mofidy bash.bashrc
|
|
Find those code in the file
|
|
Remove #
Like below:
|
|
Source it
Q. How Many Times Do A Clock’s Hands Overlap In A Day?
The most important is not the answer but the way to think and work out problems.
In total 22, because the clock hands approximately overlap at 12:00, 1:05, 2:10, 3:15, 4:20, 5:25, 6:30, 7:35, 8:40, 9:45 and 10:50 twice a day.
Although reaching the wrong answer is fine to an extent, you should avoid these common errors.
If you just sit in your chair quietly, then the interviewer is not going to know how you came to your answer. Talking the answer out gives the hiring manager valuable insight into how you are able to think.
You can find it at here: https://github.com/svenstaro/miniserve/releases
|
|
Serve single folder
Q. What is the most efficient way to sort a million integers?
Time Complexity
Sorting Algorithm | Average Case | Best Case | Worst Case |
---|---|---|---|
Bubble Sort | O(n^2) | O(n) | O(n^2) |
Insertion Sort | O(n^2) | O(n) | O(n^2) |
Selection Sort | O(n^2) | O(n^2) | O(n^2) |
Quick Sort | O(n.log(n)) | O(n.log(n)) | O(n^2) |
Merge Sort | O(n.log(n)) | O(n.log(n)) | O(n.log(n)) |
Heap Sort | O(n.log(n)) | O(n.log(n)) | O(n.log(n)) |
Counting Sort | O(n+k) | O(n+k) | O(n+k) |
Radix Sort | O(n*k) | O(n*k) | O(n*k) |
Bucket Sort | O(n+k) | O(n+k) | O(n^2) |
Space Complexity
|
|
|
|
This file tells conda-build how to package files under my_package/
|
|
The build.sh script contains methods to compile and install. So we use setuptools to complete the compilation and installation process.