I\'ve been recently asked this question in the onsite interview:\nYou are required to design a memory allocation class for an bigArray, which will have below methods:\n\n```\nint bigArray[10000] -> Not necessarily int[], can be anything(Should not modify array)\n\nint allocateSlice(int size){\n // allocate a contiguous slice of length size in the array and return the starting index from where data can be stored\n}\n\nint freeSlice(int startIndex){\n // de-allocate a contiguous slice starting at startIndex, with size it has been allocated earlier\n}\n\n```\n\nI was able to come up with an approach but don\'t think it was scaleable and would pass all test cases! \nCan you guys tell me your thoughts on possible solutions?\n\n#Google #Design

I\'ve been recently asked this question in the onsite interview:\nYou are required to design a memory allocation class for an bigArray, which will have below me