Google Intern Interview Questions and Answers

There are various types of graphs used in data visualization, such as bar graphs, line graphs, pie charts, scatter plots, and histograms.

• Bar graph - used to compare different categories

• Line graph - shows trends over time

• Pie chart - displays parts of a whole

• Scatter plot - shows relationship between two variables

• Histogram - displays distribution of data

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++

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 writing of code.

• Programming encompasses a broader range of ...read more

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

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

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