Upload Button Icon Add office photos

Filter interviews by

Shopify Software Developer Intern Interview Questions and Answers

Updated 18 Mar 2024

Shopify Software Developer Intern Interview Experiences

1 interview found

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

(1 Question)

  • Q1. What do you mean by Array
  • Ans. 

    An array is a data structure that stores a collection of elements, typically of the same data type, in a contiguous block of memory.

    • Arrays are indexed collections of elements, with each element accessible by its position or index.

    • Arrays in most programming languages start indexing at 0.

    • Example: ['apple', 'banana', 'cherry'] is an array of strings with 3 elements.

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

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

I applied via campus placement at Dayananda Sagar College of Engineering, Bangalore and was interviewed in Oct 2024. There were 4 interview rounds.

Round 1 - Coding Test 

3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well

Round 2 - Aptitude Test 

Ssh round , quant and logical
Tip: bring your calculator

Round 3 - Technical 

(3 Questions)

  • Q1. Two Puzzle : bulb switching and candle
  • Q2. Dsa questions such as string reverse, binary search
  • Q3. Dbms and os core subject questions
Round 4 - HR 

(2 Questions)

  • Q1. How are you better than others
  • Q2. Why should we hire you

Interview Preparation Tips

Interview preparation tips for other job seekers - If you are a girl, the interview rounds will be much easier for you as this company promotes diversity hiring.
The main differing factor is technical round interview which totally depends on the interviewer's mood .
Girls do get priority in this round, they are asked easier questions and will be selected if able to answer 60-70% of the questions.
Note:- it's not like they will hire any girl but a bit easier comparatively
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.

Round 1 - Coding Test 

45 minutes
arrays, strings,
SHL

Round 2 - Technical 

(2 Questions)

  • Q1. Find number of nodes in a tree and it's time complexity
  • Ans. 

    To find number of nodes in a tree, perform a depth-first or breadth-first traversal and count the nodes. Time complexity is O(n).

    • Perform a depth-first or breadth-first traversal of the tree

    • Count the nodes as you traverse the tree

    • Time complexity is O(n) where n is the number of nodes in the tree

  • Answered by AI
  • Q2. What is abstraction and how do you implement it ??
  • Ans. 

    Abstraction is the concept of hiding complex implementation details and showing only the necessary information.

    • Abstraction allows developers to focus on the essential features of an object or system.

    • It helps in reducing complexity and improving efficiency in software development.

    • Implement abstraction in programming by using abstract classes and interfaces.

    • Example: In a car, we don't need to know the internal workings o...

  • Answered by AI
Round 3 - Technical 

(2 Questions)

  • Q1. What is the minimum number of coins to reach the target with the coins 1,2,5
  • Ans. 

    The minimum number of coins to reach a target amount can be calculated using dynamic programming.

    • Use dynamic programming to calculate the minimum number of coins needed to reach the target amount.

    • Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount.

    • Iterate through the coin denominations and update the minimum number of coins needed for each amount based

  • Answered by AI
  • Q2. Byte stream to human readable format without using library
  • Ans. 

    Convert byte stream to human readable format without using library

    • Iterate through the byte stream and convert each byte to its ASCII character representation

    • Concatenate the ASCII characters to form the human readable format

    • Handle special characters and edge cases appropriately

  • Answered by AI

Skills evaluated in this interview

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

1hr mostly was c questions focusing on pointers, arrays and strings. Few logical questions were there too

Round 2 - Coding Test 

2hrs, 5 questions. 1 easy and 4 medium. All leetcode type problems with arrays, strings and matrix

Round 3 - Coding Test 

2hrs, simple application development like creating a backend for shopping application. Only simple functions like adding products, quantity, ordering, if quantity is not there then refuse the order and such. Was not asked for DB implementations.

Round 4 - Technical 

(2 Questions)

  • Q1. How to merge a list of sorted arrays in sorted order?
  • Ans. 

    Merge sorted arrays using a min heap to maintain sorted order.

    • Create a min heap and insert the first element from each array into the heap.

    • Pop the smallest element from the heap and add it to the result array.

    • Replace the popped element in the heap with the next element from the same array.

    • Continue this process until all elements are merged.

  • Answered by AI
  • Q2. Simple discussions about oops, project etc
Round 5 - HR 

(3 Questions)

  • Q1. Self introduction for 2 mins
  • Q2. Why do you want to join Zoho?
  • Q3. What kinda word does Zoho do
  • Ans. 

    Zoho is a software company that provides cloud-based business applications.

    • Zoho offers a suite of productivity and collaboration tools such as Zoho CRM, Zoho Books, and Zoho Projects.

    • Zoho's products are designed to help businesses manage their operations more efficiently.

    • Zoho's software is cloud-based, allowing users to access their data from anywhere with an internet connection.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Grind leetcode guys. That's the only way.

