Upload Button Icon Add office photos

Google

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Clear (1)

Google Graphic Designer Interview Questions and Answers

Updated 4 Oct 2023

Google Graphic Designer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. What do you mean by success
Round 2 - One-on-one 

(1 Question)

  • Q1. How are you doing in your life
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Assignment 

I had to make an email banner design

Round 2 - One-on-one 

(2 Questions)

  • Q1. Asked about my personal interest
  • Q2. Why did i wanted to choose this company

Graphic Designer Interview Questions Asked at Other Companies

asked in Vistaprint
Q1. If assignment goes perfect and you are suitable for the job then ... read more
asked in Consulero
Q2. What is the difference between photoshop and illustrator?
asked in Consulero
Q3. Tell me about masks and clipping masks in photoshop?
Q4. How much you updated tobyour software and knowledge about your cr ... read more
asked in Consulero
Q5. What is the difference between vector and raster images?

Interview questions from similar companies

I applied via Company Website and was interviewed in Aug 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

Ankita Shankar surve. my education graphic design and fine art - drawing and painting.

Interview Preparation Tips

Topics to prepare for Amazon Graphic Designer interview:
  • Graphic Designing
Interview preparation tips for other job seekers - Adobe Photoshop, Adobe InDesign ,Adobe illustrator ,coral draw.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Walk-in and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Related java question
  • Q2. Coding questions
Round 2 - HR 

(2 Questions)

  • Q1. About salary discussion
  • Q2. What is your strength
  • Ans. 

    My strength lies in my ability to think creatively and problem-solve efficiently.

    • Strong visual communication skills

    • Proficient in Adobe Creative Suite

    • Ability to work under pressure and meet deadlines

    • Experience in creating visually appealing designs for various platforms

    • Strong attention to detail

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Good
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Maths,Quant, Reasoning

Round 2 - Technical 

(1 Question)

  • Q1. Advanced Excel,Power bi,Sql
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

DSA round was there it was good

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. Tell me about yourself
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I was interviewed before Jul 2023.

Round 1 - Coding Test 

45 min round. Similar to Leetcode medium level question.

Round 2 - Coding Test 

45 min coding round, 2 question asked

Round 3 - Technical 

(1 Question)

  • Q1. System design of proximity service
  • Ans. 

    Design a system for proximity service

    • Utilize geolocation data to track user locations

    • Implement algorithms to calculate proximity between users

    • Use real-time updates to notify users of nearby contacts

  • Answered by AI
Round 4 - One-on-one 

(1 Question)

  • Q1. Behavioral questions

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Why you want to join facebook?
  • Ans. 

    I want to join Facebook because of its innovative technology, global impact, and opportunities for growth.

    • Innovative technology: Facebook is known for its cutting-edge technology and constant innovation.

    • Global impact: Working at Facebook would allow me to contribute to a platform that connects billions of people worldwide.

    • Opportunities for growth: Facebook offers a dynamic and fast-paced work environment with ample opp...

  • Answered by AI
  • Q2. Whats the best feature you like in Facebook?
  • Ans. 

    I appreciate the personalized news feed feature on Facebook.

    • Personalized news feed shows content based on user interests

    • Helps users stay updated on relevant information

    • Allows users to engage with content they are interested in

  • Answered by AI

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Hard

This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were preety hard according to me . One has to have a fair share of knowledge in Data Structures and Algorithms to pass this round .

  • Q1. 

    Longest Increasing Path in a 2D Matrix Problem Statement

    Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...

  • Ans. 

    The task is to find the length of the longest increasing path in a 2D matrix, where you can move in four directions: left, right, up, or down from each cell.

    • Traverse the matrix and for each cell, find the longest increasing path starting from that cell

    • Use dynamic programming to store the length of the longest increasing path for each cell

    • Recursively explore all four directions from each cell, checking if the next cell ...

  • Answered by AI
  • Q2. 

    Saving Money Problem Statement

    Ninja is adventurous and loves traveling while being mindful of his expenses. Given a set of 'N' stations connected by 'M' trains, each train starting from station 'A' and r...

  • Ans. 

    The task is to find the cheapest price from the given source to destination with up to K stops.

    • Read the number of test cases

    • For each test case, read the number of stations and trains

    • Read the details of each train (source, destination, ticket price)

    • Read the source station, destination station, and maximum number of stops

    • Implement a graph data structure to represent the stations and trains

    • Use a modified version of Dijkst...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the
approach the time complexity and proper code covering all cases.

  • Q1. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    The task is to print every path of a binary tree with the sum of nodes in the path as 'K'.

    • Traverse the binary tree and keep track of the current path and its sum

    • At each node, check if the sum of the current path equals 'K'

    • If yes, add the current path to the result

    • Continue traversing the left and right subtrees recursively

    • Remove the current node from the path before backtracking

  • Answered by AI
  • Q2. 

    Combination Sum Problem Statement

    Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...

  • Ans. 

    The task is to find all unique combinations in an array whose sum is equal to a given target sum.

    • Use backtracking to generate all possible combinations

    • Sort the array in non-decreasing order to ensure elements in each combination are in non-decreasing order

    • Start with an empty combination and iterate through the array, adding each element to the combination and recursively calling the function with the remaining sum

    • If th...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed
the approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was
related to OS and was a bit theoretical .

  • Q1. 

    Merging Accounts Problem

    Given a list ACCOUNTS where each element consists of a list of strings, with the first element being the name of the account holder, and the subsequent elements being the email ad...

  • Ans. 

    The task is to merge accounts belonging to the same person based on common emails and return the merged accounts.

    • Iterate through each account and create a mapping of emails to account holders

    • Iterate through the mapping and merge accounts with common emails

    • Sort the merged accounts and return the result

  • Answered by AI
  • Q2. 

    Binary Tree Construction from Preorder and Inorder Traversal

    The goal is to construct a binary tree from given preorder and inorder traversal lists of the tree nodes.

    Example:

    Input:
    preorder = [1, 2, ...
  • Ans. 

    The task is to construct a binary tree using the given inorder and preorder traversals.

    • Use the preorder traversal to determine the root of the binary tree

    • Use the inorder traversal to determine the left and right subtrees of the root

    • Recursively construct the left and right subtrees

    • Return the root node of the constructed binary tree

  • Answered by AI
  • Q3. Can you explain the concept of demand paging?
  • Ans. 

    Demand paging is a memory management technique where pages are loaded into memory only when needed.

    • Demand paging allows for efficient memory utilization by loading pages into memory on demand.

    • It reduces the amount of initial memory required to start a process.

    • When a page is needed but not in memory, a page fault occurs and the required page is loaded from disk.

    • Demand paging allows for larger virtual memory space than p...

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to
asnwers all the questions with some help from the interviewer.

General Tip : While preparing for Facebook Interviews , make sure you read and understand some of the most important features that Facebook incorporates like Graph Search , Adding a friend , Removing a friend , Storing Likes/Dislikes and so on. 
All these features are important to learn because at their core they are nothing but Data Structures used and implemented very elegantly . So before your next Facebook interview , do read these topics and be confident about your LLD as well as HLD skills.

  • Q1. How does Facebook store likes and dislikes?
  • Ans. 

    Facebook stores likes/dislikes using a combination of databases and caching systems.

    • Likes/dislikes are stored in a distributed database system like Cassandra or HBase.

    • Each like/dislike is associated with a user and the content being liked/disliked.

    • The database is sharded to handle the large volume of likes/dislikes.

    • Caching systems like Memcached or Redis are used to improve read performance.

    • Likes/dislikes can be stored...

  • Answered by AI
  • Q2. How does Facebook implement graph search?
  • Ans. 

    Facebook implements graph search by indexing user connections and content to enable efficient search queries.

    • Facebook indexes user connections and content to build a graph database.

    • The graph database is used to store and retrieve information about users, their relationships, and their content.

    • Graph search queries are executed by traversing the graph database to find relevant connections and content.

    • Facebook uses variou...

  • Answered by AI
  • Q3. How does Facebook Chat work?
  • Ans. 

    Facebook Chat is a real-time messaging system that allows users to send and receive instant messages.

    • Facebook Chat uses a client-server architecture.

    • It utilizes long polling or WebSockets for real-time communication.

    • Messages are stored in a message queue for delivery.

    • Chat messages are encrypted for security.

    • Facebook Chat supports features like read receipts, typing indicators, and group chats.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Google Interview FAQs

How many rounds are there in Google Graphic Designer interview?
Google interview process usually has 3 rounds. The most common rounds in the Google interview process are One-on-one Round, Resume Shortlist and Assignment.

Recently Viewed

SALARIES

Arista Networks

REVIEWS

Ashirvad Pipes

No Reviews

JOBS

Spark Private Wealth

No Jobs

SALARIES

Grasim Industries

SALARIES

Ashirvad Pipes

SALARIES

The Ramco Cements

SALARIES

Arista Networks

JOBS

TE Connectivity

No Jobs

INTERVIEWS

Ashirvad Pipes

No Interviews

JOBS

Varun Beverages

No Jobs

Tell us how to improve this page.

Google Graphic Designer Interview Process

based on 4 interviews

Interview experience

4.3
  
Good
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
IBM Interview Questions
4.0
 • 2.3k Interviews
Oracle Interview Questions
3.7
 • 846 Interviews
Amdocs Interview Questions
3.7
 • 512 Interviews
Zoho Interview Questions
4.3
 • 505 Interviews
SAP Interview Questions
4.2
 • 283 Interviews
KPIT Technologies Interview Questions
3.4
 • 278 Interviews
Adobe Interview Questions
3.9
 • 233 Interviews
View all
Google Graphic Designer Salary
based on 22 salaries
₹2.8 L/yr - ₹9.2 L/yr
58% more than the average Graphic Designer Salary in India
View more details

Google Graphic Designer Reviews and Ratings

based on 8 reviews

3.6/5

Rating in categories

4.2

Skill development

4.1

Work-life balance

4.2

Salary

4.0

Job security

4.3

Company culture

4.2

Promotions

4.2

Work satisfaction

Explore 8 Reviews and Ratings
Software Engineer
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
1.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
719 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Scientist
287 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst
242 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Google with

Yahoo

4.6
Compare

Amazon

4.1
Compare

Facebook

4.3
Compare

Microsoft Corporation

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview