DEV Community

Cover image for 1700. Number of Students Unable to Eat Lunch
MD ARIFUL HAQUE
MD ARIFUL HAQUE

Posted on • Edited on

1700. Number of Students Unable to Eat Lunch

1700. Number of Students Unable to Eat Lunch

Easy

The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches.

The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a stack. At each step:

  • If the student at the front of the queue prefers the sandwich on the top of the stack, they will take it and leave the queue.
  • Otherwise, they will leave it and go to the queue's end.

This continues until none of the queue students want to take the top sandwich and are thus unable to eat.

You are given two integer arrays students and sandwiches where sandwiches[i] is the type of the ith sandwich in the stack (i = 0 is the top of the stack) and students[j] is the preference of the jth student in the initial queue (j = 0 is the front of the queue). Return the number of students that are unable to eat.

Example 1:

  • Input: students = [1,1,0,0], sandwiches = [0,1,0,1]
  • Output: 0
  • Explanation:
    • Front student leaves the top sandwich and returns to the end of the line making students = [1,0,0,1].
    • Front student leaves the top sandwich and returns to the end of the line making students = [0,0,1,1].
    • Front student takes the top sandwich and leaves the line making students = [0,1,1] and sandwiches = [1,0,1].
    • Front student leaves the top sandwich and returns to the end of the line making students = [1,1,0].
    • Front student takes the top sandwich and leaves the line making students = [1,0] and sandwiches = [0,1].
    • Front student leaves the top sandwich and returns to the end of the line making students = [0,1].
    • Front student takes the top sandwich and leaves the line making students = [1] and sandwiches = [1].
    • Front student takes the top sandwich and leaves the line making students = [] and sandwiches = []. Hence all students are able to eat.

Example 2:

  • Input: students = [1,1,1,0,0,1], sandwiches = [1,0,0,0,1,1]
  • Output: 3

Constraints:

  • 1 <= students.length, sandwiches.length <= 100
  • students.length == sandwiches.length
  • sandwiches[i] is 0 or 1.
  • students[i] is 0 or 1.

Solution:

class Solution {

    /**
     * @param Integer[] $students
     * @param Integer[] $sandwiches
     * @return Integer
     */
    function countStudents($students, $sandwiches) {
        $count = array_count_values($students);
        $i = 0;
        foreach ($sandwiches as $s) {
            if (!$count[$s]) {
                break;
            }
            $count[$s]--;
            $i++;
        }
        return count($sandwiches) - $i;
    }
}
Enter fullscreen mode Exit fullscreen mode

Contact Links

If you found this series helpful, please consider giving the repository a star on GitHub or sharing the post on your favorite social networks 😍. Your support would mean a lot to me!

Billboard image

Use Playwright to test. Use Playwright to monitor.

Join Vercel, CrowdStrike, and thousands of other teams that run end-to-end monitors on Checkly's programmable monitoring platform.

Get started now!

Top comments (0)

AWS Security LIVE!

Tune in for AWS Security LIVE!

Join AWS Security LIVE! for expert insights and actionable tips to protect your organization and keep security teams prepared.

Learn More

👋 Kindness is contagious

Immerse yourself in a wealth of knowledge with this piece, supported by the inclusive DEV Community—every developer, no matter where they are in their journey, is invited to contribute to our collective wisdom.

A simple “thank you” goes a long way—express your gratitude below in the comments!

Gathering insights enriches our journey on DEV and fortifies our community ties. Did you find this article valuable? Taking a moment to thank the author can have a significant impact.

Okay