Skills evaluated in this interview

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

OnCampus Test including DSA Questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. Introduce yourself
  • Q2. DSA Question based on Dynamic Programming

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for DSA
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Design a ridesharing service
  • Ans. 

    A ridesharing service connecting drivers with passengers for convenient and affordable transportation.

    • Allow users to request rides through a mobile app

    • Match drivers with passengers based on location and destination

    • Provide estimated arrival times and fare estimates

    • Implement a rating system for drivers and passengers

    • Offer options for shared rides to reduce costs

  • Answered by AI

Skills evaluated in this interview

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

There were 3 coding questions. All of them were pretty easy and solvable in less than 30 minutes. Some string and pattern matching + some number theory problems were there.

  • Q1. 

    Arithmetic Expression Evaluation Problem Statement

    You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...

  • Ans. Reverse Polish Notation

    Infix Expressions are harder for Computers to evaluate because of the additional work needed to decide precedence, so we first convert infix expressions into either postfix or prefix expressions.  In this approach, we convert Infix expression into Postfix expression also known as Reverse Polish Notation, and then evaluate the postfix expression using stack.  Note in postfix expression, ...

  • Answered Anonymously
  • Q2. 

    Maximum Product Subarray Problem Statement

    Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.

    Explanation:

    A subarray can be derived from th...

  • Ans. Brute-force

    Steps:

    1. Create an ans variable and initialize it to INT_MIN.
    2. Run a loop i = 0 to N and do:
      • Run a loop j = i to N and do:
        • Create a variable, say currentProduct and initialize it to 1.
        • Run a loop k = i to j and do:
          • currentProduct = currentProduct * arr[k]
          • Store the maximum of ans and the currentProduct in the ans variable.
    3. Finally, return the ans variable.
    Space Complexity: O(1)Explanation:

    O(1)

     

    Constant space is u...

  • Answered Anonymously
  • Q3. 

    Angle Calculation Between Clock Hands

    Given a specific time in hours and minutes, your task is to calculate the smallest possible angle between the hour hand and the minute hand of a clock.

    Example:

    Inp...
  • Ans. Using reference time
    • The idea is to take the 12:00 i.e. H = 12  and M = 0 as reference time.
    • First,  calculate the angle made by the hour hand with respect to 12:00 in H hours and M minutes. In 12 hours the hour hand moves by 360 degrees i.e. 30 degrees in 1 hour and 0.5 degrees in 1 minute. So in H hours and M minutes, the angle moved by hour hand is  0.5 * (H * 60 + M).
    • Then, calculate the angle made by m...
  • Answered Anonymously
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.

  • Q1. 

    Problem Statement: Sibling Nodes

    You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your objective is to identify and list all nodes that do not possess a...

  • Ans. DFS Approach

    The idea here is to use the fact that if a node of the binary tree has two child nodes, then both of them will be siblings to each other, and if a node of the binary tree has only one child, then that child will not have any sibling.

    Example 

    In above figure 1 has two children, so nodes 3 and 4 are siblings to each other. Also, 3 has only one child, i.e., 5 and 5 have no sibling node.


    So, we will use a df...

  • Answered Anonymously
  • Q2. Design an elevator system for a single building with N floors.
  • Ans. 

    Tip 1 : Discuss first about how the product(here, elevator) will function.
    Tip 2 : Start making with the most basic classes for the elevator.
    Tip 3 : One by one after making the basic class, add new functionalities to it, taking care of all corner cases.

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaNo criteriaMicrosoft interview preparation:Topics to prepare for the interview - Data Structures and Algorithms problems with Trees, Graphs, stack etc. Basic System Designing. Database Management System and SQL queries. Operation System and Process Scheduling techniques.Time required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Make sure to solve the most recommended problems of LeetCode. Around 200 will do
Tip 2 : Be confident with your basics of chapters from Operating Systems and DBMS or SQL Queries.
Tip 3 : Have a slight knowledge of system designing concepts.

Application resume tips for other job seekers

Tip 1 : Make your Resume such that it is properly readable. Keep it of one page. If it exceeds try your best to include only the most important highlights.
Tip 2 : Put your most important achievements at the top and after than the not so important ones. You want the interviewer to see them first.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 150 minutes
Round difficulty - Medium

It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..

  • Q1. 

    Prime Time Again Problem Statement

    You are given two integers DAY_HOURS and PARTS. Consider a day with DAY_HOURS hours, which can be divided into PARTS equal parts. Your task is to determine the total ins...

Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. Can you describe your projects and the tech stack you used in them?
Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in HyderabadEligibility criteriaNo criteriaNCR Corporation interview preparation:Topics to prepare for the interview - OOPS, Aptitude, Data Structures, DBMS, Recursion, Dynamic Programming, PuzzlesTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG. 
Tip 3 : Should have good knowledge of OOPS.

