Altera Digital Health Software Developer Intern Interview Questions and Answers

Round duration - 7 days
Round difficulty - Easy

Web Development, Databases

Q1. Web App Designing Questions
Make an Entry Management web app.
Check-In: The Visitor is asked to enter his/her and Host’s details. Thereafter, an SMS and E-mail is sent to the Host giving the details of the V...read more
Ans. 
Tip 1 : It's easier if you have some basic knowledge of web development.
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was the final round and was a telephonic interview.

Q1.  Implementation: HashMap
Design a data structure that stores a mapping of a key to a given value and supports the following operations in constant time.
1. INSERT(key, value): Inserts an integer value to ...read more
Ans. 
I told the interviewer about every method that I know from the worst complexity to best complexity. They looked pretty satisfied.
Answered by CodingNinjas
View 1 more amswer
Q2.  Isomorphic Trees
You are given two arbitrary binary trees. You need to find if both trees are isomorphic or not.
Two binary trees are said to be isomorphic with each other, if one of the trees can be ob...read more
Ans. 
I told the interviewer about every method that I know from the worst complexity to best complexity. They looked pretty satisfied.
Answered by CodingNinjas
View 1 more amswer
Q3. DBMS, OOPS and OS
Mainly 3 subjects: Database Management System, Object-Oriented Programming and Operating Systems. A few questions were asked from these.
Add your answer

Q1. Technical round
Add your answer
Q2. Append element into Array question
Add your answer

Q1. Vector question on array
Add your answer

Q1. Vector based question less time complexity
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Q1. DBMS Question
Write a query to create an employee table with (employee_id, name, dept) with employee_id as its primary key
Ans. 
A query to create an employee table with employee_id, name, and dept columns, with employee_id as the primary key.
• Use the CREATE TABLE statement to create the employee table.

• Specify the data types and constraints for each column.

• Set the employee_id column as the primary key using the PRIMARY KEY constraint.
Answered by AI
View 1 more amswer
Q2. Inorder Traversal
You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to find the In-Order traversal of the given binary tree.
For example :
For the ...read more
Ans. 
The task is to find the in-order traversal of a given binary tree.
• Implement a recursive function to perform in-order traversal of the binary tree

• Start from the left subtree, then visit the root node, and finally visit the right subtree

• Use an array to store the values of the nodes in the in-order traversal
Answered by AI
View 4 more amswers

Round duration - 50 minutes
Round difficulty - Medium

Interview on google meet

Q1. DBMS Question
Given two tables, return a inner join on a common column (key)
Ans. 
The inner join operation combines rows from two tables based on a common column (key).
• Use the JOIN keyword in the SQL query to perform an inner join.

• Specify the common column (key) in the ON clause of the join.

• The result will contain only the matching rows from both tables.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. Search In A Row Wise And Column Wise Sorted Matrix
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. You are given a target integer 'X'. Find t...read more
Ans. 
Given a sorted matrix, find the position of a target integer in the matrix.
• Iterate through each row and column of the matrix

• Compare the target integer with the current element

• If the target integer is found, return the position

• If the target integer is not found, return {-1, -1}
Answered by AI
View 4 more amswers

Round duration - 3 Hours
Round difficulty - Hard

