Filter interviews by
Be the first one to contribute and help others!
The person can escape the island by creating a firebreak or finding a body of water.
Create a firebreak by clearing a path of grass around oneself to prevent the fire from spreading.
Look for a body of water such as a lake, river, or ocean to escape the fire.
If no water source is available, try to find a sheltered area with less dry grass to wait for the fire to pass.
Use any available tools or materials to help create a
A C code that prints out the elements of an array of strings.
Declare an array of strings
Use a loop to iterate through the array
Print out each element
The probability of rain in Chennai today depends on various factors such as season, weather conditions, and location.
The probability can be estimated by analyzing the current weather patterns and historical data.
Factors such as humidity, temperature, and wind speed can affect the probability of rain.
Local weather forecasts and satellite imagery can also provide insights into the likelihood of rain.
The probability of ra...
It is impossible to accurately predict the probability of India winning the next Cricket World Cup.
Sports events are unpredictable and depend on various factors such as team performance, weather conditions, injuries, etc.
Past performance of the team and individual players can be considered, but it does not guarantee future success.
Other teams participating in the tournament also play a significant role in determining t...
I am a software engineer with experience in developing web applications and expertise in programming languages such as Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using frameworks such as Spring and Django
Familiarity with database technologies such as MySQL and MongoDB
Strong problem-solving and analytical skills
Ability to work in a team and collaborate ef
In the next 5 years, I see myself as a senior software engineer leading a team of developers.
I plan to continue learning and expanding my skillset
I hope to take on more leadership roles and mentor junior developers
I aim to contribute to the development of innovative software solutions
I plan to stay up-to-date with the latest technologies and industry trends
Find sum of all numbers formed from root to leaf path in a binary tree
Traverse the binary tree using DFS
At each leaf node, add the number formed from root to leaf path to a sum variable
Return the sum variable
Time complexity: O(n)
Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25
Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.
Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string
Preorder traversal without recursion
Use a stack to keep track of nodes
Push right child first and then left child onto stack
Pop top of stack and print value
Repeat until stack is empty
Find longest continuous patch on a 12 km road with updates in patches
Maintain a variable to keep track of current patch length
Update the variable whenever a new patch is added
Maintain a variable to keep track of longest patch so far
Compare current patch length with longest patch length and update if necessary
Use a sorted data structure like a binary search tree to store the patches for efficient search
Time complexity: ...
Find median of an unsorted array.
Sort the array and find the middle element
Use quickselect algorithm to find the median in O(n) time
If the array is small, use brute force to find the median
Find 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of closest elements.
Update the queue as new characters come in.
Return the 'k' closest elements from the queue.
Design a data structure with O(1) insert, remove, find-max, and delete-max operations.
Use a doubly linked list to maintain the elements in sorted order.
Use a hash table to store the pointers to the nodes in the linked list.
Maintain a pointer to the maximum element in the hash table.
Update the pointers in the hash table when inserting or removing elements.
Update the maximum pointer when deleting or inserting the maximum
Check if a given linked list is a palindrome.
Traverse the linked list and store the values in an array.
Compare the first and last elements of the array, then move towards the center.
If all elements match, the linked list is a palindrome.
Alternatively, use two pointers to find the middle of the linked list and reverse the second half.
Compare the first half with the reversed second half to check for a palindrome.
based on 1 review
Rating in categories
TCS
Accenture
Wipro
Cognizant