Upload Button Icon Add office photos

Filter interviews by

Fiverr Inc. Sdet Interview Questions and Answers

Updated 15 May 2024

Fiverr Inc. Sdet Interview Experiences

1 interview found

Sdet Interview Questions & Answers

user image Clash with Aditya

posted on 15 May 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was a startup asked basic DSA question, followed by explain the framework
Round 2 - Technical 

(1 Question)

  • Q1. Basic SQl question followed by real time scenario like gave me a medical problem and write the manual and automation test cases for it
Round 3 - HR 

(1 Question)

  • Q1. Salary negotiation

Interview questions from similar companies

Interview Questionnaire 

8 Questions

  • Q1. Program to find the angle between the hands of a clock. Input- the time. Expected output- Angle in degrees
  • Ans. 

    Program to find the angle between the hands of a clock given the time.

    • Calculate the angle of the hour hand from 12 o'clock position

    • Calculate the angle of the minute hand from 12 o'clock position

    • Calculate the absolute difference between the two angles

    • If the difference is greater than 180 degrees, subtract it from 360 degrees

    • Return the absolute value of the difference as the angle between the hands

  • Answered by AI
  • Q2. How do you find if given two linked lists intersect or not
  • Ans. 

    To find if two linked lists intersect, traverse both lists and compare their tail nodes.

    • Traverse both linked lists and find their lengths

    • If the lengths are different, move the longer list's head pointer to the difference in length

    • Now traverse both lists and compare their nodes until a common node is found

    • If no common node is found, the lists do not intersect

  • Answered by AI
  • Q3. Explain basic concept of JOINS in sql
  • Ans. 

    JOINS are used to combine rows from two or more tables based on a related column between them.

    • JOINS are used to retrieve data from multiple tables in a single query

    • There are different types of JOINS - INNER, LEFT, RIGHT, FULL OUTER

    • JOINS are based on a related column between the tables

    • Syntax: SELECT * FROM table1 JOIN table2 ON table1.column = table2.column

  • Answered by AI
  • Q4. If in a given table, consisting of student name and grade, Output a table containing each grade and its frequency in descending order
  • Q5. Questions regarding my final year project
  • Q6. SQL queries
  • Q7. If you are given a sorted array of size 7 but only 4 elements in it and a sorted array of 3 elements. How would to combine the elements into the first array in such a way that array is sorted
  • Ans. 

    Combine 4 elements of a sorted array of size 7 and a sorted array of 3 elements to make a sorted array.

    • Insert the 3 elements of the smaller array into the larger array

    • Sort the larger array using any sorting algorithm

  • Answered by AI
  • Q8. How do you find if a string is a palindrome or not?
  • Ans. 

    To check if a string is a palindrome, compare the first and last characters, then move towards the center.

    • Remove all non-alphanumeric characters and convert to lowercase

    • Use two pointers, one starting from the beginning and the other from the end

    • Compare the characters at both pointers, move towards the center until they meet

    • If all characters match, the string is a palindrome

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: online test from HackerEarth. It had 3 programming questions, out of which we had to program any two. The questions were: 1) To reverse the words in a given string2) I don’t remember this question properly but was something similar to this…. Finding all the factors of a given number and finding if the one’s position of the factorial and the number were same..

There were 30 other MCQs from aptitude, programming, data structures and algorithms.

After the online test, there were 3 rounds

Round: Technical Interview
Experience: I was given two scenarios to write test cases(apart from UItesting). One was the flipkart coupon textbox from checkout page and the other was the gmail application. He also asked me sql query to remove all duplicates from a table having multiple duplicates.

College Name: NA

Skills evaluated in this interview

Sdet Interview Questions & Answers

Swiggy user image Anonymous

posted on 23 Sep 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Strings, Arrays , Hashmaps were asked

Round 2 - Technical 

(2 Questions)

  • Q1. Architecture of your product
  • Ans. 

    Our product follows a microservices architecture, utilizing Docker containers and Kubernetes for scalability and reliability.

    • Microservices architecture

    • Utilization of Docker containers

    • Scalability and reliability through Kubernetes

  • Answered by AI
  • Q2. Diff between SQL /DBMS
  • Ans. 

    SQL is a language used to query databases, while DBMS is a software system that manages databases.

    • SQL is a language used to interact with databases, allowing users to retrieve, update, and manipulate data.

    • DBMS is a software system that manages databases, providing functionalities like data storage, retrieval, and security.

    • Examples of SQL include SELECT, INSERT, UPDATE, DELETE statements, while examples of DBMS include

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