3 Coding questions ( 1 medium graph dfs based question , 2 hard level prefix array question ans 3 was a hard question which I don't remember)

2 Database question ( It mostly includes joining 2-3 tables and then you would be able to solve it)

Q1. Find Number Of Islands
You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.
A cell is said to be conn...read more
Ans. Flood Fill Algorithm
We can use the flood fill algorithm to check for all connected 1s.
 
• We create two arrays, dx, and dy, in which we store the unit vectors for all eight directions. Thus, when we are at a given cell, we can easily check for all its adjacent cells by simply looping over the two arrays, adding their values to the current position, and checking for this new position recursively.
• We will also create a ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Maximum Product Subarray
You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report t...read more
Ans. Brute-force
Steps:
1. Create an ans variable and initialize it to INT_MIN.
2. Run a loop i = 0 to N and do:
   • Run a loop j = i to N and do:
     • Create a variable, say currentProduct and initialize it to 1.
     • Run a loop k = i to j and do:
       • currentProduct = currentProduct * arr[k]
       • Store the maximum of ans and the currentProduct in the ans variable.
3. Finally, return the ans variable.
Space Complexity: O(1)Explanation:
O(1)
 
Constant space is u...read more
Answered by CodingNinjas
View 2 more amswers
Q3. DBMS Question
There were 3-4 models given and we had to join those models to get to the result.
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

These rounds depends on the type of interviewer.
My friends were asked questions from DSA but from me they asked a lot of questions on Node.JS and React.

Q1. Technical Questions
What are promises, await , all lifecycle methods of react?
What is recursion, explain your projects, explain docker
Ans. 
Tip 1 : Have good hands on development
 
Answered by CodingNinjas
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

This round depends on your interviewer.
My colleagues were asked questions from DS but my interviewer focused just on javascript.

Q1. Web Development based Questions
What are middlewares, controllers, how to design one middleware, what is jwt, reduce ,map and filter method usage and params.
What is an event looping in javascript and how do...read more
Ans. 
Tip 1 : Be focused on Development especially in Javascript
Answered by CodingNinjas
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was a managerial round they will test your communication and how well do you handle situations in your life

Q1. Basic HR question
What is one of the most challenging situations that you have faced in your life and how you handled it
Ans. 
Tip 1 : just be confident and communicate with them
 
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

3 DSA questions, 2 SQL questions
On the DoSelect platform, which was good

Q1. Matrix Chain Multiplication
You are given ‘N’ 2-D matrices and an array/list “ARR” of length ‘N + 1’ where the first ‘N’ integers denote the number of rows in the Matrices and the last element denotes the ...read more
Ans. 
It was a straightforward application of the matrix multiplication approach of DP
Answered by CodingNinjas
View 3 more amswers
Q2. Linear Probing
‘Hashing’ is a technique in which a large non-negative integer is mapped with a smaller non-negative integer using a function called ‘hash function’. Hash Table is the table in which we stor...read more
Ans. Linear Probing
The approach is pretty simple. We just need to find the mapping index and if it is occupied, we need to search for the next available index.
 
The algorithm for the same is as follows:
• Create an array HASH_TABLE of size N.
• Initialise every value of HASH_TABLE as -1.
• Loop for each KEY:
  • Initialize HASH = KEY % N
  • If HASH_TABLE[ HASH ] is already occupied, we perform:
    • while(HASH_TABLE[ HASH ] != -1):
      • HASH = ( HAS...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 minutes
Round difficulty - Easy

Started off with introductions and projects related questions.
Basic javascript and CSS property-related questions.
An easy DSA question

Q1. Two sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use t...read more
Ans. Hashing Solution
• We can store the frequency of every element in the array in a hashmap.
• We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
  • If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
  • Else, if the frequency of ARR[i] and Targ...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 45 minutes
Round difficulty - Easy

Introduction and two easy to medium DSA questions

Q1. Queue Using Two Stacks
You will be given ‘Q’ queries. You need to implement a queue using two stacks according to those queries. Each query will belong to one of these three types:
1 ‘X’: Enqueue element ...read more
Ans. Making the Enqueue operation costly
In this approach, we make sure that the oldest element added to the queue stays at the top of the stack, the second oldest below it and so on. To achieve this, we will need two stacks. 
 
First stack('STK1') is the main stack being used to store the data, while the second stack('STK2') is to assist and store data temporarily during various operations.
 
Following steps will...read more
Answered by CodingNinjas
View 1 more amswer
Q2.  Roman Numeral To Integer
Given a string that represents a roman number. Convert the roman number to an integer and return it.
Roman numerals are represented by seven different symbols: I, V, X, L, C, D,...read more
Ans. Recursive Approach
The key idea is to follow the rules of roman numbers which are as follows:
 
• The roman digits I, X and C are repeated up to three times in succession to form the numbers.
• When a digit of lower value is written to the right or after a digit of higher value, the values of all the digits are added.
• When a digit of lower value is written to the left or before a digit of higher value, then the value of th...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 150 minutes
Round difficulty - Easy

You can give the test any time. Environment was not very well. Questions were not well explained.

Q1. Divide String
Ninja has been given a string ‘WORD’ containing lower case alphabets. Ninja wants to know all the strings by dividing ‘WORD’ into ‘N’ strings of equal length.
For Example:
For ‘WORD’ =  “a...read more
Ans. Brute Force
First, check if the ‘WORD’ can be divided into ‘N’ strings of equal length or not.
 
• Check if the length of ‘WORD’ is a multiple of ‘N’ or not.
  • If ‘WORD’ is not a multiple of ‘N’ it means we can not divide ‘WORD’ into ‘N’ equal length strings and we simply return -1.
 
Calculate the possible length ‘len’ of  ‘N’ equal length strings.After getting the length, iterate the ‘WORD’ and for each substrin...read more
Answered by CodingNinjas
Add your answer
Q2. Paint House
You have been given ‘N’ houses, each house can be painted with any of three colours: green, red and yellow. You are also given a “cost” matrix of ‘N’ * 3 dimension which represents the cost of ...read more
Ans. Recursive Approach
The basic idea of this approach is to break the original problem into sub-problems. We will try to check each valid way of painting the houses. And, then find the minimum cost.

 Now, let us define a recursive function 
getMinCost(int i, int j)
Which returns the minimum cost to paint the first ‘i’ houses (0-th based indexing) such that the last house (i-th house) is painted with j-th colour.

&nb...read more
Answered by CodingNinjas
View 3 more amswers