Filter interviews by
Prim's algorithm is a greedy algorithm used to find the minimum spanning tree for a connected, undirected graph.
Start with an arbitrary vertex and grow the tree by adding the shortest edge that connects the tree to a vertex not in the tree.
Repeat until all vertices are included in the tree.
Example: Given a graph with vertices A, B, C, D and edges with weights, find the minimum spanning tree using Prim's algorithm.
Avaya is being affected by the recession in multiple ways.
The recession has led to a decrease in business spending, affecting Avaya's sales and revenue.
Companies are cutting back on investments in communication infrastructure, impacting Avaya's market demand.
Avaya may face challenges in securing financing for expansion or innovation due to the economic downturn.
The recession may also result in workforce reductions or c...
Top trending discussions
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
Code to find a given integer in a rotated sorted 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 edge cases such as the target integer not being present in the array.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
I got to participate in a robotics competition at IIT
Designed and built a robot from scratch
Programmed the robot to complete tasks autonomously
Competed against other teams from different colleges
Learned valuable skills in engineering and teamwork
I chose IIT for its reputation and opportunities. No regrets. The environment is competitive and challenging.
IIT has a strong reputation for producing successful graduates
I was attracted to the opportunities for research and innovation
The academic environment is highly competitive and challenging
I have no regrets about my decision to attend IIT
A portfolio is a collection of investments. Risk can be measured through standard deviation, beta, or value at risk.
A portfolio is a combination of different investments such as stocks, bonds, and mutual funds.
The purpose of a portfolio is to diversify investments and reduce risk.
Risk can be measured through standard deviation, which measures the volatility of returns.
Beta measures the sensitivity of a portfolio to mar...
Beta is a measure of a stock's volatility. Value at risk is a statistical measure of potential losses. Formula for beta is Covariance(Stock, Market) / Variance(Market).
Beta measures a stock's sensitivity to market movements.
Value at risk is the maximum potential loss that an investment portfolio may suffer within a given time frame.
Beta formula is calculated by dividing the covariance of the stock and market returns by...
Covariance measures the relationship between two variables. It measures sensitivity by indicating the direction of the relationship.
Covariance is a statistical measure that shows how two variables are related to each other.
It measures the direction of the relationship between two variables.
A positive covariance indicates that the two variables move in the same direction.
A negative covariance indicates that the two vari...
WACC is the weighted average cost of capital. To value a company, one can use various methods such as DCF, comparables, or precedent transactions. A method to decide on project undertaking is NPV analysis.
WACC is the average cost of all the capital a company has raised
To value a company, one can use DCF, comparables, or precedent transactions
DCF involves projecting future cash flows and discounting them back to present...
I am impressed with the company's reputation and growth potential, and I believe my skills and experience align well with the job requirements.
I have researched the company and am impressed with its reputation and growth potential
I believe my skills and experience align well with the job requirements
I am excited about the opportunity to work with a talented team and contribute to the company's success
I have the necessary skills, experience, and passion to excel in this role.
I have a proven track record of success in similar roles.
I am a quick learner and adaptable to new situations.
I am passionate about this industry and eager to contribute to its growth.
I have excellent communication and teamwork skills.
I am committed to delivering high-quality work and exceeding expectations.
I would prioritize completing my current assignment and then discuss the transfer with my supervisor to ensure a smooth transition.
I would communicate with my supervisor to understand the urgency of the transfer
I would prioritize completing my current assignment to the best of my ability
I would discuss the transfer with my supervisor to ensure a smooth transition
I would try to complete as much work as possible before l...
A batsman can score a maximum of 264 runs in an ODI.
The maximum number of runs a batsman can score in an ODI is limited by the number of balls bowled and the number of boundaries hit.
The maximum number of balls bowled in an ODI is 300, assuming no extras are bowled.
If a batsman hits a boundary off every ball they face, they can score a maximum of 240 runs.
If a batsman hits sixes off every ball they face, they can score...
Solving two jug problems to obtain a specified amount of water using differently sized jugs.
Understand the capacity of each jug
Determine the amount of water needed
Fill one jug with water and pour it into the other jug
Repeat until the desired amount is reached
Use the remaining water in the larger jug to measure the remaining amount needed
Consider the possibility of multiple solutions
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
I am a Senior Associate in the field of finance, specializing in investment management.
I have expertise in analyzing financial data and making investment recommendations.
I work closely with clients to understand their financial goals and risk tolerance.
I monitor market trends and economic indicators to make informed investment decisions.
I have experience in portfolio management and asset allocation.
I may hold certifica...
My ambition is to become a respected leader in my field, making a positive impact through innovative solutions and mentorship.
To continuously learn and grow in my role
To lead and inspire a team towards success
To contribute to the advancement of the organization and industry
To mentor and guide junior colleagues in their professional development
based on 1 review
Rating in categories
Oracle Application Technical Consultant
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Udaan
BigBasket
Swiggy
Lenskart