There were 2 questions in coding one with array and in string releated

Round 2 - One-on-one 

(3 Questions)

  • Q1. About Selenium questions
  • Q2. Other basic questions related to testing
  • Q3. Management related question
Round 3 - HM 

(2 Questions)

  • Q1. One program to solve
  • Q2. Other questions in selenium

I applied via Recruitment Consultant and was interviewed before Sep 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. About last experience
  • Q2. About e-commerce industry

Interview Preparation Tips

Interview preparation tips for other job seekers - Use common sense during the 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

Software Developer Interview Questions & Answers

Flipkart user image RAJIVTEJA NAGIPOGU

posted on 25 Aug 2015

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: The test started very late due to some technical issues and space issues. So , It helped us to be far more relaxed.
Duration: 11/2 hr minutes
Total Questions: 2

Round: Technical Interview
Experience: The Overall Technical Interview was a mixture of innovation and apprehension and it really helped me to get my strengths and weaknesses out. The questions outsmarted me at the beginning, Later I did.

Round: HR Interview
Experience: HR was very friendly. He asked about my strengths and weaknesses. And then we continued talking about the nature of work and sincerity and technicality expected from my side, while taking a stroll in cool night air.

Skills: Algorithms and DataStructures
Duration: 2 months
College Name: IIT Madras
Motivation: The work specification

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. First question was about a robot and tracking his movements.Given a string of moves a robot makes check if he ends up at the location he starts from?
  • Q2. Given a list of stars and their distances from the earth.Find an efficient solution to find the k closest stars to earth?
  • Ans. 

    Efficient solution to find k closest stars to earth from a list of stars and their distances.

    • Use a priority queue to store the distances of stars from earth.

    • Iterate through the list of stars and add their distances to the priority queue.

    • Pop k elements from the priority queue to get the k closest stars to earth.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The online coding test is not that difficult. The questions are very easy. Only thing is that you have to come up with an efficient solution.The naive solutions are fairly obvious.
Tips: Practice some algorithms questions.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: First question was very simple. I was asked for the solution first and then to write the code on paper and show it to him.Second question requires more time to think.
Tips: A good knowledge of data structures and algorithms will help you clear the interview with ease.

Round: HR Interview
Experience: The guy asking questions makes you feel relaxed. He will give you a feedback about the test and the questions asked in the test. I appreciated the feedback. He pointed out things i could have done better.
Tips: The HR interview is relatively easy. Its just a chat about you and your interests and some other questions like "why should I hire you?".

General Tips: A good knowledge of Data structures and Algorithms will help clear the interview and the test.
Skill Tips: Practice Data structures and Algorithms questions.
Skills: Data structures and Algorithms, Coming up with efficient solutions
Duration: 2
College Name: IIT Madras
Motivation: I wanted to apply for Flipkart as I have seen its meteoric rise in the past few years. It has transformed the wasy people shop in India.

Skills evaluated in this interview

Fiverr Inc. Interview FAQs

How many rounds are there in Fiverr Inc. Sdet interview?
Fiverr Inc. interview process usually has 3 rounds. The most common rounds in the Fiverr Inc. interview process are Technical and HR.
What are the top questions asked in Fiverr Inc. Sdet interview?

Some of the top questions asked at the Fiverr Inc. Sdet interview -

  1. Basic SQl question followed by real time scenario like gave me a medical proble...read more
  2. It was a startup asked basic DSA question, followed by explain the framew...read more

Tell us how to improve this page.

Fiverr Inc. Sdet Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 424 Interviews
BigBasket Interview Questions
3.9
 • 357 Interviews
PolicyBazaar Interview Questions
3.6
 • 346 Interviews
Udaan Interview Questions
3.9
 • 333 Interviews
CARS24 Interview Questions
3.6
 • 329 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
JustDial Interview Questions
3.5
 • 325 Interviews
View all
Freelancer
168 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