mirror of
https://github.com/blindlobstar/go-interview-problems
synced 2025-04-22 01:35:15 +00:00
concurrent queue problem
This commit is contained in:
parent
9146c23ff9
commit
3e32fed19a
10
10-concurrent-queue/README.md
Normal file
10
10-concurrent-queue/README.md
Normal file
@ -0,0 +1,10 @@
|
||||
# Concurrent Queue
|
||||
Implement a thread-safe queue with the following properties:
|
||||
|
||||
- It has a fixed maximum size set at initialization.
|
||||
- `Push(val int) error` adds an item to the queue. If the queue is full, it should return `ErrQueueFull`.
|
||||
- `Pop() int` removes and returns first item from the queue. If the queue is empty, return -1.
|
||||
- The queue must be safe to use from multiple goroutines simultaneously.
|
||||
|
||||
## Tags
|
||||
`Concurrency`
|
31
10-concurrent-queue/solution/solution.go
Normal file
31
10-concurrent-queue/solution/solution.go
Normal file
@ -0,0 +1,31 @@
|
||||
package main
|
||||
|
||||
import "errors"
|
||||
|
||||
var ErrQueueFull = errors.New("queue is full")
|
||||
|
||||
type Queue struct {
|
||||
ch chan int
|
||||
}
|
||||
|
||||
func NewQueue(size int) *Queue {
|
||||
return &Queue{ch: make(chan int, size)}
|
||||
}
|
||||
|
||||
func (q *Queue) Push(val int) error {
|
||||
select {
|
||||
case q.ch <- val:
|
||||
return nil
|
||||
default:
|
||||
return ErrQueueFull
|
||||
}
|
||||
}
|
||||
|
||||
func (q *Queue) Pop() int {
|
||||
select {
|
||||
case val := <-q.ch:
|
||||
return val
|
||||
default:
|
||||
return -1
|
||||
}
|
||||
}
|
19
10-concurrent-queue/task.go
Normal file
19
10-concurrent-queue/task.go
Normal file
@ -0,0 +1,19 @@
|
||||
package main
|
||||
|
||||
import "errors"
|
||||
|
||||
var ErrQueueFull = errors.New("queue is full")
|
||||
|
||||
type Queue struct{}
|
||||
|
||||
func NewQueue(size int) *Queue {
|
||||
return &Queue{}
|
||||
}
|
||||
|
||||
func (q *Queue) Push(val int) error {
|
||||
return nil
|
||||
}
|
||||
|
||||
func (q *Queue) Pop() int {
|
||||
return 0
|
||||
}
|
131
10-concurrent-queue/task_test.go
Normal file
131
10-concurrent-queue/task_test.go
Normal file
@ -0,0 +1,131 @@
|
||||
package main
|
||||
|
||||
import (
|
||||
"context"
|
||||
"reflect"
|
||||
"sort"
|
||||
"sync"
|
||||
"testing"
|
||||
"time"
|
||||
)
|
||||
|
||||
func TestQueue(t *testing.T) {
|
||||
tests := []struct {
|
||||
name string
|
||||
size int
|
||||
ops []string
|
||||
args []int
|
||||
expected []any
|
||||
}{
|
||||
{
|
||||
name: "basic operations",
|
||||
size: 3,
|
||||
ops: []string{"push", "push", "push", "pop", "pop", "pop"},
|
||||
args: []int{1, 2, 3, 0, 0, 0},
|
||||
expected: []any{nil, nil, nil, 1, 2, 3},
|
||||
},
|
||||
{
|
||||
name: "empty queue pop",
|
||||
size: 1,
|
||||
ops: []string{"pop", "push", "pop"},
|
||||
args: []int{0, 5, 0},
|
||||
expected: []any{-1, nil, 5},
|
||||
},
|
||||
{
|
||||
name: "queue full error",
|
||||
size: 2,
|
||||
ops: []string{"push", "push", "push", "pop", "push", "pop"},
|
||||
args: []int{5, 10, 15, 0, 20, 0},
|
||||
expected: []any{nil, nil, ErrQueueFull, 5, nil, 10},
|
||||
},
|
||||
{
|
||||
name: "zero size queue",
|
||||
size: 0,
|
||||
ops: []string{"push", "pop"},
|
||||
args: []int{42, 0},
|
||||
expected: []any{ErrQueueFull, -1},
|
||||
},
|
||||
{
|
||||
name: "interleaved operations",
|
||||
size: 2,
|
||||
ops: []string{"push", "pop", "push", "push", "pop", "pop"},
|
||||
args: []int{1, 0, 2, 3, 0, 0},
|
||||
expected: []any{nil, 1, nil, nil, 2, 3},
|
||||
},
|
||||
}
|
||||
|
||||
for _, tt := range tests {
|
||||
t.Run(tt.name, func(t *testing.T) {
|
||||
q := NewQueue(tt.size)
|
||||
results := make([]any, len(tt.ops))
|
||||
|
||||
for i, op := range tt.ops {
|
||||
var result any
|
||||
|
||||
switch op {
|
||||
case "push":
|
||||
result = q.Push(tt.args[i])
|
||||
case "pop":
|
||||
result = q.Pop()
|
||||
}
|
||||
|
||||
results[i] = result
|
||||
}
|
||||
|
||||
if !reflect.DeepEqual(results, tt.expected) {
|
||||
t.Errorf("Expected: %v, got: %v", tt.expected, results)
|
||||
}
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
func TestConcurrentQueue(t *testing.T) {
|
||||
queue := NewQueue(1000)
|
||||
ctx, cancel := context.WithCancel(context.Background())
|
||||
defer cancel()
|
||||
|
||||
var wg sync.WaitGroup
|
||||
wg.Add(1000)
|
||||
for i := range 1000 {
|
||||
go func() {
|
||||
defer wg.Done()
|
||||
queue.Push(i + 1)
|
||||
}()
|
||||
}
|
||||
|
||||
ch := make(chan int, 1000)
|
||||
go func() {
|
||||
defer close(ch)
|
||||
for {
|
||||
select {
|
||||
case <-ctx.Done():
|
||||
return
|
||||
default:
|
||||
if val := queue.Pop(); val != -1 {
|
||||
ch <- val
|
||||
}
|
||||
}
|
||||
}
|
||||
}()
|
||||
|
||||
go func() {
|
||||
wg.Wait()
|
||||
time.Sleep(100 * time.Millisecond)
|
||||
cancel()
|
||||
}()
|
||||
|
||||
var result []int
|
||||
for val := range ch {
|
||||
result = append(result, val)
|
||||
}
|
||||
|
||||
expected := make([]int, 1000)
|
||||
for i := range 1000 {
|
||||
expected[i] = i + 1
|
||||
}
|
||||
|
||||
sort.Ints(result)
|
||||
if !reflect.DeepEqual(result, expected) {
|
||||
t.Errorf("Expected: 1..1000, got: %v", result)
|
||||
}
|
||||
}
|
Loading…
x
Reference in New Issue
Block a user