Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
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 people are saying about Google
Google interview questions for designations
What is 10% of 10
what is ram age if he is now 2 years
Get interview-ready with Top Google Interview Questions
DSA, coding questions
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
1 Interview rounds
based on 36 reviews
Rating in categories
Software Engineer
1.3k
salaries
| ₹19.6 L/yr - ₹80 L/yr |
Software Developer
1.1k
salaries
| ₹21.8 L/yr - ₹56.7 L/yr |
Senior Software Engineer
610
salaries
| ₹22 L/yr - ₹94 L/yr |
Sde1
254
salaries
| ₹14 L/yr - ₹55 L/yr |
Data Scientist
248
salaries
| ₹25 L/yr - ₹55 L/yr |
Yahoo
Amazon
Microsoft Corporation