Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Nov 2024. There was 1 interview round.
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 Company Website and was interviewed in Apr 2022. There were 6 interview rounds.
Naaptol
Naaptol
Naaptol
Study ing information
I applied via Company Website and was interviewed in May 2023. There were 4 interview rounds.
Python is a high-level programming language known for its simplicity and readability. It supports multiple programming paradigms.
Python is used for web development, data analysis, artificial intelligence, scientific computing, and more.
To use Python, you need to install the Python interpreter on your system and write code in a text editor or an IDE.
Python has various data types such as integers, floats, strings, lists,
C is a programming language, Python is a high-level programming language, data types are classifications of data items, tuple is a data structure in Python.
C is a general-purpose programming language known for its efficiency and flexibility.
Python is a high-level programming language with a focus on readability and simplicity.
Data types are classifications of data items that specify the type of data that can be stored ...
What is tuple program
what is list program
what is set program
Python,c
what is c
what is python
I applied via Company Website and was interviewed in Aug 2022. There were 2 interview rounds.
MCQ questions,coding, languages
All programming questions
I applied via Job Portal and was interviewed in Nov 2022. There were 2 interview rounds.
I analyze the error logs and identify the root cause of the errors. Then, I work on fixing the issues.
Analyze the error logs to identify the root cause of the errors
Work on fixing the issues causing the errors
Implement preventive measures to avoid similar errors in the future
Java is a high-level programming language invented by James Gosling at Sun Microsystems in 1995.
Java is an object-oriented language that is platform-independent.
It was designed to have a simple syntax and be easy to learn.
Java is used for developing a wide range of applications, from mobile apps to enterprise software.
Java's popularity is due in part to its robustness, security, and scalability.
Some popular Java-based ...
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
Sales Executive
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Accounts Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Executive
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Cogoport
KrazyBee
Treebo Hotels
TravelTriangle