Nutanix
20+ Scheduled Caste Welfare Lal Darvaja Interview Questions and Answers
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
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.
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
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.
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
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.
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
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
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
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
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
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.
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
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
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
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.
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
Q10. A list/array/vector of string is given. return the first index of repeating elements. The problem was quite straight-forward
Q11. Test Scenario for Google Login Page Puzzle about 9 identical coins where 1 coin is of slightly higher weight. TCP vs UDP
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
Q13. Write a code to check whether anagram of a given string is palindrome or not.
Q14. Definition of Classes and Objects with relevant examples
Q15. What is your driving force
My driving force is to create impactful solutions that solve real-world problems.
I am motivated by the opportunity to make a positive impact on society
I enjoy the challenge of solving complex problems
I am driven by the desire to continuously improve and innovate
I am passionate about technology and its potential to improve people's lives
Q16. Merge two sorted array
Q17. Remove duplicates from the string
Q18. What are static variables?
Q19. What is use of PostgreSQL?
Q20. Test Scenario for calculator
Q21. How did you find the server went down
Q22. how did you find gateway in linux
Q23. What is Operating System
An operating system is a software that manages computer hardware and provides services for computer programs.
Manages computer hardware resources such as CPU, memory, and storage
Provides a user interface for interacting with the computer
Supports running applications and managing processes
Examples include Windows, macOS, Linux, iOS, Android
Q24. Difference between HTTPS and HTTP
HTTPS is a secure version of HTTP that encrypts data transmitted between a website and a user's browser.
HTTPS uses SSL/TLS encryption to secure data transmission
HTTP sends data in plain text, making it vulnerable to interception
HTTPS is indicated by a padlock icon in the browser's address bar
Websites that handle sensitive information like banking or shopping use HTTPS
Q25. How actually DNS works
Q26. Why NAT is needed
NAT is needed to allow multiple devices on a private network to share a single public IP address.
NAT helps conserve public IP addresses by allowing multiple devices on a private network to communicate with the internet using a single public IP address.
NAT provides an additional layer of security by hiding the internal IP addresses of devices on the private network from external sources.
NAT allows for easier management of IP addresses within a network by simplifying the routin...read more
Q27. parameters of IOSTAT in linux
Q28. Explain about Deadlocks
Deadlocks occur when two or more processes are waiting for each other to release resources, resulting in a standstill.
Deadlocks involve a circular wait, where each process is waiting for a resource held by another process.
Four conditions must be met for a deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait.
Examples of deadlocks include a printer waiting for a computer to release a file, while the computer is waiting for the printer to finish p...read more
Q29. Design a QA chatbot
A QA chatbot designed to answer questions related to quality assurance processes and best practices.
Implement natural language processing to understand user queries
Create a knowledge base of QA processes, tools, and methodologies
Provide accurate and relevant answers to user questions
Offer interactive features like quizzes or tutorials to engage users
More about working at Nutanix
Top HR Questions asked in Scheduled Caste Welfare Lal Darvaja
Interview Process at Scheduled Caste Welfare Lal Darvaja
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month