Log Truncation - Google Top Interview Questions


Problem Statement :


You are given a list of integers logs and an integer limit. 

Each element in logs[i] represents the size of logs generated by user i. limit represents the total size of logs you can store in your system.

Return the largest x such that if we truncate every log in logs to be at most size x, the sum of the remaining log sizes is at most limit. 

If no log needs to be truncated, return the largest log size.

Constraints

1 ≤ n ≤ 100,000 where n is the length of logs

1 ≤ limit < 2 ** 31

Example 1

Input

logs = [50, 20, 1000, 50, 400]

limit = 300

Output

90

Explanation

If we truncate logs to 90, then we get [50, 20, 90, 50, 90] and its sum is 300



Example 2

Input

logs = [2, 3, 7]

limit = 100

Output

7

Explanation

No message needs to be truncated, so we return the max log size.


Solution :



title-img 




                        Solution in C++ :

int solve(vector<int>& logs, int limit) {
    int n = logs.size();
    int low = 0, high = *max_element(begin(logs), end(logs));
    auto check = [&](int mid) {
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum += (logs[i] <= mid ? logs[i] : mid);
        }
        return sum <= limit;
    };
    while (low <= high) {
        int mid = (low + high) / 2;
        if (check(mid)) {
            low = mid + 1;
        } else {
            high = mid - 1;
        }
    }
    return high;
}
                    




                        Solution in Python : 
                            
class Solution:
    def solve(self, logs, limit):
        s, n = 0, len(logs)
        for i, x in enumerate(sorted(logs)):
            if s + x * (n - i) >= limit:
                return (limit - s) // (n - i)
            s += x
        return max(logs)


View More Similar Problems

Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →

Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

View Solution →

Insert a Node at the head of a Linked List

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

View Solution →

Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

View Solution →

Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

View Solution →

Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →