Filter interviews by
I applied via Referral and was interviewed in May 2024. There were 4 interview rounds.
Top trending discussions
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.
To build a sourcing strategy, I followed these steps:
Identified the business needs and goals
Conducted market research to identify potential suppliers
Evaluated supplier capabilities and performance
Negotiated contracts and pricing
Developed a supplier relationship management plan
Monitored supplier performance and made adjustments as needed
I led a bid for a software implementation project worth $5 million, resulting in a successful contract with a major client.
Led bid for $5 million software implementation project
Negotiated contract terms with major client
Ensured project met client's requirements and deadlines
I applied via Campus Placement and was interviewed in Jul 2021. There were 5 interview rounds.
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
Case study done on your project
I was interviewed in Jan 2025.
Online test was hackerrank was was og avg difficulty
Assignment was straightforward which could be done using trie. Did it in 1/6th throughout time for given queries then mentioned allowed still no reply. Keep on asking engineering manager and hr to which they replied not upto the mark.
I was interviewed before Mar 2021.
To check if a number is a power of 2, we can use bitwise operations.
A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Sort a stack without using another data structure
Use recursion to pop the top element and insert it at the bottom of the remaining stack
Repeat until the stack is sorted in ascending order
Time complexity: O(n^2), space complexity: O(n) due to recursion
Check if array has continuous increasing and decreasing values
Loop through the array and check if each element is greater than the previous one
Once you find the maximum element, check if the remaining elements are in decreasing order
If yes, return true else false
Design a cricinfo (LLD)
Identify the entities: players, teams, matches, scorecards, tournaments, etc.
Define the relationships between entities
Create a database schema to store the data
Implement APIs to fetch and update data
Design a UI to display the information
Consider scalability and performance
Ensure data security and privacy
posted on 9 Aug 2023
I applied via Recruitment Consulltant and was interviewed in Jul 2023. There were 5 interview rounds.
Coding string related programming
Hacker rank data structure linked list
Hacker rank data structure trees
posted on 5 Mar 2025
Was asked to understand a project in python and translate it to NodeJS. This had to be done during the interview with you explaining you thought process through every step.
based on 1 interview
Interview experience
Senior Staff Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
TAC Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Check Point Software Technologies
Fortinet
FireEye
Gen