New
Know More
New
Know More
New
Know More
View All Preparation Packages

Google

No of Coding Questions
Coding Questions :
No. of MCQ Questions
MCQ Questions :
No. of Mock Tests
Mock Test :
Arrow leading towards next section of Landing Page

About Google

Google is a globally renowned technology company and is a part of the big-4 tech companies. It is a well-established name in the tech industry. The role of a software engineer at Google is to bring changes in the way billions of users connect and share information on the internet.

Google prides itself on being an engineering company and thus looks for individuals who can handle complex problems. In India, Google's engineers work on several aspects including scalability, storage solutions, large-scale applications, and new user platforms, besides the ubiquitous Google search.

Google India is seeking to recruit both freshers and experienced professionals as software engineers who possess a diverse range of technical skills and can bring innovative ideas to the company's critical domains. These areas include distributed computing, information retrieval, large-scale system design, networking and data storage, security, and artificial intelligence.

Are you planning to sit for the Google placement exam in India? If so, you need to be well-prepared to ace the assessment. The Google placement exam is a highly competitive test that is designed to evaluate the technical knowledge and skills of engineering graduates.

To help you prepare for the exam, it's crucial to know the best practices and advice for the test. You should practice solving placement exam practice questions to familiarize yourself with the exam pattern and syllabus. You should also know the interview questions that might be asked during the placement process.

To register for the Google placement exam, you need to follow the registration process that is outlined on the company's official website. Once you've registered, you should focus on how to crack the placement exam. Remember, cheating in the placement exam is not possible, and you should rely on your skills and knowledge to ace the test.

If you're aiming to become a software engineer at Google, you need to possess the technical skills and knowledge required for the role. The exam pattern and syllabus typically include topics like algorithms, data structures, programming, operating systems, and computer networks. With the right preparation and hard work, you can crack the Google placement exam and land your dream job at this tech giant.

Benefits Of Google Recruitment Exam

1. Healthcare Benefits

Google offers its employees medical insurance. Googlers have the option to customize comprehensive medical coverage for themselves, their spouses, and any dependents they have.

2. Work/Life Balance

Google offers a variety of learning, social, and development programs to help employees achieve a good work-life balance.

3. Parental Leave

People have a legal entitlement to time off when they welcome a new child through childbirth, adoption, or fostering. Google makes sure that it gives both parents time off at home before returning to work.

4. Paid Time Off

Most salaried employees are entitled to paid time off (PTO), although it is usually limited to sick and vacation days. Google provides a lot more to its employees, including bereavement leave.

5. Financial & Retirement Benefits

To ensure the financial wellbeing of its employees, Google provides financial incentives, such as a 401(k) matching program.

6. Flexibility

Google uses a hybrid work model that gives employees (in most roles) two work-from-home days every week. The company also offers four “work from anywhere” weeks per year.

7. Food & Snacks

The free lunches provided on the company's office campuses are one of Google’s most popular perks. The Google Office Campuses have various cafes, restaurants, and well-stocked micro kitchens that give free meals to Googlers.

8. Fitness Facilities

With its focus on its employees’ health and wellness, it comes as no surprise that one of the top Google employee perks is access to fitness facilities.

9. Mental Wellbeing

Google cares about the mental well-being of its employees. It provides employee assistance programs that are focused on mental health.

10. Onsite Services & Conveniences

Google’s perks and benefits exist to make life better and easier for the whole team team. As such, the company also offers a range of onsite services.

11. Other Incentives

Google has its own gold star system, in which employees are rewarded with massage credits for a job well done. Employees can also donate their massage credits to coworkers in the spirit of giving.

Eligibility Criteria For Google Recruitment Exam

  • A Bachelor’s degree in Engineering with a good academic record is required to apply for a job at Google.
  • The candidate should have scored at least 65 percent marks throughout their academic career in 10th, 12th, and B.Tech course individually.
  • The candidate should not have any active backlogs when applying.
  • The candidate should have good knowledge of the internet, web search, online advertising, numerical analysis, e-commerce, firewalls, and related areas.
  • The candidate should have a strong hold on any of the basic programming languages such as C++ or JAVA.
  • Strong written, verbal, and interpersonal communication skills are required for the job.
  • Good analytical skills are necessary for the job.

Syllabus & Examination Process For Google Recruitment Exam

Recruitment Process:

  • Online Assessment
  • Technical Phone Screen
  • Onsite
  • Coding Rounds (4-5)
  • Behavioral (Googleyness)

Google Eligibility Criteria:

  • Bachelor's degree or equivalent practical experience.

Online Assessment:

  • 2 coding questions on data structures and algorithms (medium to hard level)

Technical Phone Screen:

  • Conducted by tech leads via Google Meet or Hangouts
  • Aimed at experienced software engineers

Coding Rounds:

  • Evaluate problem-solving skills, system design questions, computer science concepts, and project discussions

Behavioral Rounds:

  • Assess personality, attitude, soft skills, etc.

Interview Experience:

Access to interview experiences of past candidates to help prepare for the process.

Step 1: Resume screening

The hiring manager screens through all the applications and resumes received to identify potential candidates. Shortlisted candidates may be asked to take an online assessment or coding quiz.

Step 2: Interview process

This stage involves virtual interviews, project work, and in-depth interviews. Virtual interviews are designed to assess the candidate's experience and skills. Project work may include coding samples or assignments to understand the candidate's approach to problem-solving. In-depth interviews can include multiple structured interviews to assess the candidate's skills and knowledge.

Step 3: Final assessment and review

The candidate is evaluated based on their application form, resume, project work, and interview responses. Candidates are ranked based on their performance, and the hiring team shortlists the best-suited candidates for the job. The compensation committee reviews and finalizes the compensation/salary for the offer.

Step 4: Hiring decision and offer

The recruiter extends the offer to the selected candidates. Once accepted, Google's onboarding process begins, including prepping the candidate on company culture, benefits, insurance, badging, etc.

Arrow leading towards next section of Landing Page
Arrow leading towards next section of Landing Page

Popular Questions

#Pairs of bishops attacking each other

On our special chessboard, two bishops attack each other if they share the same diagonal. This includes bishops that have another bishop located between them, i.e. bishops can attack through pieces.

You are given N bishops, represented as (row, column) tuples on a M*M chessboard. Write a function to count the number of unordered pairs of bishops that attack each other.

#Input Format

```sh

  • First line will contain two space separated integers M & N.
  • Each of the next N lines will contain two space separated integers denoting row and column of the bishop respectively.

```

#Output Format

```sh

  • In a single line print the number of unordered pair of bishops that attack each other.

```

#Constraints

```sh

  • 1<= M <=300
  • 1<= N <= M*M
  • Each of the row and column pairs is withing the chessboard.

```

Previously Asked Question

#Pairs of bishops attacking each other

On our special chessboard, two bishops attack each other if they share the same diagonal. This includes bishops that have another bishop located between them, i.e. bishops can attack through pieces.

You are given N bishops, represented as (row, column) tuples on a M*M chessboard. Write a function to count the number of unordered pairs of bishops that attack each other.

#Input Format

```sh

  • First line will contain two space separated integers M & N.
  • Each of the next N lines will contain two space separated integers denoting row and column of the bishop respectively.

```

#Output Format

```sh

  • In a single line print the number of unordered pair of bishops that attack each other.

```

#Constraints

```sh

  • 1<= M <=300
  • 1<= N <= M*M
  • Each of the row and column pairs is withing the chessboard.

```

Testimonials

Vaishnavi

Placed in
ServiceNow
-
24 LPA

Edyst's training style completely resonated with me. I approached programming as more than a subject. Thanks to Edyst team for the guidance!

Ria

Placed in
OLX
-
20 LPA

Sakila

Placed in
Adobe
-
12 LPA

I started practising on Edyst platform since my 3rd year of college focused on placements & always liked the way they helped us when we were stuck at a particular problem.
Thank you, Edyst for all the assistance and amazing support!

Pruthviraj

Placed in
Futurense
-
9.5 LPA

Sriram

Placed in
Seawise Capital
-
8 LPA

When I joined the Edyst courses I received personalized mentoring on how to crack coding rounds of different companies. Through a combination of coding skills and great projects, I received multiple offers above 6+ lakhs per annum. Finally I joined for 8+ Lakhs package. Thanks for all the support, from Edyst Team.

Dileep

Placed in
TCS Digital
-
7 LPA+

Being a mechanical student and getting into an IT company is very tough. One of the main reason I could able to crack TCS CodeVita is because of Edyst.
Aneeq sir, your doubt clearing sessions, daily assignments & incredible mentors support really brushed up my skills.

Arrow leading towards next section of Landing Page

Coding Interview Round Sample Questions 

Here are some examples of coding interview questions that may be asked (entry-level candidates with little or no professional experience):

#Pairs of bishops attacking each other

On our special chessboard, two bishops attack each other if they share the same diagonal. This includes bishops that have another bishop located between them, i.e. bishops can attack through pieces.

You are given N bishops, represented as (row, column) tuples on a M*M chessboard. Write a function to count the number of unordered pairs of bishops that attack each other.

#Input Format

```sh

  • First line will contain two space separated integers M & N.
  • Each of the next N lines will contain two space separated integers denoting row and column of the bishop respectively.

```

#Output Format

```sh

  • In a single line print the number of unordered pair of bishops that attack each other.

```

#Constraints

```sh

  • 1<= M <=300
  • 1<= N <= M*M
  • Each of the row and column pairs is withing the chessboard.

```

Dropdown Icon

#Pairs of bishops attacking each other

On our special chessboard, two bishops attack each other if they share the same diagonal. This includes bishops that have another bishop located between them, i.e. bishops can attack through pieces.

You are given N bishops, represented as (row, column) tuples on a M*M chessboard. Write a function to count the number of unordered pairs of bishops that attack each other.

#Input Format

```sh

  • First line will contain two space separated integers M & N.
  • Each of the next N lines will contain two space separated integers denoting row and column of the bishop respectively.

```

#Output Format

```sh

  • In a single line print the number of unordered pair of bishops that attack each other.

```

#Constraints

```sh

  • 1<= M <=300
  • 1<= N <= M*M
  • Each of the row and column pairs is withing the chessboard.

```

Dropdown Icon
Dropdown Icon
Dropdown Icon
Dropdown Icon
Dropdown Icon

Technical Interview Round Sample Questions 

Here are some examples of technical interview questions that may be asked (entry-level candidates with little or no professional experience):
How long will you stay with us before you start looking for another job?
Dropdown Icon
Previously Asked Question
Dropdown Icon
What subjects did you enjoy the least?
Dropdown Icon
What subjects did you enjoy the most?
Dropdown Icon
Why did you do CSE?
Dropdown Icon
Will you be able to work with your supervisors and other employees in this organization?
Dropdown Icon

HR Interview Round Sample Questions

Here are some examples of technical interview questions that may be asked (entry-level candidates with little or no professional experience):
How long will you stay with us before you start looking for another job?
Dropdown Icon
Previously Asked Question
Dropdown Icon
What subjects did you enjoy the least?
Dropdown Icon
What subjects did you enjoy the most?
Dropdown Icon
Why did you do CSE?
Dropdown Icon
Will you be able to work with your supervisors and other employees in this organization?
Dropdown Icon