fbe_dart_iterables_add

hint.txt

Peek should show the element that was added least recently, but not remove it.

main.dart

class Queue<T> {
  /// internal represents the list that Queue wraps. You do not need to edit this line. 
  List<T> _internal = <T>[];

  T peek() {
    // implement peek
    // which shows the next element to be removed from the list
  }

  T dequeue() {
    // implement dequeue
    // which removes the proper element from the list
  }

  void enqueue(T value) {
    // implement enqueue
    // which adds an element to the proper place in the list.
  }
}

solution.dart

class Queue<T> {
  List<T> _internal = <T>[];

  T peek() => _internal.first;

  T dequeue() => _internal.removeAt(0);

  void enqueue(T value) => _internal.add(value);
}

test.dart

void main() {
  final queue = Queue<int>();
  queue.enqueue(1);
  if (queue.peek() != 1) {
    _result(false, ["peek did not return the first element"]);
  }
  if (queue._internal.length != 1) {
    _result(false, ["expected queue of length 1 after adding one element and peeking"]);
  }
  final popped = queue.dequeue();
  if (popped != 1) {
    _result(false, ["expected the first element added to the queue when `dequeue` is called."]);
  }

  _result(true, ["Good work, fam"]);
}