Randomized Binary Search - Google Top Interview Questions


Problem Statement :


Consider a modified binary search, where instead of picking the middle element as the pivot, we pick it randomly between the low and the high indices.

Given a list of integers nums that's not necessarily sorted, return the number of elements that will always be found using this modified binary search.

Constraints

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

Example 1

Input


nums = [1, 10, 5, 20]

Output

2

Explanation

We can always find the elements 1 and 20. For the element 5, if we had picked index 1 as the first pivot, 
we wouldn't be able to find it. Similarly for 10, if we had picked index 2 as the first pivot, it wouldn't be 
found.



Example 2

Input

nums = [0, 0]

Output

0

Explanation

For the first element, if we search for 0 we may have index 1 as the pivot and miss it. Similarly, if we 
search for the second element, we may get index 0 as the pivot. In both cases, we miss the elements.


Solution :



title-img 




                        Solution in C++ :

int maxp[100005];
int mins[100005];
int solve(vector<int>& v) {
    if (v.size() == 0) {
        return 0;
    }
    int n = v.size();
    maxp[0] = v[0];
    for (int i = 1; i < n; i++) {
        maxp[i] = max(maxp[i - 1], v[i]);
    }
    mins[n - 1] = v[n - 1];
    for (int i = n - 2; i >= 0; i--) {
        mins[i] = min(mins[i + 1], v[i]);
    }
    int ret = 0;
    for (int i = 0; i < n; i++) {
        bool prefixgood = i == 0 || v[i] > maxp[i - 1];
        bool suffixgood = i == n - 1 || v[i] < mins[i + 1];
        ret += prefixgood && suffixgood;
    }
    return ret;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[] nums) {
        int max = Integer.MIN_VALUE, min = Integer.MAX_VALUE, ct = 0;
        boolean[] beg = new boolean[nums.length];
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > max)
                beg[i] = true;
            max = Math.max(max, nums[i]);
        }
        for (int i = nums.length - 1; i > -1; i--) {
            if (nums[i] < min && beg[i] == true)
                ct++;
            min = Math.min(min, nums[i]);
        }
        return ct;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, nums):
        # all elements on the left should be smaller than cur element
        # all elements on the right should be greater than cur element
        leftMax = [i for i in nums]
        rightMin = [i for i in nums]

        # the number of occurance has to be unique!
        freq = collections.Counter(nums)

        for i in range(1, len(nums)):
            leftMax[i] = max(leftMax[i], leftMax[i - 1])

        for i in range(len(nums) - 2, -1, -1):
            rightMin[i] = min(rightMin[i], rightMin[i + 1])

        res = 0

        # now at each position check!!!
        # if leftMax is = to rightMin then we are always going to be found!
        # but make sure you are not having any duplicate
        for i in range(0, len(nums)):
            if freq[nums[i]] == 1 and leftMax[i] == rightMin[i]:
                res += 1

        return res


View More Similar Problems

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 →

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →

Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →

Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →

Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →

Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →