Filter interviews by
Be the first one to contribute and help others!
I appeared for an interview in Dec 2020.
Round duration - 40 minutes
Round difficulty - Easy
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
Count the total number of subsequences in which all elements are equal in an integer array.
Iterate through the array and count the frequency of each element.
Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).
Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Tip 1 : Do practice as much as you can
Tip 2 : Coding is key to crack
Tip 1 : It should look nice
Tip 2 : Skills should be mentioned properly
I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.
Software configuration management is the process of tracking and controlling changes made to software throughout its lifecycle.
It involves version control, build management, and release management.
It ensures that changes are made in a controlled and systematic manner.
Examples include Git, SVN, and Jenkins.
It helps to maintain the integrity and quality of the software.
It is essential for collaboration among team members...
Software requirements are the functional and non-functional specifications that a software system must meet.
Software requirements define what the software should do and how it should behave
They include functional requirements (what the software should do) and non-functional requirements (how well it should do it)
Requirements are typically documented in a requirements specification document
They are used to guide the dev...
I appeared for an interview in Nov 2020.
Round duration - 2 hours
Round difficulty - Medium
In the 1st round
Aptitude
Reasoning
English
Automata fix( code debug)
Timing in morning
Environment is good
Interviewer was very cool and interactive
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...
Implement a function to encode a text message using run-length encoding.
Iterate through the message and count consecutive characters
Append the character and its count to the encoded message
Handle edge cases like single characters or empty message
Round duration - 30 minutes
Round difficulty - Medium
This is interview round
Ques from basic electronics
C language
Create a class named Person
with a string variable 'name'
and an integer variable 'age'
, such that these variables are not accessible outside the class. Implement a me...
Create a class Person with private variables name and age, and methods to set and get their values.
Create a class Person with private variables 'name' and 'age'.
Implement a method setValue to set the variables' values.
Implement a method getValue to print the variables' values.
Ensure the name is a non-empty string and the age is a non-negative integer.
Encapsulate the data and provide a clear interface for setting and ge...
Tip 1 : Do aptitude from indiabix. Go through your basics. At least one language u know. Learn about your branch basics. Know concept of data structure and oops.
Tip 2 : prepare your final project well.
Tip 1 : the skills you know very well mention in resume
Tip 2 : mention project in resume
HTML
Aptitude and resume shortlist and HTML
I appeared for an interview before Jun 2021.
Round duration - 120 minutes
Round difficulty - Medium
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 the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Given a linked list where each node contains two pointers: one pointing to the next node and another random pointer that can point to any node within the list (or ...
Create a deep copy of a linked list with random pointers.
Iterate through the original linked list and create a new node for each node in the list.
Store the mapping of original nodes to new nodes in a hashmap to handle random pointers.
Update the random pointers of new nodes based on the mapping stored in the hashmap.
Return the head of the copied linked list.
Round duration - 60 Minutes
Round difficulty - Medium
Given an arbitrary array arr
consisting of N
non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...
Find the element that appears only once in an array where every other element appears thrice.
Use bitwise operations like XOR to find the unique element in linear time complexity.
XOR all elements in the array, the result will be the unique element.
Elements that appear thrice will cancel out each other in XOR operation.
Example: arr = [2, 2, 3, 2], XOR of all elements = 3 which is the unique element.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until a greater element is found or stack is empty
Round duration - 60 Minutes
Round difficulty - Medium
Given a Binary Search Tree (BST) of integers, your task is to convert it into a greater sum tree. In the greater sum tree, each node's value should be replaced with the sum...
Convert a Binary Search Tree into a Greater Sum Tree by replacing each node's value with the sum of all nodes' values greater than the current node's value.
Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.
Keep track of the running sum of visited nodes' values and update each node's value with this sum.
Recursively apply the above steps to all nodes in the BST.
Example: For input ...
You are given a linked list of N
nodes where each node contains values 0, 1, and 2 exclusively. Your task is to sort the linked list.
The first line contains an...
Sort a linked list containing values 0, 1, and 2 exclusively.
Use three pointers to keep track of nodes with values 0, 1, and 2 separately.
Traverse the linked list and move nodes to their respective positions based on their values.
Finally, concatenate the three lists in the order 0 -> 1 -> 2 to get the sorted linked list.
Round duration - 45 minutes
Round difficulty - Medium
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider edge cases like when the matrix is empty or when all cells are water (0s).
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
Find the maximum sum that can be obtained from a path in a matrix from the first row to the last row.
Use dynamic programming to keep track of the maximum sum at each cell.
Consider moving down, down-left, and down-right to calculate the maximum sum.
Start from the second row and update the values based on the maximum sum from the row above.
At the end, find the maximum sum in the last row to get the final result.
Tip 1 - Practice variety of questions
Tip 2 - Do atleast 2 projects
Tip 1 : Do good projects
Tip 2 : resume should be one page
Structural Design Engineer
8
salaries
| ₹3.5 L/yr - ₹5.9 L/yr |
tekla steel detailer
7
salaries
| ₹2.4 L/yr - ₹3.8 L/yr |
Structural Engineer
4
salaries
| ₹2.2 L/yr - ₹4.6 L/yr |
Draughtsman Mechanical
4
salaries
| ₹6 L/yr - ₹7.5 L/yr |
Junior Design Engineer
4
salaries
| ₹3.2 L/yr - ₹3.2 L/yr |
TCS
Accenture
Wipro
Cognizant