Virtual Boolean Array - Google Top Interview Questions


Problem Statement :


Implement a boolean array which implements the following methods:

BooleanArray() which initializes an array of size 2 ** 31 with all false values.

void setTrue(int i) which sets the value at index i to true.

void setFalse(int i) which sets the value at index i to false.

void setAllTrue() which sets the value at every index to true.

void setAllFalse() which sets the value at every index to false.

boolean getValue(int i) which returns the value at index i.

Constraints



0 ≤ n ≤ 100,000 where n is the number of method calls

Example 1

Input

methods = ["constructor", "getValue", "setAllTrue", "getValue", "setFalse", "getValue"]

arguments = [[], [9], [], [3], [4], [4]]`

Output

[None, False, None, True, None, False]

Explanation

a = BooleanArray()

a.getValue(9) == False

a.setAllTrue()

a.getValue(3) == True

a.setFalse(4)

a.getValue(4) == False

Example 2

Input

methods = ["constructor", "setTrue", "getValue", "setFalse", "getValue"]

arguments = [[], [5], [5], [5], [5]]`

Output

[None, None, True, None, False]

Explanation

a = BooleanArray()

a.setTrue(5)

a.getValue(5) == True

a.setFalse(5)

a.getValue(5) == False


Solution :



title-img 




                        Solution in C++ :

class BooleanArray {
    public:
    bool base = false;
    set<int> diffs;

    BooleanArray() {
        base = false;
        diffs.clear();
    }

    void setTrue(int i) {
        if (base == false)
            diffs.insert(i);
        else
            diffs.erase(i);
    }

    void setFalse(int i) {
        if (base == true)
            diffs.insert(i);
        else
            diffs.erase(i);
    }

    void setAllTrue() {
        base = true;
        diffs.clear();
    }

    void setAllFalse() {
        base = false;
        diffs.clear();
    }

    bool getValue(int i) {
        return (base == true ? (diffs.count(i) > 0 ? false : true)
                             : (diffs.count(i) > 0 ? true : false));
    }
};
                    


                        Solution in Java :

import java.util.*;

class BooleanArray {
    public Map<Integer, Boolean> map;
    public boolean allTrue;

    public BooleanArray() {
        map = new HashMap<>();
    }

    public void setTrue(int i) {
        map.put(i, true);
    }

    public void setFalse(int i) {
        map.put(i, false);
    }

    public void setAllTrue() {
        map.clear();
        allTrue = true;
    }

    public void setAllFalse() {
        map.clear();
        allTrue = false;
    }

    public boolean getValue(int i) {
        if (map.containsKey(i))
            return map.get(i);
        return allTrue;
    }
}
                    


                        Solution in Python : 
                            
class BooleanArray:
    def __init__(self):
        self.arr = {}
        self.default = False

    def setTrue(self, i):
        self.arr[i] = True

    def setFalse(self, i):
        self.arr[i] = False

    def setAllTrue(self):
        self.arr = {}
        self.default = True

    def setAllFalse(self):
        self.arr = {}
        self.default = False

    def getValue(self, i):
        if i not in self.arr:
            return self.default

        return self.arr[i]

immortal
96

1 year ago
Even more compact memory footprint depending upon assignment.

class BooleanArray:
    def __init__(self):
        self.state = False
        self.d = set()

    def clear(self):
        self.d = set()

    def setTrue(self, i):
        if not self.state:
            self.d.add(i)
        elif i in self.d:
            self.d.remove(i)

    def setFalse(self, i):
        if self.state:
            self.d.add(i)
        elif i in self.d:
            self.d.remove(i)

    def setAllTrue(self):
        self.clear()
        self.state = True

    def setAllFalse(self):
        self.clear()
        self.state = False

    def getValue(self, i):
        if i in self.d:
            return not self.state
        return self.state


View More Similar Problems

Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →

Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

View Solution →

Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t

View Solution →

Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

View Solution →

Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

View Solution →

Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

View Solution →