Swimlane Interview Questions and Answers

To check if a number is a power of 2, we can use bitwise operations.

• A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.

• If n is a power of 2, then n & (n-1) will be 0.

• For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.

Sort a stack without using another data structure

• Use recursion to pop the top element and insert it at the bottom of the remaining stack

• Repeat until the stack is sorted in ascending order

• Time complexity: O(n^2), space complexity: O(n) due to recursion

Check if array has continuous increasing and decreasing values

• Loop through the array and check if each element is greater than the previous one

• Once you find the maximum element, check if the remaining elements are in decreasing order

• If yes, return true else false

Design a cricinfo (LLD)

• Identify the entities: players, teams, matches, scorecards, tournaments, etc.

• Define the relationships between entities

• Create a database schema to store the data

• Implement APIs to fetch and update data

• Design a UI to display the information

• Consider scalability and performance

• Ensure data security and privacy

To resolve space issue with GET API request, consider pagination, compression, caching, and optimizing query parameters.

• Implement pagination to limit the number of results returned in each request.

• Use compression techniques like Gzip to reduce the size of the response data.

• Implement caching mechanisms to store frequently accessed data and reduce the number of requests.

• Optimize query parameters to only request necessary