Number of Non-Overlapping Sublists With Sum of Target - Google Top Interview Questions


Problem Statement :


You are given a list of integers nums and an integer target. 

Return the maximum number of non-overlapping, non-empty sublists that exist such that each sublist's sum is target.

Constraints

0 ≤ n ≤ 100,000 where n is the length of nums

Example 1

Input

nums = [4, 3, 7, 5, -3, 10]

target = 7

Output

3

Explanation

We can have [4, 3], [7] and [-3, 10]


Solution :



title-img 




                        Solution in C++ :

int solve(vector<int>& nums, int target) {
    unordered_set<int> m{0};
    int ans = 0;
    for (int i = 0, s = 0; i < nums.size(); i++) {
        s += nums[i];
        if (m.find(s - target) != m.end()) {
            ans++;
            m.clear();
        }
        m.insert(s);
    }
    return ans;
}
                    




                        Solution in Python : 
                            
class Solution:
    def solve(self, nums, target):
        s = 0
        a = {0: 0}
        n = len(nums)
        b = [0] * (n + 1)
        for i, x in enumerate(nums):
            s += x
            b[i + 1] = b[i]
            if s - target in a:
                b[i + 1] = max(b[i + 1], b[a[s - target]] + 1)
            a[s] = i + 1
        return b[n]


View More Similar Problems

Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →

Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →

Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →

Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →

Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →