Filter interviews by
Addressing low morale in the workplace requires open communication, support, and recognition.
Encourage open communication to understand the root cause of low morale
Provide support and resources to help employees overcome challenges
Recognize and appreciate employees' hard work and contributions
Organize team-building activities to boost morale and foster a positive work environment
The project involved developing a mobile application for tracking daily water intake.
Developed a user-friendly interface for inputting water consumption
Implemented a feature to set daily water intake goals
Integrated notifications to remind users to drink water throughout the day
Variation of N meetings in a room
Consider different combinations of meetings in the room
Calculate the total number of possible variations
Take into account the order of meetings if necessary
The knapsack problem is a classic optimization problem that involves selecting items to maximize value without exceeding weight capacity.
The problem can be solved using dynamic programming.
Given weights and values of items, the goal is to maximize total value within a weight limit.
Example: If you have items with weights [1, 2, 3] and values [10, 15, 40], and a capacity of 6, the optimal selection is items 2 and 3.
...
What people are saying about Google
A motivated intern with a background in [Your Field], eager to learn and contribute to the team while developing professional skills.
Currently pursuing a degree in [Your Major] at [Your University].
Completed an internship at [Company Name], where I assisted in [specific task or project].
Skilled in [specific skills or tools relevant to the position].
Passionate about [specific interest related to the field], demonst...
DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
Start at the initial node and explore as far as possible along each branch before backtracking
Use a stack to keep track of nodes to visit
Mark visited nodes to avoid revisiting them
Can be implemented recursively or iteratively
BFS is a graph traversal algorithm that visits all the nodes of a graph level by level.
Start by adding the initial node to a queue
While the queue is not empty, dequeue a node and visit its neighbors, adding them to the queue
Repeat until all nodes are visited
Coding is the process of writing instructions in a specific programming language, while programming involves the entire process of designing, writing, testing, and maintaining code.
Coding is the act of translating a problem into a language that a computer can understand.
Programming involves planning, designing, implementing, and testing a solution to a problem.
Coding is a subset of programming, focusing on the act...
Ordered map maintains the order of insertion while unordered map does not guarantee any specific order.
Ordered map: elements are stored in the order they were inserted
Unordered map: elements are stored in an unspecified order for faster access
Example: std::map vs std::unordered_map in C++
BFS finds the shortest path in an unweighted graph by exploring neighbors level by level.
BFS uses a queue to explore nodes layer by layer.
Each node is marked as visited to avoid cycles.
The shortest path is found by tracking predecessors.
Example: In a grid, BFS can find the shortest path from the top-left to the bottom-right corner.
Leetcode question , gfg also
The project involved developing a mobile application for tracking daily water intake.
Developed a user-friendly interface for inputting water consumption
Implemented a feature to set daily water intake goals
Integrated notifications to remind users to drink water throughout the day
I applied via AngelList and was interviewed in May 2024. There were 2 interview rounds.
Hacker rank question
I have achieved academic excellence, leadership roles, and community service recognition.
Received academic awards for top grades in class
Served as president of student organization
Volunteered at local charity events
Participated in research projects
Completed internships at reputable companies
What is 10% of 10
what is ram age if he is now 2 years
DSA, coding questions
The knapsack problem is a classic optimization problem that involves selecting items to maximize value without exceeding weight capacity.
The problem can be solved using dynamic programming.
Given weights and values of items, the goal is to maximize total value within a weight limit.
Example: If you have items with weights [1, 2, 3] and values [10, 15, 40], and a capacity of 6, the optimal selection is items 2 and 3.
The d...
Addressing low morale in the workplace requires open communication, support, and recognition.
Encourage open communication to understand the root cause of low morale
Provide support and resources to help employees overcome challenges
Recognize and appreciate employees' hard work and contributions
Organize team-building activities to boost morale and foster a positive work environment
I applied via Walk-in and was interviewed in Sep 2023. There was 1 interview round.
Coding is the process of writing instructions in a specific programming language, while programming involves the entire process of designing, writing, testing, and maintaining code.
Coding is the act of translating a problem into a language that a computer can understand.
Programming involves planning, designing, implementing, and testing a solution to a problem.
Coding is a subset of programming, focusing on the actual w...
BFS is a graph traversal algorithm that visits all the nodes of a graph level by level.
Start by adding the initial node to a queue
While the queue is not empty, dequeue a node and visit its neighbors, adding them to the queue
Repeat until all nodes are visited
DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
Start at the initial node and explore as far as possible along each branch before backtracking
Use a stack to keep track of nodes to visit
Mark visited nodes to avoid revisiting them
Can be implemented recursively or iteratively
Topics - dsa
duration - 1hr
I am a recent graduate with a passion for marketing and social media. I enjoy hiking, photography, and trying new foods.
Recent graduate with a degree in Marketing
Passionate about social media and digital marketing
Hobbies include hiking, photography, and trying new foods
I applied via Job Portal and was interviewed in Jan 2024. There were 2 interview rounds.
1-hour test on google online challenge
A motivated intern with a background in [Your Field], eager to learn and contribute to the team while developing professional skills.
Currently pursuing a degree in [Your Major] at [Your University].
Completed an internship at [Company Name], where I assisted in [specific task or project].
Skilled in [specific skills or tools relevant to the position].
Passionate about [specific interest related to the field], demonstrated...
based on 18 interview experiences
Difficulty level
Duration
based on 31 reviews
Rating in categories
Software Engineer
2.5k
salaries
| ₹34.2 L/yr - ₹83 L/yr |
Software Developer
2k
salaries
| ₹35.7 L/yr - ₹71.1 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹20.7 L/yr - ₹82.2 L/yr |
Data Analyst
361
salaries
| ₹15.7 L/yr - ₹35 L/yr |
Sde1
357
salaries
| ₹16 L/yr - ₹64 L/yr |
Yahoo
Amazon
Microsoft Corporation