Exam hall seat arrangement problem

See more:

C#

LINQ

algorithm

Hello everyone,

Case Scenario :

Exams : 1, 2, 3, 4
Seats : A, B, C, D, E
Students : 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Student-Exam-Map :

Exam	Student
1	1
1	2
1	3
1	4
1	5
2	1
2	3
2	5
2	7
2	9
3	2
3	4
3	6
3	8
3	10
4	1
4	3
4	2
4	5
4	10

Problem : One student can have only one seat for all exams, i can allot one seat to more than student but without conflict.

What kind of problem it is and what algorithm should i use?

Thank you

What I have tried:

I have prepared a chart to allot seat and sequentially allot seats using for loop.
The chart is :

Exam/Seat	1	2	3	4
A		1	1	6	1
B		2	7	2	2
C		3	3	8	3
D		4	9	4	
E		5	5	10

Invalid solution because for last 2 rows both 5 and 10 student require Seat E.