Memory overhead: At most SEGMENT_SIZE - 1 unused slots in the rear segment
Method 2 - Generic Segmented Queue

This version provides type safety and can work with any data type.
Code

[{"language":"Java","code":"import java.lang.reflect.Array;\n\npublic class GenericSegmentedQueue<T> {\n    private static final int SEGMENT_SIZE = 1000;\n    \n    private static class Segment<T> {\n        T[] arr;\n        int front;\n        int rear;\n        int count;\n        Segment<T> next;\n        \n        @SuppressWarnings(\"unchecked\")\n        public Segment(Class<T> clazz) {\n            arr = (T[]) Array.newInstance(clazz, SEGMENT_SIZE);\n            front = 0;\n            rear = 0;\n            count = 0;\n            next = null;\n        }\n        \n        public boolean isFull() {\n            return count == SEGMENT_SIZE;\n        }\n        \n        public boolean isEmpty() {\n            return count == 0;\n        }\n        \n        public void enqueue(T value) {\n            if (isFull()) {\n                throw new IllegalStateException(\"Segment is full\");\n            }\n            arr[rear] = value;\n            rear = (rear + 1) % SEGMENT_SIZE;\n            count++;\n        }\n        \n        public T dequeue() {\n            if (isEmpty()) {\n                throw new IllegalStateException(\"Segment is empty\");\n            }\n            T value = arr[front];\n            arr[front] = null; // Help GC\n            front = (front + 1) % SEGMENT_SIZE;\n            count--;\n            return value;\n        }\n        \n        public T peek() {\n            if (isEmpty()) {\n                throw new IllegalStateException(\"Segment is empty\");\n            }\n            return arr[front];\n        }\n    }\n    \n    private final Class<T> elementClass;\n    private Segment<T> frontSegment;\n    private Segment<T> rearSegment;\n    private int totalSize;\n    \n    public GenericSegmentedQueue(Class<T> clazz) {\n        this.elementClass = clazz;\n        frontSegment = new Segment<>(clazz);\n        rearSegment = frontSegment;\n        totalSize = 0;\n    }\n    \n    public void enqueue(T value) {\n        if (rearSegment.isFull()) {\n            Segment<T> newSegment = new Segment<>(elementClass);\n            rearSegment.next = newSegment;\n            rearSegment = newSegment;\n        }\n        \n        rearSegment.enqueue(value);\n        totalSize++;\n    }\n    \n    public T dequeue() {\n        if (totalSize == 0) {\n            throw new IllegalStateException(\"Queue is empty\");\n        }\n        \n        T value = frontSegment.dequeue();\n        totalSize--;\n        \n        if (frontSegment.isEmpty() && frontSegment.next != null) {\n            frontSegment = frontSegment.next;\n        }\n        \n        return value;\n    }\n    \n    public int get_size() {\n        return totalSize;\n    }\n    \n    public boolean isEmpty() {\n        return totalSize == 0;\n    }\n    \n    public T peek() {\n        if (totalSize == 0) {\n            throw new IllegalStateException(\"Queue is empty\");\n        }\n        return frontSegment.peek();\n    }\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">import</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> java.lang.reflect.Array;</span></span>\n<span class=\"line\"></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F9
Related Tags
