LeetCode 1894: Find the Student that Will Replace the Chalk Solution

Master LeetCode problem 1894 (Find the Student that Will Replace the Chalk), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1894. Find the Student that Will Replace the Chalk

Medium

Array Binary Search Simulation Prefix Sum

Problem Explanation

Explanation:

We need to simulate the process of distributing chalk to students until the chalk runs out.
We iterate through the students in a cyclic manner, deducting the chalk used by each student.
If at any point the remaining chalk is less than the chalk required by the current student, we return the index of that student.

Time Complexity: O(n)
Space Complexity: O(1)

Solution Code

class Solution {
    public int chalkReplacer(int[] chalk, int k) {
        long sum = 0;
        for (int c : chalk) {
            sum += c;
        }
        long remainder = k % sum;
        
        int student = 0;
        while (remainder >= chalk[student]) {
            remainder -= chalk[student];
            student++;
        }
        return student;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1894 (Find the Student that Will Replace the Chalk)?

This page provides optimized solutions for LeetCode problem 1894 (Find the Student that Will Replace the Chalk) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1894 (Find the Student that Will Replace the Chalk)?

The time complexity for LeetCode 1894 (Find the Student that Will Replace the Chalk) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1894 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1894 in Java, C++, or Python.

Back to LeetCode Solutions