GitHub Repository Submission

When using GitHub mode, paste your repository URL below and click Save URL to store it. The saved URL will be automatically included with every message you send until you choose to clear it. Learn more

Your GitHub repository URL is saved. LSBot will automatically fetch your latest code from this repository for each message. To change the URL, clear it first and save a new one.

Exercise 1

Implement peek and write some test code to ensure that it's working.

As you might have already noticed from the template, you'll need to use two pointers to implement a queue using a singly linked list. One pointer will always point to the front of the queue, and the other will point to the back of the queue.

Solution

The peek method in a queue is straightforward. It returns the value of the frontmost node or null if the queue is empty.

// some code above

peek() {
  return this.front ? this.front.val : null;
}

We use a ternary operator for simplicity. If the front element exists, this.front.val is returned; otherwise, it returns null. This can be rewritten with an if statement for clarity:

// some code above

peek() {
  if (this.front) {
    return this.front.val;
  }
  return null;
}

Hi! I'm LSBot. I can help you think through the selected exercise by giving you hints and guidance without revealing the solution. Your code from the editor will be automatically detected. Want to know more? Refer to the LSBot User Guide .

Detected solution
Loading...

Submit your solution for LSBot review.

Hi! I'm LSBot. Your code from the editor will be automatically detected. I'll review your solution and provide feedback to help you improve. Ask questions about your solution or request a comprehensive code review. Want to know more? Refer to the LSBot User Guide .

Detected solution
Loading...