Application resume tips for other job seekers

Tip 1 : Have some good projects on your resume.
Tip 2 : Do not anything false in your resume.
Tip 3 : Mention your coding profiles in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Telephonic Call 

Round duration - 90 Minutes
Round difficulty - Easy

It was a telephonic round. The interview asked me these questions.
 

Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
 

  • Q1. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. Brute Force Approach

    Here, we can simply run two loops. The outer loop picks all elements one by one and the inner loop finds the frequency of the picked element and compares it with the maximum present so far.

     

    Algorithm:

     

    • Declare 4 variables as ‘maxFrequency’ , ‘currentFrequency’ , ‘maxElement’ , ‘currentElement’ and initialize them with 0
    • Run a loop from ‘i’ = ‘0’ to ‘N’
      • Set ‘currentElement’ as arr[i] and ‘curr...
  • Answered Anonymously
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree

  • Q1. Design a parking lot system.
  • Q2. 

    Zigzag Binary Tree Traversal Problem Statement

    Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...

  • Ans. Iterative Approach

    Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level. 

     

    Steps are as follows:

     

    1. Create an empty queue.
    2. For each node, first, the node is visited and then it’s child nodes are added in the queue if they exist(First in first out).
    3. ...
  • Answered Anonymously
Round 4 - Video Call 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.

  • Q1. 

    Tree Symmetricity Problem Statement

    You are provided with a binary tree structure, where each node consists of an integer value. Your task is to determine whether this binary tree is symmetric.

    A symmetr...

  • Ans. Inorder And Reverse Inorder

    We do two inorder traversals recursively of the tree simultaneously. For the first traversal, we traverse the left child first and then the right child, and in the second traversal, we traverse the right child first and then the left child. Let cur1 and cur2 be the current nodes of the first and second traversals respectively and initially both of them are passed as root. Then the algorithm f...

  • Answered Anonymously
  • Q2. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
  • Ans. Naive Approach

    Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.

    Space Complexity: O(1)Explanation:

    O(1), i.e. constant space complexity. 

    Time Complexity: O(n)Explanation:

    O(N), where N is the length of the array/list. 

     

    We are iterating over the array/list ARR once. Hence, the time complexity is O(N).


    Java (SE 1.8)
    /*
    
    Time Compl...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in NoidaEligibility criteriaNo criteriaAdobe interview preparation:Topics to prepare for the interview - Data Structures, Computer Networks, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Don't lie on your resume.
Tip 2 : Practice at least 400 different types of coding problems.
Tip 3 : Work on your communication skills.

Application resume tips for other job seekers

Tip 1 : Don't put false things on your resume.
Tip 2 : Mention some good projects on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

First, the interviewer asked about college life in the past two years and what all skills I gained. I told all my achievements and all skills that I gained in the period. asked about Language preference

  • Q1. 

    Anagram Pairs Verification Problem

    Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...

  • Q2. 

    Merge K Sorted Arrays Problem Statement

    Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.

    Inpu...

Round 2 - Video Call 

(2 Questions)

Round duration - 100 minutes
Round difficulty - Medium

  • Q1. 

    Greatest Common Divisor Problem Statement

    You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...

  • Q2. 

    Find The Repeating And Missing Number Problem Statement

    You are provided with an array nums which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...

Interview Preparation Tips

Eligibility criteriaAbove 7 GPAOracle interview preparation:Topics to prepare for the interview - Data Structures, DBMS, OS, OOPS, System DesignTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Pratice atleast 300 standard questions
Tip 2 : very good with computer science concepts
Tip 3 : Good projects to discuss

Application resume tips for other job seekers

Tip 1 : one page is enough
Tip 2 : good projects of web developement

Final outcome of the interviewSelected

Skills evaluated in this interview

Shopify Interview FAQs

How many rounds are there in Shopify Software Developer Intern interview?
Shopify interview process usually has 1 rounds. The most common rounds in the Shopify interview process are Technical.

Tell us how to improve this page.

Shopify Software Developer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Software Engineer
7 salaries
unlock blur

₹5.2 L/yr - ₹21 L/yr

Developer
4 salaries
unlock blur

₹17 L/yr - ₹94 L/yr

Software Developer
3 salaries
unlock blur

₹6.6 L/yr - ₹33 L/yr

Telecaller
3 salaries
unlock blur

₹1.2 L/yr - ₹1.8 L/yr

Explore more salaries
Compare Shopify with

Zoho

4.3
Compare

Flipkart

4.0
Compare

Paytm

3.3
Compare

Snapdeal

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