Filter interviews by
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
I have worked on various IT projects including network upgrades, software implementations, and system migrations.
Upgraded network infrastructure to improve speed and reliability
Implemented new software applications to streamline business processes
Migrated systems to new hardware for better performance
Top trending discussions
I applied via Instahyre and was interviewed before Sep 2023. There was 1 interview round.
If its for the SDE 1 , mostly they will start with javascript fundamentals and deep dive in the hard topics
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
15 minutes test.
50 questions
easy questions
Management , Leadership , Character Type questions
2 coding questions
resume grilling
easy medium questions
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
45 mins, Basic aptitude , comprehension and decision making questions
I appeared for an interview in Feb 2025, where I was asked the following questions.
I have over 5 years of experience in artificial intelligence, focusing on machine learning and natural language processing.
Developed a machine learning model for predictive analytics in e-commerce, improving sales forecasting accuracy by 20%.
Worked on a natural language processing project that enhanced customer support chatbots, reducing response time by 30%.
Participated in a research project on reinforcement learning,...
I have 3 years experience in programming language
Not have any questions
I bring a unique blend of technical skills, problem-solving abilities, and a passion for innovation that aligns with your team's goals.
Proven experience in software development with a focus on scalable applications, demonstrated by my work on a high-traffic e-commerce platform.
Strong problem-solving skills, exemplified by my role in optimizing a legacy system, resulting in a 30% increase in performance.
Excellent teamwo...
I excel in problem-solving and teamwork, but I sometimes struggle with time management under tight deadlines.
Strength: Strong problem-solving skills - I enjoy tackling complex coding challenges, like optimizing algorithms for better performance.
Strength: Effective communicator - I ensure clear communication within my team, which helps in collaborative projects.
Weakness: Time management - I occasionally underestimate th...
I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.
Quick sort is a divide and conquer algorithm that sorts the array by selecting a pivot element and partitioning the other elements around it. Merge sort is also a divide and conquer algorithm that divides the array into two halves, sorts them separately and then merges them.
Quick sort has an average time complexity of O(n log n) while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is an in-place...
System design for Naukri.com platform
Identify user requirements and design the system architecture accordingly
Use scalable and reliable technologies for high traffic handling
Implement features like job search, job posting, resume upload, etc.
Ensure data security and privacy of users
Integrate with third-party services like payment gateways, social media platforms, etc.
Highest sum of contiguous subarray in an array
Use Kadane's algorithm to find the maximum sum subarray
Initialize max_so_far and max_ending_here to 0
Loop through the array and update max_ending_here and max_so_far
Return max_so_far as the highest subset sum subarray
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Add two linked lists and return the sum as a linked list.
Traverse both linked lists and add the corresponding nodes.
Handle carry over while adding nodes.
Create a new linked list to store the sum and return it.
Quick sort is faster but unstable, while merge sort is slower but stable.
Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.
Merge sort divides the array into two halves, sorts them separately, and then merges them.
Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is not stable, meaning that the...
based on 1 interview
Interview experience
Consultant
10
salaries
| ₹12 L/yr - ₹20.2 L/yr |
Software Engineer
4
salaries
| ₹18 L/yr - ₹25 L/yr |
Director
4
salaries
| ₹45 L/yr - ₹100 L/yr |
Technical Project Manager
4
salaries
| ₹54 L/yr - ₹54 L/yr |
Technical Program Manager
4
salaries
| ₹55 L/yr - ₹70 L/yr |
Cogoport
Arzooo.com
KrazyBee
Treebo Hotels