CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-02-03 02:24:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents(queue): fix typo in queue content (#609)

Browse Source 
Co-authored-by: Yangshun Tay <tay.yang.shun@gmail.com>
This commit is contained in:
SwayZeee
2023-09-30 04:54:03 +02:00
committed by GitHub
parent 02a2444892
commit 0af108d24d
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
apps/website/contents/algorithms/queue.md
View File

@@ -55,7 +55,7 @@ Breadth-first search is commonly implemented using queues.
## Things to look out for during interviews
Most languages don't have a built-in Queue class which can be used, and candidates often use arrays (JavaScript) or lists (Python) as a queue. However, note that the enqueue operation in such a scenario will be O(n) because it requires shifting of all other elements by one. In such cases, you can flag this to the interviewer and say that you assume that there's a queue data structure to use which has an efficient enqueue operation.
Most languages don't have a built-in Queue class which can be used, and candidates often use arrays (JavaScript) or lists (Python) as a queue. However, note that the dequeue operation (assuming the front of the queue is on the left) in such a scenario will be O(n) because it requires shifting of all other elements left by one. In such cases, you can flag this to the interviewer and say that you assume that there's a queue data structure to use which has an efficient dequeue operation.
## Corner cases