Filter interviews by
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
posted on 4 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Yes, I have coded in curriculum. The most complex one was a project on building a web application using React and Node.js.
Built a full-stack web application using React and Node.js
Implemented user authentication and authorization using JSON Web Tokens (JWT)
Used MongoDB as the database and Mongoose as the ODM
Implemented real-time updates using Socket.IO
Deployed the application on Heroku
Handled errors and implemented log
Big data refers to large and complex data sets that cannot be processed using traditional data processing methods.
Big data is characterized by its volume, velocity, and variety
It is used in various industries such as healthcare, finance, and retail
Examples of big data include social media data, sensor data, and transactional data
It is called 'big' because it involves processing massive amounts of data
Big data requires ...
I am passionate about technology and eager to learn new skills in the IT sector.
I have always had a keen interest in technology and enjoy working with computers.
I believe the IT sector offers more opportunities for growth and advancement in my career.
I have seen the impact of technology on various industries and want to be a part of that innovation.
I have taken courses in programming and networking to prepare myself fo
To find the product of all data points using SelectSum(), log(), and exp() functions.
Use the log() function to convert the product into a sum of logarithms
Apply the SelectSum() function to calculate the sum of logarithms
Finally, use the exp() function to convert the sum back into the product
I appeared for an interview in Oct 2016.
I cannot provide investment advice, but here are five companies that have shown strong financial performance in recent years.
Apple - consistently high revenue and profit margins
Amazon - dominant player in e-commerce and cloud computing
Microsoft - strong growth in cloud computing and enterprise software
Alphabet (Google) - diversified revenue streams and strong advertising business
Visa - dominant player in the payments i
The Brexit vote could have both positive and negative effects on the Indian economy.
Positive effects: Increased trade opportunities with the UK, potential for attracting foreign investments from companies relocating from the UK.
Negative effects: Uncertainty in global markets leading to volatility in exchange rates, potential decline in exports to the UK.
Example: Indian IT companies may face challenges due to stricter i...
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
I am a highly motivated individual with a passion for learning and achieving my goals.
I have a degree in computer science and have worked as a software developer for 3 years.
I am proficient in multiple programming languages including Java, Python, and C++.
I enjoy working in a team environment and collaborating with others to solve complex problems.
In my free time, I enjoy hiking and exploring new places.
I grew up in a small town with my parents and younger sister. We were a close-knit family.
Grew up in a small town
Close-knit family
Parents and younger sister
Participated in community events
Enjoyed outdoor activities
I enjoy reading, hiking, and trying new recipes in my free time.
Reading books on various topics, including fiction, non-fiction, and self-improvement
Hiking in local parks and nature reserves to explore new trails and enjoy the outdoors
Experimenting with new recipes and cooking techniques in the kitchen
Attending cultural events such as concerts, plays, and art exhibits
Spending time with family and friends, playing board
I would expect a supportive work environment, opportunities for growth and development, and a commitment to excellence.
Supportive and collaborative team culture
Clear communication and feedback
Opportunities for professional development and advancement
Commitment to high-quality work and customer satisfaction
Competitive compensation and benefits package
Yes, I have a cousin who lives in Bangalore.
I have a cousin who has been living in Bangalore for the past 5 years.
We keep in touch and he has shown me around the city during my visits.
He works in the IT industry and enjoys the vibrant culture of Bangalore.
Loop in a circular linked list can be found using Floyd's cycle-finding algorithm.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move slow pointer by one node and fast pointer by two nodes in each iteration.
If there is a loop, both pointers will eventually meet at some point.
If there is no loop, fast pointer will reach the end of the linked list.
Time complexity of this algorithm is
Pre-fix and post-fix operations can be performed on a string expression using appropriate operators.
Pre-fix operation involves placing the operator before the operand in the expression.
Post-fix operation involves placing the operator after the operand in the expression.
Examples of pre-fix operators include ++, --, !, and ~.
Examples of post-fix operators include ++ and --.
Data analytics is the process of examining data sets to draw conclusions about the information they contain.
Data analytics involves collecting, cleaning, and analyzing data to identify patterns and trends.
It can help businesses make informed decisions by providing insights into customer behavior, market trends, and operational efficiency.
For example, a retail company can use data analytics to analyze sales data and ide...
Strengths include adaptability and teamwork. Weaknesses include public speaking. Non-core background allows for diverse perspective. JPMorgan Chase's reputation and opportunities attract me.
Strengths: adaptability, teamwork
Weakness: public speaking
Non-core background brings diverse perspective
Attracted to JPMorgan Chase's reputation and opportunities
I would pursue my entrepreneurial dream and start my own company.
I would conduct market research to validate my idea and identify potential competitors.
I would create a business plan outlining my goals, strategies, and financial projections.
I would secure funding through investors or loans.
I would assemble a team of talented individuals with diverse skills and experiences.
I would continuously evaluate and adapt my busi
I would listen to both sides, gather more information, and try to find a compromise that satisfies everyone.
Listen to both sides and understand their perspectives
Gather more information about both ideas
Try to find common ground and a compromise that satisfies everyone
Encourage open communication and respect for each other's ideas
Consider the potential impact and benefits of each idea
Involve a neutral third party if nec
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Company is a global technology company known for its innovative products and services.
Founded in 1976 by Steve Jobs, Steve Wozniak, and Ronald Wayne.
Known for products such as iPhone, iPad, Mac computers, and Apple Watch.
Offers services like Apple Music, iCloud, and Apple Pay.
Has a strong focus on design and user experience.
I appeared for an interview before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
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.
I appeared for an interview in Dec 2016.
The algorithm reverses a given string.
Iterate through the string from the last character to the first character.
Append each character to a new string or an array in reverse order.
Return the reversed string or array.
As the CEO, I would select the candidate based on their qualifications and skills, regardless of their background or personal characteristics.
I would focus on the qualifications, skills, and experience of each candidate.
I would consider their ability to contribute to the company's goals and objectives.
I would ensure a fair and unbiased selection process.
I would prioritize diversity and inclusion in the workplace.
I woul...
based on 2 interviews
Interview experience
based on 24 reviews
Rating in categories
3-5 Yrs
Not Disclosed
Assistant Manager
5
salaries
| ₹5 L/yr - ₹5.9 L/yr |
National Manager
5
salaries
| ₹20 L/yr - ₹22 L/yr |
Deputy Manager
4
salaries
| ₹4.9 L/yr - ₹8.7 L/yr |
Relationship Manager
4
salaries
| ₹5.6 L/yr - ₹6.2 L/yr |
Operations Executive
4
salaries
| ₹3.2 L/yr - ₹3.5 L/yr |
Practo
Lybrate
Portea Medical
PharmEasy