From 4256e98c75c8303639e0c74dbc062648b90503a7 Mon Sep 17 00:00:00 2001 From: Yangshun Tay Date: Sat, 30 Sep 2023 10:52:31 +0800 Subject: [PATCH] Update queue.md --- apps/website/contents/algorithms/queue.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/apps/website/contents/algorithms/queue.md b/apps/website/contents/algorithms/queue.md index 4de2fd7a..7341992f 100644 --- a/apps/website/contents/algorithms/queue.md +++ b/apps/website/contents/algorithms/queue.md @@ -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 dequeue 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 dequeue 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