MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / popleft

Method popleft

javascript/0460-lfu-cache.js:36–42  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

34 }
35
36 popleft() {
37 let data = this.Left.next.val;
38 this.Left.next = this.Left.next.next;
39 this.Left.next.prev = this.Left;
40 this.map.delete(data);
41 return data;
42 }
43
44 pushRight(val) {
45 let newNode = new ListNode(val, this.Right);

Callers 15

pushMethod · 0.80
popMethod · 0.80
shortestSubarrayMethod · 0.80
orangesRottingMethod · 0.80
pushDominoesMethod · 0.80
minJumpsMethod · 0.80
rightSideViewMethod · 0.80
leastIntervalMethod · 0.80
snakesAndLaddersMethod · 0.80
maxSlidingWindowMethod · 0.80
isEvenOddTreeMethod · 0.80

Calls

no outgoing calls

Tested by 2

shortestSubarrayMethod · 0.64