Add office photos
Employer?
Claim Account for FREE

Nutanix

3.7
based on 159 Reviews
Video summary
Filter interviews by

10+ Mckinley Rice Creativity Interview Questions and Answers

Updated 5 Feb 2024
Popular Designations

Q1. Minimum Number of Platforms Problem

Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.

Explanation:

Given two arrays:

  • AT - representing the ar...read more
Ans.

Determine the minimum number of platforms needed at a railway station so that no train has to wait.

  • Sort the arrival and departure times arrays in ascending order.

  • Initialize two pointers for arrival and departure times, and a variable to keep track of the maximum number of platforms needed.

  • Increment the platform count when a train arrives and decrement when a train departs.

  • Update the maximum platform count as needed.

  • Return the maximum platform count at the end.

Add your answer

Q2. Split the String Problem Statement

You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such that one ...read more

Ans.

Determine if it is possible to split a string into three non-empty substrings where one is a substring of the other two.

  • Check if any substring of the string is a substring of the other two substrings.

  • Iterate through all possible divisions of the string into three non-empty substrings.

  • Use two pointers to find all possible substrings efficiently.

Add your answer

Q3. Loot Houses Problem Statement

A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determine the...read more

Ans.

Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.

  • Create an array 'dp' to store the maximum money that can be stolen up to the i-th house.

  • Iterate through the houses and update 'dp' based on whether the current house is stolen or not.

  • Return the maximum value in 'dp' as the answer.

Add your answer

Q4. Ninja and Stack of Boxes Problem

Help Ninja to create the tallest stack possible using given 3-D boxes with dimensions Length 'L', Breadth 'B', and Height 'H'. Each box can be rotated to use any side as the bas...read more

Ans.

Implement a function to find the maximum possible height of a stack of boxes given their dimensions.

  • Create all possible rotations of each box to consider all orientations for stacking

  • Sort the boxes based on their base dimensions in non-increasing order

  • Use dynamic programming to find the maximum height of the stack

Add your answer
Discover Mckinley Rice Creativity interview dos and don'ts from real experiences

Q5. Reverse Edges Problem Statement

You are given a directed graph with ‘N’ nodes and ‘M’ edges, along with two specific nodes, ‘A’ and ‘B’. Your task is to find the minimum number of operations required to create ...read more

Ans.

The task is to find the minimum number of operations required to create a valid path from node A to node B by reversing edges in a directed graph.

  • Iterate through the graph to find the shortest path from node A to node B.

  • Use a graph traversal algorithm like BFS or DFS to explore possible paths.

  • Track the number of edge reversals needed to reach node B from node A.

  • Consider edge directions and reverse them as needed to create a valid path.

  • Return the minimum number of edge reversa...read more

Add your answer

Q6. Query and Matrix Problem Statement

You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types:

Query 1: 1 R index
Query ...read more
Ans.

Implement a function to process queries on a binary matrix by flipping elements and counting zeros in rows/columns.

  • Create a binary matrix with all elements initialized to 0.

  • Process queries of type 1 by flipping elements in the specified row/column.

  • Process queries of type 2 by counting the number of zeros in the specified row/column.

  • Return the count of zeros for type 2 queries.

  • Ensure to handle the constraints provided in the problem statement.

Add your answer

Q7. Longest Increasing Path in Matrix Problem Statement

Given a 2-D matrix mat with 'N' rows and 'M' columns, where each element at position (i, j) is mat[i][j], determine the length of the longest increasing path ...read more

Ans.

The task is to find the length of the longest increasing path in a matrix starting from a given cell.

  • Create a recursive function to explore all possible paths from the starting cell, keeping track of the length of each path.

  • Use dynamic programming to avoid redundant calculations and optimize the solution.

  • At each cell, check if moving to the right or down is possible and leads to an increasing path.

  • Update the length of the longest increasing path found so far as you explore di...read more

Add your answer

Q8. Lexicographic Permutation Rank Problem Statement

Given a distinct string, determine the lexicographic permutation rank of the string.

Example:

Input:
T = 2
S = "abc"
S = "bac"
Output:
1
2
Explanation:

For the firs...read more

Ans.

The problem involves determining the lexicographic permutation rank of a distinct string.

  • Iterate through all permutations of the string and compare with the given string to determine the rank.

  • Use a recursive function to generate all permutations of the string.

  • Keep track of the count of permutations smaller than the given string to determine the rank.

Add your answer
Q9. Can you describe the system design you created for Pastebin and the set of requirements you had to fulfill?
Ans.

Designed a scalable system for Pastebin with various requirements.

  • Implemented a distributed system architecture to handle high traffic and ensure reliability.

  • Used load balancing techniques to evenly distribute incoming requests across multiple servers.

  • Implemented data sharding to partition data across multiple databases for efficient storage and retrieval.

  • Utilized caching mechanisms to improve performance and reduce latency.

  • Implemented access control mechanisms to ensure data...read more

Add your answer
Q10. What are effective paging techniques, and how do you count page faults?
Ans.

Effective paging techniques help reduce page faults, which are counted by tracking the number of times a page is accessed from disk.

  • Implementing LRU (Least Recently Used) algorithm to replace the page that has not been used for the longest time.

  • Using FIFO (First In, First Out) algorithm to replace the oldest page in memory.

  • Utilizing optimal page replacement algorithm to replace the page that will not be used for the longest time in the future.

  • Counting page faults by tracking ...read more

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
75 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter