Filter interviews by
Be the first one to contribute and help others!
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...
Java is an object-oriented language while C is a procedural language.
Java is platform-independent while C is platform-dependent.
Java has automatic garbage collection while C requires manual memory management.
Java has built-in support for multithreading while C requires external libraries.
Java has a larger standard library compared to C.
Java is more secure than C due to its strong type checking and exception handling.
C ...
Pointers are variables that store memory addresses of other variables in programming languages.
Pointers allow direct access and manipulation of memory locations.
They are commonly used in programming languages like C and C++.
Pointers can be used to pass variables by reference, allowing modifications to the original value.
They can also be used to dynamically allocate memory.
Example: int* ptr; // declares a pointer to an
In 5 years, I see myself as a senior software engineer leading a team of developers.
Leading a team of developers
Working on complex projects
Continuing to learn and grow in my role
Contributing to the success of the company
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.
No, I am not a loner.
I enjoy working in a team and collaborating with others.
I believe that teamwork leads to better results.
I am comfortable working with people from diverse backgrounds.
I actively seek out opportunities to network and build relationships.
I am a good listener and value the opinions of others.
based on 2 reviews
Rating in categories
Graphic Designer
4
salaries
| ₹2.4 L/yr - ₹2.4 L/yr |
TCS
Accenture
Wipro
Cognizant