Filter interviews by
I applied via Company Website and was interviewed before Oct 2020. There were 3 interview rounds.
I was interviewed in Dec 2020.
Top trending discussions
posted on 3 Dec 2015
The memory layout of C programs refers to how variables and data structures are organized in memory.
C programs typically have four main sections in memory: code, data, heap, and stack.
The code section contains the compiled program instructions.
The data section stores global and static variables.
The heap is used for dynamic memory allocation.
The stack is used for function calls and local variables.
Pointers in C hold mem...
Inefficiency and lack of organization irritate me.
Inefficient code or processes
Lack of documentation
Disorganized project management
Inconsistent coding standards
Poor communication within the team
I know multiple computer languages including Java, Python, and C++.
Java
Python
C++
Design a P2P sharing network like torrent
Consider the architecture and protocols for file sharing
Include mechanisms for file discovery and download
Implement a distributed system for efficient data transfer
Ensure data integrity and security
Handle scalability and load balancing
Consider user interface and ease of use
A good job is one that provides satisfaction, growth opportunities, work-life balance, and fair compensation.
Satisfaction: Feeling fulfilled and accomplished in the work being done.
Growth opportunities: Having chances to learn, develop new skills, and advance in the career.
Work-life balance: Striking a healthy equilibrium between work responsibilities and personal life.
Fair compensation: Being adequately rewarded for t...
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.
Detect if two circular linked lists overlap
Traverse both lists and check if they have the same tail node
If they have different tail nodes, they do not overlap
If they have the same tail node, check if they intersect at any point
Use Floyd's cycle-finding algorithm to detect intersection point
I was interviewed before Sep 2020.
Round duration - 75 minutes
Round difficulty - Hard
Coding Test with 3 problems. 1 Easy , 1 Medium , 1 Very Hard
You are provided with a list of jobs, where each job has a specific deadline and profit. The goal is to schedule these jobs such that the total profit is maximized. Each job require...
The goal is to schedule jobs to maximize profit while meeting deadlines. Each job takes one unit of time and only one job can be scheduled at a time.
Sort the jobs in decreasing order of profit
Iterate through the sorted jobs and schedule them based on their deadlines
Keep track of the total profit achieved
Ensure each job is completed before its deadline
Given a binary tree with N
nodes, your task is to output the Spiral Order traversal of the binary tree.
The input consists of a single line containing elem...
Implement a function to return the spiral order traversal of a binary tree.
Traverse the binary tree level by level, alternating between left to right and right to left.
Use a queue to keep track of nodes at each level.
Append nodes to the result list in the order they are visited.
Goku has ‘N’ Dragon Balls, where each Dragon Ball is unique. The ith Dragon Ball has ‘i’ stars on it, meaning the first Dragon Ball has 1 star, the second ...
Count the number of structurally unique binary trees that can be constructed with given Dragon Balls.
Use dynamic programming to solve this problem efficiently.
The number of structurally unique binary trees can be calculated using Catalan numbers.
For each test case, calculate the number of structurally unique binary trees modulo 10^9 + 7.
Return the count of unique binary trees for each test case.
Round duration - 60 minutes
Round difficulty - Hard
In depth questions on Subjects like OOP , DBMS , OS , Javascript.
Round duration - 40 minutes
Round difficulty - Hard
Questions on my resume, projects, internship done. Interviewer was a bit harsh on me.
Low-level languages interact directly with hardware, while high-level languages are more abstract and easier to read/write.
Low-level languages are closer to machine code and hardware, while high-level languages are closer to human language.
Low-level languages require more manual memory management and are less portable, while high-level languages have automatic memory management and are more portable.
Examples of low-lev...
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
based on 1 interview
Interview experience
Senior Software Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Account Director
7
salaries
| ₹0 L/yr - ₹0 L/yr |
TeamViewer
Zoom Video Communications
Citrix
Salesforce