Filter interviews by
Clear (1)
I applied via Naukri.com
Top trending discussions
I was interviewed in Jul 2017.
Code to print * in five consecutive lines
Use a loop to iterate five times
Inside the loop, print a string containing a single * character
Code to calculate number of bounces a ball goes through until it comes to rest.
Use a loop to simulate the bounces until the ball stops bouncing
Calculate the height of each bounce using the given formula
Keep track of the number of bounces in a counter variable
The best and less time consuming way to calculate factorial of a number is using iterative approach.
Iteratively multiply the number with all the numbers from 1 to the given number
Start with a result variable initialized to 1
Multiply the result with each number in the range
Return the final result
Code to find factorial using function recursion
Define a function that takes an integer as input
Check if the input is 0 or 1, return 1 in that case
Otherwise, call the function recursively with input-1 and multiply it with the input
posted on 28 Jun 2024
I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.
Recursion tree for a given code
Identify the base case of the recursion
Draw a tree structure with each recursive call as a node
Label each node with the input parameters and return values
posted on 31 May 2022
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Easy
Timing - 10AM-11:30AM
Online proctored test
Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...
The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.
Traverse the tree level by level and keep track of the rightmost node at each level
Print the rightmost node of each level to get the right view of the tree
Use a queue for level order traversal and a map to store the rightmost nodes
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Round duration - 45 minutes
Round difficulty - Medium
Timing : 4PM-5PM
Environment - Online
There was a panel of 3 interviewers
You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.
Calculate the total size of the array by multiplying the number of elements by the size of each element.
Divide the total size by the size of one element to get the size of the array.
For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total
B+ trees are used for indexing in databases to efficiently search and retrieve data.
B+ trees are balanced trees where each node can have multiple keys and child pointers.
Data is stored in leaf nodes, while non-leaf nodes are used for navigation.
B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.
Example: In a database table with an index on a specific column, B+ tree...
Round duration - 45 mintues
Round difficulty - Easy
Timing - 11AM-12:15PM
Environment - online video call
Again there was a panel of 2 senior engineers
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
For the giv...
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes while keeping track of the sum of each path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.
Handle cases where nodes have negative values or where
Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction
Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
To connect to the backend, you can use APIs, database connections, or web services.
Use APIs to send and receive data between the frontend and backend
Establish database connections to retrieve and store data
Utilize web services for communication between different systems
I applied via Campus Placement and was interviewed in Feb 2021. There were 4 interview rounds.
To find the middle of a linked list in one iteration, use two pointers with different speeds.
Initialize two pointers, one slow and one fast, both pointing to the head of the linked list.
Move the slow pointer one step at a time and the fast pointer two steps at a time.
When the fast pointer reaches the end of the linked list, the slow pointer will be at the middle node.
A binary tree is a data structure consisting of nodes, where each node has at most two children.
Binary tree is used to represent hierarchical relationships between nodes
Traversal of binary tree can be done in three ways: inorder, preorder, postorder
Binary search tree is a type of binary tree where left child is smaller and right child is greater than parent
Balanced binary tree has height difference of at most 1 between...
It was like 5 MCQ and two coding questions with difficult level of moderate
React components go through various stages in their life cycle, from initialization to destruction.
Initialization: Component is created and initialized with default props and state.
Mounting: Component is rendered on the DOM for the first time.
Updating: Component re-renders when props or state change.
Unmounting: Component is removed from the DOM.
Examples: componentDidMount() for mounting, componentDidUpdate() for updati
I applied via Campus Placement and was interviewed in Oct 2023. There were 4 interview rounds.
Topics: maps, sorting and simple DSA question
A linked list is a data structure where each element points to the next element in the sequence.
Linked list is stored in memory as nodes, where each node contains data and a reference to the next node.
Examples of linked-list include a singly linked list, doubly linked list, and circular linked list.
In a singly linked list, each node points to the next node. In a doubly linked list, each node points to both the next and
ML models are built by collecting and preparing data, selecting a model, training the model on the data, and evaluating its performance.
Collect and prepare data by cleaning, transforming, and encoding it
Select a model based on the problem at hand (e.g. regression, classification, clustering)
Train the model using algorithms like linear regression, decision trees, or neural networks
Evaluate the model's performance using ...
Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.
Arrays have fixed size, while linked lists can dynamically grow or shrink.
Accessing elements in arrays is faster (O(1)), while accessing elements in linked lists is slower (O(n)).
Inserting or deleting elements in arrays can be inefficient, as it may require shifting elements, while in linked l...
Return a string containing the first occurrence of characters in the input string.
Create an empty string to store the result.
Iterate through each character in the input string.
If the character is not already in the result string, add it to the result string.
Return the result string.
One of the hardest DSA questions I have done involved implementing a complex graph traversal algorithm.
The question required understanding of graph data structures and algorithms.
I had to implement a depth-first search or breadth-first search algorithm.
The question may have involved finding the shortest path in a weighted graph.
I had to consider edge cases and optimize the algorithm for efficiency.
2 hours of duration and medium level leetcode questions
OS stands for Operating System. It is a software that manages computer hardware and provides services for computer programs.
OS is the software that acts as an intermediary between computer hardware and user applications.
It manages computer resources such as memory, processors, devices, and file systems.
Examples of popular operating systems include Windows, macOS, Linux, and Android.
Deadlock can be avoided by implementing proper resource allocation strategies and using techniques like deadlock prevention, avoidance, detection, and recovery.
Implement proper resource allocation strategies such as resource ordering, wait-die, wound-wait, etc.
Use techniques like deadlock prevention by ensuring that the system never enters a deadlock state, avoidance by ensuring that the system does not enter an unsafe...
I applied via Campus Placement and was interviewed in Dec 2022. There were 3 interview rounds.
First 20 question for apti and then coding round of 20 questions each from c/c++ , java and SQL
No, multiple inheritance is not allowed in Java.
Java does not support multiple inheritance for classes to avoid the diamond problem.
However, multiple inheritance is allowed for interfaces in Java.
Example: class A extends B, C is not allowed, but interface A extends B, C is allowed.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Allows a class to inherit attributes and methods from another class
Promotes code reusability and reduces redundancy
Creates a parent-child relationship between classes
Example: Class 'Car' can inherit properties and methods from class 'Vehicle'
Polymorphism in software development is like a person driving different vehicles using the same driving skills.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
For example, a superclass 'Shape' can have subclasses like 'Circle' and 'Rectangle' which can be treated as 'Shape' objects.
Calling a method like 'draw()' on a 'Shape' object will execute the specific implementatio...
Software Engineer
236
salaries
| ₹0 L/yr - ₹0 L/yr |
Advanced Software Engineer
99
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
79
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Dassault Systemes
Autodesk
PTC
Bentley Systems