i
Naukri
Filter interviews by
The question is ambiguous and lacks context, making it difficult to determine the exact number of questions.
Clarify the context: Are we talking about a specific document or a general situation?
Consider the source: Different surveys or tests may have varying numbers of questions.
Example: A typical job interview may have 5-10 questions, while a standardized test could have 50 or more.
This question requires a detailed explanation of a specific software development topic.
Understand the core concepts of the topic, e.g., OOP principles like encapsulation and inheritance.
Provide real-world examples, such as using classes in Python to demonstrate encapsulation.
Discuss common challenges and solutions in the software development process.
Mention best practices, like code reviews and version control systems.
This question assesses problem-solving skills and technical knowledge in software development.
Understand the problem statement clearly before attempting to solve it.
Break down the problem into smaller, manageable parts.
Consider edge cases and how they might affect your solution.
Use pseudocode to outline your approach before coding.
Test your solution with various inputs to ensure its robustness.
Array is a fixed-size collection of elements, while ArrayList is a dynamic-size collection that can grow or shrink.
Array has a fixed length, while ArrayList can dynamically resize.
Array is more memory efficient, while ArrayList provides more flexibility.
Array can store primitive types and objects, while ArrayList can only store objects.
Array allows direct access to elements using index, while ArrayList requires methods...
LinkedList is better for frequent insertions and deletions, while ArrayList is better for frequent access.
LinkedList uses pointers to connect nodes, while ArrayList uses contiguous memory.
LinkedList has O(1) insertion and deletion, while ArrayList has O(n) for these operations.
ArrayList has O(1) access time, while LinkedList has O(n) for this operation.
LinkedList is better for implementing stacks and queues, while Arra...
Nodes are elements with child elements, while non-nodes are standalone elements.
Nodes are part of a hierarchical structure, while non-nodes are not.
Nodes can have child elements, while non-nodes cannot.
Examples of nodes include HTML elements like
Nodes are typically used in tree-like data structures, while non-nodes are used for standalone elements.
I appeared for an interview before Dec 2015.
Understanding basic data structures and algorithms is crucial for software development and problem-solving.
Data structures like arrays, linked lists, stacks, and queues are fundamental for organizing data.
Algorithms such as sorting (e.g., quicksort, mergesort) and searching (e.g., binary search) are essential for efficient data manipulation.
Example: An array can store a list of numbers, while a linked list can efficien...
I am excited to join the company because of its reputation for innovation and commitment to employee growth.
I am impressed by the company's track record of developing cutting-edge software solutions.
I appreciate the company's focus on fostering a culture of learning and development.
I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.
I believe that the co...
What people are saying about Naukri
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was held during university hours and consisted of 2 coding questions.
Round duration - 120 minutes
Round difficulty - Easy
Make sure you do no cutting and are clear about the approach you'd be following.
Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.
Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.
Keep the number of elements in the two heaps balanced or differ by at most 1.
If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...
Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.
Application resume tips for other job seekersBe sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.
Final outcome of the interviewSelectedI appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
Given an array A
containing 'N' integers and an integer m
, rearrange the elements of the array such that the differences between the array elements and m
are sor...
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 30 Nov 2015
I applied via Campus Placement
I applied via Referral
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
I appeared for an interview before Sep 2016.
Search an element in sorted rotated array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle the cases where the target element is at the pivot point or not present in the array.
Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.
Use dynamic programming to solve the problem
Create a 2D array to store the number of paths
Traverse the matrix and update the array based on the allowed paths
Return the value at the last index of the array
based on 2 interview experiences
Difficulty level
based on 9 reviews
Rating in categories
Assistant Manager
148
salaries
| ₹4.7 L/yr - ₹10 L/yr |
Senior Executive
123
salaries
| ₹3.8 L/yr - ₹7.8 L/yr |
Deputy Manager
120
salaries
| ₹6 L/yr - ₹13.7 L/yr |
Senior Executive Corporate Sales
94
salaries
| ₹4.5 L/yr - ₹7.8 L/yr |
Associate Senior Executive
87
salaries
| ₹2.8 L/yr - ₹6 L/yr |
Amazon
Flipkart
Udaan
Indiamart Intermesh