i
Zeta
Filter interviews by
I applied via LinkedIn and was interviewed before Oct 2022. There were 4 interview rounds.
Coding covered LC medium and easy questions on recursion, trees n dp.
I applied via Recruitment Consulltant and was interviewed before Jun 2021. There were 3 interview rounds.
Decision Tree is preferred over Random Forest when interpretability is important.
Decision Tree is easier to interpret and visualize than Random Forest.
Decision Tree is better suited for small datasets with few features.
Random Forest is better suited for large datasets with many features.
Random Forest is less prone to overfitting than Decision Tree.
Decision Tree can be used as a building block for Random Forest.
If inter...
I applied via Referral and was interviewed before Oct 2020. There was 1 interview round.
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
Round 1 Aptitude Test. They Ask Total 24 questions There are Aptitude and Verbal, One Codding question related To Sql Joins.
I applied via LinkedIn and was interviewed in May 2023. There were 3 interview rounds.
Valuation methods are used to determine the worth of a company or asset.
Common valuation methods include discounted cash flow (DCF), comparable company analysis (CCA), and precedent transactions analysis.
DCF involves estimating the future cash flows of a company and discounting them back to present value.
CCA compares the target company to similar publicly traded companies to determine its value.
Precedent transactions a...
Separate out 0's, 1's, and 2's in an array
Create three variables to count the number of 0's, 1's, and 2's in the array
Loop through the array and increment the respective variable for each occurrence
Create a new array and add the counted number of 0's, 1's, and 2's in order
Remove duplicates from given array of strings
Create a new empty array
Loop through the original array and check if the element already exists in the new array
If not, add it to the new array
Return the new array
Loop in linked list can be detected using Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop, the faster pointer will eventually catch up to the slower pointer.
If there is no loop, the faster pointer will reach the end of the list.
Time complexity of this algorithm is O(n) and space complexity is O(1).
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Software Development Engineer II
79
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Payed