jerseyguy's blog

By jerseyguy, history, 2 years ago, In English

problem statement :
given n students and m colleges
each student has a list of preferred colleges in which they want to take admission.
each college has a certain capacity to take students
assuming any college will accept any student
find a mapping such that max number of students can get admission and return max number of seats that can be occupied.

note: constraints were not given and students will take admission if they get a seat in their preferred college

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it +9 Vote: I do not like it

You should read about flow algorithms.