LogStarERP Software Developer Interview Questions and Answers

Check if left child is less than right child in a binary tree

• Traverse the tree recursively and compare left and right child values

• Use a stack to traverse the tree iteratively and compare left and right child values

• Return true if all left children are less than right children, else false

Use built-in string method to check substring presence for faster execution.

• Use 'indexOf' method to check if substring is present in the main string.

• If the method returns -1, the substring is not present.

• If the method returns a non-negative integer, the substring is present.

App performance analysis involves identifying and resolving bottlenecks to improve user experience.

• Collect and analyze performance metrics such as response time, CPU usage, memory usage, and network latency.

• Identify and prioritize bottlenecks based on impact on user experience and frequency of occurrence.

• Implement optimizations such as caching, code refactoring, and database tuning.

• Continuously monitor and test perform...read more

To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.

• For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.

• To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.

The question is about finding the last number in a circular queue that has the highest number of digits.

• Implement a circular queue data structure

• Iterate through the circular queue to find the last number with the highest number of digits

• Compare the number of digits of each number in the circular queue

• Keep track of the last number with the highest number of digits

Print all downward paths from any node in a binary tree with sum of elements equal to N.

• Traverse the binary tree and keep track of the sum of elements in the path from root to current node.

• If the sum equals N, print the path from root to current node.

• Recursively traverse the left and right subtrees with updated sum.

• Use a stack to keep track of the current path being traversed.

• Example: Binary tree with root 1, left chil...read more

Yes, it is possible to get the accurate result from the given data.

• The coordinates (i,j,k) where metallic balls are present can be determined by finding the set elements in both matrix1 and matrix2.

• Additional data is not required as the given data is sufficient to determine the coordinates.

• The coordinates can be obtained by iterating through the elements of matrix1 and matrix2 and checking for set elements.

To find n-k th element from last in a string of unknown length

• Traverse the string to find its length

• Calculate the position of n-k th element from last

• Traverse the string again to find the element at calculated position

Count the number of unique occurrences in an array of strings.

• Create a hash table to store the count of each string occurrence.

• Iterate through the array and update the count in the hash table.

• Count the number of unique occurrences by counting the number of keys in the hash table.