Filter interviews by
Top trending discussions
posted on 17 May 2022
I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.
Environmental Engineering, Legislations, Unit Operations
posted on 23 Nov 2022
I applied via Referral and was interviewed before Nov 2021. There were 2 interview rounds.
C++ is an extension of C with object-oriented programming features.
C++ supports object-oriented programming while C does not.
C++ has a richer set of data types and operators than C.
C++ has better support for exception handling and templates than C.
C++ allows function overloading while C does not.
C++ has a standard library that includes many useful functions and classes.
C++ is backward compatible with C code.
C++ is gene
Tuple is an immutable sequence type in Python that can store multiple values of different data types.
Tuples are defined using parentheses () and separated by commas.
Tuples can be accessed using indexing or slicing.
Tuples are immutable, meaning their values cannot be changed once defined.
Tuples are commonly used for returning multiple values from a function.
Tuples can also be used as keys in dictionaries.
Example: my_tup...
I applied via Campus Placement and was interviewed before Jan 2024. There were 3 interview rounds.
Guesstimate Assignment
Guesstimate GD round
I was interviewed in Jan 2025.
Basics of market estimations
1 coding question, and basic MCQ
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
Two easy questions two wasy questions two easy questions two easy questions
posted on 18 Jun 2024
I applied via Campus Placement
GREAT ROUNDS COMPREHENSIVE PROBLEM SL
EASY TO CLEAR JUST FOCUS ON BASICS
I applied via Referral and was interviewed before Mar 2022. There were 4 interview rounds.
Market estimation question discussion
Junior Scientist
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Scientist
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Associate
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Scientist C
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Scientist
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Central Electrochemical Research Institute
National Environmental Engineering Research Institute
Indian Institute of Chemical Technology
Central Food Technological Research Institute