Filter interviews by
DRS stands for Design Review Service and MRS stands for Manufacturing Review Service.
DRS is a service that reviews the design of a product to ensure it meets the required standards.
MRS is a service that reviews the manufacturing process of a product to ensure it meets the required standards.
Both services are commonly used in the oil and gas industry to ensure safety and quality of equipment.
DRS and MRS are often conduc...
DRS is Document Review Service while MRS is Material Review Service.
DRS involves reviewing documents related to the product or project.
MRS involves reviewing the materials used in the product or project.
DRS is focused on ensuring compliance with regulations and standards.
MRS is focused on ensuring the quality and suitability of materials.
DRS is typically done before production or construction begins.
MRS is typically do...
MDPE pipes are medium-density polyethylene pipes used for gas and water supply systems.
MDPE pipes have a higher pressure rating than LDPE pipes.
They are resistant to corrosion and chemicals.
MDPE pipes are flexible and easy to install.
Examples of MDPE pipes include Alkathene, Polypipe, and Philmac.
They are commonly used in gas and water supply systems.
A service regulator is a device that regulates the pressure of a gas or liquid in a pipeline or system.
It is used to maintain a constant pressure in a pipeline or system.
It can be used for various gases and liquids such as natural gas, propane, oxygen, and nitrogen.
It is commonly used in industrial and commercial applications such as in gas pipelines, HVAC systems, and welding equipment.
It works by reducing the pressur...
Various fittings are used in GI installation including elbows, tees, couplings, reducers, and flanges.
Elbows are used to change the direction of the pipe.
Tees are used to split the flow of the pipe into two directions.
Couplings are used to connect two pipes together.
Reducers are used to connect pipes of different sizes together.
Flanges are used to connect pipes to valves or other equipment.
Other fittings may include un
Top trending discussions
I applied via Referral and was interviewed in Mar 2020. There were 5 interview rounds.
I applied via Referral and was interviewed before Jan 2021. There were 4 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Company Website and was interviewed in Oct 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed before Apr 2020. There were 3 interview rounds.
SCD Type 2 is a technique used to track historical changes in data over time in a data warehouse.
SCD Type 2 maintains a separate row for each change in data, with a start and end date.
It requires a surrogate key to uniquely identify each row.
Informatica provides a built-in SCD Type 2 transformation to implement this technique.
Example: tracking changes in customer addresses over time.
Sales is the process of identifying potential customers, understanding their needs, and persuading them to purchase a product or service.
Identify potential customers through market research and lead generation
Understand the needs and pain points of customers by asking probing questions and active listening
Present the product or service in a compelling way, highlighting its features and benefits
Address any objections or...
I appeared for an interview before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The round was held on Google Meet and I was given 2 coding problems for which first I had to explain my approach and then I had to write code in Shared Google Docs and dry run on sample test cases and discuss Time and Space Complexity.
Given a binary tree with N
nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true
; otherwise, return false
.
A binary search tree (BST)...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both left and right subtrees are also binary search trees.
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
All the possibl...
Find the path from a leaf node to the root node with the maximum sum in a binary tree.
Traverse the binary tree from leaf to root while keeping track of the sum of each path.
Compare the sums of all paths and return the path with the maximum sum.
Use recursion to traverse the tree efficiently and keep updating the maximum sum path.
Round duration - 60 Minutes
Round difficulty - Medium
This was also a Data Structures and Algorithms round where I was asked to solve 2 coding problems explaining my approach with proper Complexity Analysis . After the coding questions were over there was some time left so the interviewer asked me some concepts related to DBMS.
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
You are given a binary tree with 'N' nodes. Your task is to determine the size of the largest subtree within the binary tree which is also a Binary Search Tree (BST).
...Find the size of the largest subtree in a binary tree that is also a Binary Search Tree.
Traverse the tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use recursion to solve this problem efficiently.
Example: For the input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the largest BST subtree has a size of 3.
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
Types of indexes include B-tree, hash, and bitmap indexes.
Indexes can improve the performance of SELECT queries but may slow down INSERT, UPDATE, and DELETE operation...
Round duration - 50 Minutes
Round difficulty - Medium
This round also had 2 questions related to DS and Algo . One was from graphs and the other was an implementation of a LRU Cache . There were 2 interviewers and both of them were quite friendly and helpful. Overall, this round went well.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges (edges that point to an ancestor node).
Maintain a visited array to keep track of visited nodes and a recursion stack to keep track of nodes in the current path.
If a back edge is found during traversal, a cycle exists in the graph.
Return true if a cycle is detected, false otherwise.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when inserting new items.
Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.
Implement get(...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Campus Placement and was interviewed before Feb 2021. There were 3 interview rounds.
One question of 3 hrs with 50 test cases all needed to pass.
My family background is diverse and multicultural, with members from different professions and backgrounds.
My father is a doctor and my mother is a teacher.
I have two siblings, one is an engineer and the other is a lawyer.
We have relatives living in different countries, including the USA, India, and Australia.
Our family gatherings are always filled with interesting conversations and cultural exchange.
I worked as a Software Engineer at XYZ Company.
Developed and maintained software applications using Java and Python.
Collaborated with cross-functional teams to gather requirements and design solutions.
Implemented unit tests and performed code reviews to ensure code quality.
Participated in agile development processes and attended daily stand-up meetings.
Resolved bugs and issues reported by users and provided technical s...
In 5 years, I see myself as a senior software engineer leading a team of developers, working on complex projects and contributing to the growth of the company.
Leading a team of developers
Working on complex projects
Contributing to the growth of the company
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
Strengths: problem-solving
Strengths: attention to detail
Strengths: teamwork
Weaknesses: time management
Weaknesses: public speaking
I am a software engineer with experience in developing and maintaining software applications.
I have a Bachelor's degree in Computer Science.
I have worked on various projects using different programming languages such as Java, C++, and Python.
I am skilled in software development methodologies like Agile and have experience with version control systems like Git.
I have strong problem-solving and analytical skills, which h...
I applied via Recruitment Consultant and was interviewed before Sep 2020. There was 1 interview round.
Executive
15
salaries
| ₹1.3 L/yr - ₹4.5 L/yr |
Inspection Engineer
14
salaries
| ₹1.8 L/yr - ₹4.9 L/yr |
Software Engineer
9
salaries
| ₹4.5 L/yr - ₹14 L/yr |
IT Executive
7
salaries
| ₹2.8 L/yr - ₹4.5 L/yr |
Surveyor
7
salaries
| ₹2.4 L/yr - ₹5 L/yr |
Amazon
Flipkart
Mahindra & Mahindra
Asian Paints