Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Fiverr Inc. Freelance Graphic Designer Interview Questions and Answers

Updated 5 Jan 2023

Fiverr Inc. Freelance Graphic Designer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Information about graphic design
  • Q2. My experience about my work and my new projects

Interview Preparation Tips

Interview preparation tips for other job seekers - Always be positive and say your strengths about yourself

Interview questions from similar companies

I applied via Naukri.com and was interviewed in May 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Question are majorly based on to understand my knowledge and work experience

Interview Preparation Tips

Interview preparation tips for other job seekers - The whole process was too soomth... And organised.. had 3-4 rounds of discussion and a technical assemement and everything was pretty smooth from beginning to day of joining...

And to be honest this was best onboarding experience till now in work experience history.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Make some design samples
  • Ans. 

    I will create design samples showcasing my skills and creativity.

    • Create a variety of design samples such as logos, brochures, websites, and social media graphics

    • Showcase different styles and techniques to demonstrate versatility

    • Include both digital and print designs to highlight proficiency in various mediums

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Machine test and it’s was good

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.

Round 1 - One-on-one 

(3 Questions)

  • Q1. Flipkart ke bare mein kya jante Hain
  • Q2. Flipkart sabse pahle kahan open ho
  • Q3. An engineering manager of the team you are interviewing for will use several behavioral

Interview Preparation Tips

Interview preparation tips for other job seekers - These interview rounds assess a candidate's proficiency in problem-solving, data structures, and algorithms, including coding problems on arrays, lists, graphs, trees, dynamic programming, recursion, linked list, queues, trees, maps, etc.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. About my background and experience
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Referral and was interviewed before Sep 2023. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. What are your strengths and weaknesses?
  • Ans. 

    My strengths include creativity, attention to detail, and strong communication skills. My weaknesses include a tendency to be a perfectionist and difficulty saying no.

    • Strengths: creativity, attention to detail, strong communication skills

    • Weaknesses: perfectionism, difficulty saying no

  • Answered by AI

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 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

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart 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

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 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 interviewRejected

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: It was a good one but both questions would have been easy if we know more libraries in java
Tips: Both the questions were related to bigint. It could have been better if both questions were from different areas
Duration: 90 minutes

Round: Technical Interview
Experience: I felt my interview went fine since i was able to answer most of their questions.They gave many hints even if i didn't get the right one
Tips: Everything was fine

Round: HR Interview
Experience: I was able to see myself how i responded to questions asked regarding me and sometimes i was just blabbering
Tips: nothing

General Tips: One must be good at datastrucures and algorithms
Skill Tips: nothing
Skills: Datastructures and Algorithms
Duration: 2
College Name: IIT Madras
Motivation: I wanted to do something for the company where I ordered many of my things
Funny Moments: No funny moments as such but I enjoyed talking to the hr interviewer
Contribute & help others!
anonymous
You can choose to be anonymous

Fiverr Inc. Interview FAQs

How many rounds are there in Fiverr Inc. Freelance Graphic Designer interview?
Fiverr Inc. interview process usually has 2 rounds. The most common rounds in the Fiverr Inc. interview process are Resume Shortlist and One-on-one Round.

Recently Viewed

JOBS

Freelancer.com

No Jobs

REVIEWS

Freelancer.com

No Reviews

INTERVIEWS

Gurit India

No Interviews

INTERVIEWS

Fiverr Inc.

No Interviews

INTERVIEWS

Gurit India

No Interviews

INTERVIEWS

Freelancer.com

No Interviews

INTERVIEWS

Freelancer.com

No Interviews

INTERVIEWS

Freelancer.com

No Interviews

INTERVIEWS

Freelancer.com

No Interviews

INTERVIEWS

Freelancer.com

No Interviews

Tell us how to improve this page.

Fiverr Inc. Freelance Graphic Designer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
PolicyBazaar Interview Questions
3.6
 • 354 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 331 Interviews
JustDial Interview Questions
3.5
 • 329 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
View all
Fiverr Inc. Freelance Graphic Designer Salary
based on 18 salaries
₹0.5 L/yr - ₹8 L/yr
18% less than the average Freelance Graphic Designer Salary in India
View more details

Fiverr Inc. Freelance Graphic Designer Reviews and Ratings

based on 3 reviews

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

4.4

Salary

5.0

Job security

5.0

Company culture

4.0

Promotions

5.0

Work satisfaction

Explore 3 Reviews and Ratings
Freelancer
170 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Graphic Designer
33 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Freelance Graphic Designer
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Content Writer
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Entry Operator
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Fiverr Inc. with

Upwork

4.4
Compare

PeoplePerHour

5.0
Compare

Urban Company

3.4
Compare

Truelancer

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