Filter interviews by
I applied via Naukri.com and was interviewed before Jul 2022. There were 3 interview rounds.
Rolling margin is the difference between the current period's revenue and the previous period's revenue, expressed as a percentage.
Rolling margin helps in analyzing the trend of revenue growth over time.
It is calculated by subtracting the previous period's revenue from the current period's revenue, dividing by the previous period's revenue, and multiplying by 100.
For example, if the revenue in the current period is $10...
The mode of measurement for plaster work is in square meters.
Plaster work is typically measured in square meters
The area of the surface to be plastered is calculated to determine the quantity of materials needed
Measurements are taken by multiplying the length and height of the surface being plastered
For example, if a wall is 3 meters long and 2 meters high, the total area to be plastered would be 6 square meters
Escalation bill is a document that outlines additional costs incurred due to unforeseen circumstances or changes in project scope.
Escalation bill includes costs for unexpected events, changes in project scope, or delays.
It is used to account for additional expenses beyond the original budget.
Examples of escalation bill items include increased material costs, labor costs due to delays, or additional equipment rental fee
The decision between one slab or two slabs depends on the span length, with longer spans typically requiring two slabs.
Longer span typically requires two slabs for better load distribution
Shorter span can be managed with one slab to reduce construction costs
Consider factors like structural integrity, cost, and aesthetics when deciding on slab configuration
The question is likely referring to the concept of oil absorption by wood, commonly used in the oil spill cleanup process.
Wood has the ability to absorb oil due to its porous nature
The absorption capacity of wood varies depending on the type of wood and its density
One litre of oil requiring forty m2 of wooden oil could be an estimation of the absorption capacity of a specific type of wood
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 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)
based on 3 interviews
Interview experience
TCS
Accenture
Wipro
Cognizant