Edneed Technology Interview Questions and Answers

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...read more

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...read more

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...read more

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...read more

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...read more

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...read more

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

I want you to provide me with challenging software development projects that will help me grow as a developer.

• Challenging projects that will push my skills to the limit

• Opportunities to learn new technologies and programming languages

• Collaborative work environment with experienced developers

• Clear communication and feedback on my work

• Opportunities for career growth and advancement

Find Nth largest element in the BST

• Traverse the BST in reverse inorder and keep track of count

• If count equals N, return the current node's value

• If count exceeds N, stop traversing and return null

• If count is less than N, continue traversing

Find node in BST with value equal to or greater than input value.

• Start at root node

• If input value is less than current node value, move to left child

• If input value is greater than or equal to current node value, move to right child

• Repeat until node with desired value is found or null is reached

Program to check if a binary tree is balanced

• Calculate height of left and right subtrees recursively

• Check if the difference in height is not more than 1

• Repeat for all nodes in the tree

• Time complexity: O(nlogn) or O(n)

• Space complexity: O(h) where h is the height of the tree

Find max size of a sub-string with no duplicate characters in a given string.

• Use a sliding window approach with two pointers.

• Maintain a hash set to keep track of unique characters.

• Update the maximum length of the substring as you iterate through the string.

A hash table is a data structure that stores key-value pairs and uses a hash function to map keys to buckets.

• Hash function takes a key and returns an index to a bucket

• Collisions occur when multiple keys map to the same bucket

• Collision resolution techniques include chaining and open addressing

• Example: Dictionary in Python uses hash tables to store key-value pairs

WAP to find a continuous subset divisible by 7 from an array of numbers. Calculate algorithm complexity.

• Iterate through the array and calculate the prefix sum modulo 7 at each index.

• Store the prefix sum modulo 7 in a hash table with the index as the value.

• If a prefix sum modulo 7 is already in the hash table, the subarray between the two indices has a sum divisible by 7.

• Time complexity is O(n) and space complexity is O

Given a 2D array of integers, set rows and columns to 1 if they contain 1.

• Iterate through the array to find the index of 1

• Use two arrays to keep track of rows and columns with 1

• Iterate through the rows and columns arrays to set values to 1

Code to find sum of two numbers stored as linked list.

• Traverse both lists simultaneously and add corresponding nodes

• Keep track of carry and add it to next sum

• Create a new node for each sum and move to next node

Code to print elements on path from root to leaf node with max sum

• Traverse the tree and keep track of the maximum sum path

• Use recursion to traverse the tree

• Print the path when a leaf node with maximum sum is reached

Retrieving min element from a max heap has a time complexity of O(log n).

• The min element is always the leftmost leaf node in the last level of the heap.

• To retrieve it, swap it with the last element in the heap and remove it.

• Then, bubble down the new root to maintain the max heap property.

• Examples: retrieving the smallest number in a priority queue implemented as a max heap.

• Examples: retrieving the smallest element in a

The fastest method to sort an almost sorted array is shell sort.

• Shell sort has a time complexity of O(n log n) which is faster than bubble sort and insertion sort.

• Quick sort and merge sort have a time complexity of O(n log n) but they are not optimized for almost sorted arrays.

• Shell sort works by comparing elements that are far apart first and then gradually reducing the gap between them.

• Example: If the array is [1, 3,...read more

A zombie process is a process that has completed execution but still has an entry in the process table.

• Zombie processes occur when a parent process does not properly wait for its child process to terminate.

• The zombie process remains in the process table until the parent process reads its exit status.

• Zombie processes do not consume system resources but can accumulate if not properly handled.

• They can be identified using ...read more

Hash tables have complexities related to collisions, resizing, and choosing a good hash function.

• Collisions occur when two keys map to the same index, requiring a collision resolution strategy.

• Resizing can be expensive as all elements need to be rehashed and moved to new locations.

• Choosing a good hash function is important to minimize collisions and ensure even distribution of keys.

• Examples of collision resolution stra...read more

Algorithm to find any three numbers in an array that sum to zero.

• Sort the array in ascending order.

• Loop through the array and fix the first number.

• Use two pointers to find the other two numbers that sum to the negative of the fixed number.

• If found, return the three numbers.

• If not found, move to the next number and repeat the process.

• Time complexity: O(n^2)

Returning kth smallest element in a BST with time complexity logn.

• Perform in-order traversal and keep track of count until kth element is reached

• If kth element is found, return it

• If kth element is not found, continue traversal

• If traversal is complete and kth element is not found, return null

• Time complexity is logn as we only traverse the height of the tree