72737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111

package main

import (
    "fmt"
	"os"
)
type ArrayQueue struct {
	arr      []int // Array to store queue elements
	start    int   // Index of start of the queue
	end      int   // Index of end of the queue
	currSize int   // Current size of the queue
	maxSize  int   // Maximum size of the queue
}

// Constructor
func NewArrayQueue() *ArrayQueue {
	return &ArrayQueue{
		arr:      make([]int, 10),
		start:    -1,
		end:      -1,
		currSize: 0,
		maxSize:  10,
	}
}

// Method to push an element into the queue
func (q *ArrayQueue) Push(x int) {
	// Check if the queue is full
	if q.currSize == q.maxSize {
		fmt.Println("Queue is full\nExiting...")
		os.Exit(1)
	}

	// If the queue is empty, initialize start and end
	if q.end == -1 {
		q.start = 0
		q.end = 0
	} else {
		// Circular increment of end
		q.end = (q.end + 1) % q.maxSize
	}

	q.arr[q.end] = x
	q.currSize++
}

// Method to pop an element from the queue
func (q *ArrayQueue) Pop() int {
	// Check if the queue is empty
	if q.start == -1 {
		fmt.Println("Queue Empty\nExiting...")
		os.Exit(1)
	}

	popped := q.arr[q.start]

	// If the queue has only one element, reset start and end
	if q.currSize == 1 {
		q.start = -1
		q.end = -1
	} else {
		// Circular increment of start
		q.start = (q.start + 1) % q.maxSize
	}

	q.currSize--
	return popped
}

// Method to get the front element of the queue
func (q *ArrayQueue) Peek() int {
	// Check if the queue is empty
	if q.start == -1 {
		fmt.Println("Queue is Empty")
		os.Exit(1)
	}
	return q.arr[q.start]
}

// Method to determine whether the queue is empty
func (q *ArrayQueue) IsEmpty() bool {
	return q.currSize == 0
}

func main() {
	queue := NewArrayQueue()
	commands := []string{"ArrayQueue", "push", "push", "peek", "pop", "isEmpty"}
	inputs := [][]int{{}, {5}, {10}, {}, {}, {}}

	for i, cmd := range commands {
		switch cmd {
		case "push":
			queue.Push(inputs[i][0])
			fmt.Print("null ")
		case "pop":
			fmt.Printf("%d ", queue.Pop())
		case "peek":
			fmt.Printf("%d ", queue.Peek())
		case "isEmpty":
			if queue.IsEmpty() {
				fmt.Print("true ")
			} else {
				fmt.Print("false ")
			}
		case "ArrayQueue":
			fmt.Print("null ")
		}
	}

	fmt.Println()
}

Complexity Analysis:

Time Complexity: O(1) as all individual queue operations are taking constant time.

Space Complexity: O(1) as the implementation uses a fixed size array.1d:T746,class ArrayQueue { // Array to store queue elements int* arr; // Indices for start and end of the queue int start, end; // Current size and maximum size of the queue int currSize, maxSize; public: // Constructor ArrayQueue() { arr = new int[10]; start = -1; end = -1; currSize = 0; maxSize = 10; } // Method to push an element into the queue void push(int x) { // Check if the queue is full if (currSize == maxSize) { cout << "Queue is full\nExiting..." << endl; exit(1); } // If the queue is empty, initialize start and end if (end == -1) { start = 0; end = 0; } else { // Circular increment of end end = (end + 1) % maxSize; } arr[end] = x; currSize++; } // Me