Intech Dmls R&D Engineer Interview Questions and Answers

Simple basic application

Q1. Technical knowledge and some more personal information
Add your answer
Q2. Related to framework and api part
Add your answer
Q3. Php laravel question
Add your answer

Q1. Final round with salary negotiation
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

A time range is given you can attempt with in that time and once started you cant resume .

Q1. 
Sort String with Alternate Lower and Upper Case
Given a string STR containing both lowercase and uppercase letters, the task is to sort the string so that the resulting string contains uppercase and lower...read more
Ans. 
Sort a string with alternate lowercase and uppercase letters in sorted order.
• Create two separate arrays for lowercase and uppercase letters.

• Sort both arrays individually.

• Merge the two arrays alternately to form the final sorted string.
Answered by AI
Add your answer
Q2. 
Remove Invalid Parentheses
Given a string containing only parentheses and letters, your goal is to remove the minimum number of invalid parentheses to make the input string valid and return all possible v...read more
Ans. 
Given a string with parentheses and letters, remove minimum invalid parentheses to make it valid and return all possible valid strings.
• Use BFS to explore all possible valid strings by removing parentheses one by one

• Keep track of visited strings to avoid duplicates

• Return all unique valid strings obtained after removing minimum number of parentheses
Answered by AI
Add your answer
Q3. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

• Start with base cases F(1) and F(2) as 1, then iterate to calculate F(N) efficiently.

• Time complexity can be optimized to O(N) using dynamic programming.

• Example: For N = 5, the 5th Fibonacci number is 5.
Answered by AI
Add your answer
Q4. 
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 ...read more
Ans. 
To find the Kth row of Pascal's Triangle given a non-negative integer K.
• Create an array to store the values of the Kth row of Pascal's Triangle

• Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the values

• Return the array as the output
Answered by AI
Add your answer

A simple aptitude test with basic questions asked

Simple logic based questions.

Q1. Basic coding knowledge,SQL,were asked.
Add your answer

Q1. Just focus on sql and leetcode
Add your answer
Q2. What is joins in sql
Ans. 
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
• Joins are used to retrieve data from multiple tables based on a related column

• Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN

• Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
Answered by AI
Add your answer
Q3. Reverse the array
Ans. 
Reverse the array of strings
• Create a new array and iterate through the original array in reverse order, adding each element to the new array

• Use built-in array methods like reverse() or spread operator for a more concise solution

• Ensure to handle edge cases like empty array or array with only one element
Answered by AI
Add your answer

Normal aptitude test

SQL Questions and one problem

Q1. SQL Questions and Logical Questionsa
Add your answer

All three questions are leetcode medium level.

10th level aptitude problem.

Q1. Discuss about my current project and DBMS and mysql
Add your answer