10+ Cauvery Technologies Interview Questions and Answers

Currently working on developing a web application for a healthcare company.

• Utilizing React.js for front-end development

• Implementing RESTful APIs using Node.js and Express

• Working with a PostgreSQL database for data storage

The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.

• Convert the string to lowercase and remove all symbols and whitespaces.

• Reverse the modified string and compare it with the original string.

• If they are equal, then the string is a palindrome.

• If not, then the string is not a palindrome.

The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.

• Initialize two variables, maxSum and currentSum, both set to the first element of the array.

• Iterate through the array from the second element.

• For each element, update currentSum by adding the element to it.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• After iterating through the array, maxSum will contain the maximum subarra...read more

The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.

• Use dynamic programming to solve the problem efficiently.

• Create an array to store the minimum steps required for each number from 1 to N.

• Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.

• Return the minimum steps for N.

The task is to find the length of the longest palindromic subsequence in a given string.

• Iterate through the string and create a 2D array to store the lengths of palindromic subsequences.

• Use dynamic programming to fill the array based on the characters in the string.

• Consider the cases where characters match or do not match to update the array values.

• Return the length of the longest palindromic subsequence for each test case.

The task is to find the integral part of the square root of a given number.

• Use the built-in square root function to find the square root of the number.

• Convert the result to an integer by rounding down or using the floor function.

• Print the integer part of the square root as the output.

Check if two strings follow the same pattern based on bijection between letters and words.

• Iterate through each letter in T and corresponding word in S to create a mapping.

• Use a hashmap to store the mapping between letters and words.

• Check if the mapping is consistent for all test cases.

Implement a function to return the level order traversal of a binary tree of integers.

• Create a queue to store nodes for level order traversal

• Start with the root node and enqueue it

• While the queue is not empty, dequeue a node, print its value, and enqueue its children

• Repeat until all nodes are traversed

Given a linked list of ninja villages, find the next greater ninja strength in the nearest linked village.

• Traverse the linked list and store the elements in an array.

• Use a stack to keep track of elements with no next greater element found yet.

• Iterate through the array to find the next greater element for each village.

• Return the array of next greater elements for each village.

To target the right customer segment for a premium credit card, I would analyze customer data, conduct market research, and create targeted marketing campaigns.

• Conduct market research to identify potential customer segments who are likely to be interested in a premium credit card.

• Analyze existing customer data to understand spending habits, income levels, and credit history to identify potential target segments.

• Create targeted marketing campaigns that highlight the benefits a...read more

Finding sub sudoko in a multi-dimensional integer array.

• Iterate through each row and column to find sub-sudoku

• Check if each sub-grid contains all numbers from 1 to 9

• If yes, then it is a sub-sudoku

• If no, then move to the next sub-grid