Upload Button Icon Add office photos

Filter interviews by

StockX Interview Questions and Answers

Updated 18 Sep 2024

StockX Interview Experiences

Popular Designations

3 interviews found

Data Engineer Interview Questions & Answers

user image Anonymous

posted on 18 Sep 2024

Interview experience
4
Good
Difficulty level
Easy
Process Duration
-
Result
-

I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. Delta Lake, SCD2, ADF, Data Modelling, OLAP & OLTP
  • Q2. Lazy evaluation, Repartition & Partition by
  • Q3. SQL Joins - inner, outer, left & right

Interview Preparation Tips

Interview preparation tips for other job seekers - Generic questions, but prepare well

Data Engineer Interview Questions asked at other Companies

Q1. Optimal Strategy for a Coin Game You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line. Here are the rules of the game: 1. Each coin has a value associated with it. 2. The game involves two players... read more
View answer (1)
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Find Kth largest element
  • Ans. 

    Use sorting or heap data structure to find the Kth largest element in an array.

    • Sort the array in descending order and return the element at index K-1.

    • Use a max heap to store the elements and pop K-1 elements to get the Kth largest element.

  • Answered by AI

Skills evaluated in this interview

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Data Structure / Algo Leetcode medium

Round 2 - One-on-one 

(1 Question)

  • Q1. System Design question about designing a ecommerce
Round 3 - HR 

(1 Question)

  • Q1. Regualar HR questions about prvious jobs, work history

Interview Preparation Tips

Topics to prepare for StockX Senior Software Engineer interview:
  • caching
  • System Design
  • Data Structures
  • Algorithms

Senior Software Engineer Interview Questions asked at other Companies

Q1. K Largest Elements Problem Statement You are given an integer k and an array of integers that contain numbers in random order. Write a program to find the k largest numbers from the given array. You need to save them in an array and return ... read more
View answer (1)

Interview questions from similar companies

Interview Questionnaire 

19 Questions

  • Q1. How was your day?-Tell me about yourself
  • Ans. 

    My day was productive and fulfilling. As for myself, I am a driven and detail-oriented individual with a passion for problem-solving.

    • I tackled several challenging tasks at work and made significant progress on each of them.

    • I also took some time to exercise and clear my mind, which helped me stay focused throughout the day.

    • As for myself, I have a background in engineering and enjoy using my analytical skills to find cre...

  • Answered by AI
  • Q2. How to optimize the code that you had written in aptitude test - It was a discussion, he helped me in solving the problem
  • Ans. 

    Optimizing code involves identifying and removing bottlenecks to improve performance.

    • Identify the parts of the code that are taking the most time to execute

    • Use efficient algorithms and data structures

    • Minimize the number of function calls and loops

    • Avoid unnecessary calculations or operations

    • Use caching or memoization to avoid repeating calculations

    • Profile the code to measure performance improvements

  • Answered by AI
  • Q3. Now write an optimized version of that code
  • Ans. 

    Optimized version of given code

    • Use efficient data structures and algorithms

    • Avoid unnecessary loops and conditions

    • Minimize function calls and variable assignments

  • Answered by AI
  • Q4. How was your day?-Tell me about yourself?
  • Ans. 

    My day was productive and fulfilling. As for myself, I am a driven and detail-oriented individual with a passion for problem-solving.

    • I tackled several challenging tasks at work and made significant progress on each of them.

    • I also took some time to exercise and clear my mind, which helped me stay focused throughout the day.

    • As for myself, I have a background in engineering and enjoy applying my analytical skills to a var...

  • Answered by AI
  • Q5. Which language do you prefer to code in? "Have you read The C Programming Language book by Dennis Retchie?" Which technical book have you read recently?.-So you like C, have you ever thought of bringing up...
  • Ans. 

    Yes, I prefer coding in C and have read The C Programming Language book. I have also explored the concept of Inheritance in C.

    • I find C to be a powerful and efficient language for system programming.

    • Yes, I have read The C Programming Language book by Dennis Retchie and found it to be a great resource.

    • Recently, I have been exploring the concept of Inheritance in C through various online resources and tutorials.

    • While C do...

  • Answered by AI
  • Q6. What is the reason behind inventing the concept of inheritance? Write a program and explain
  • Ans. 

    Inheritance allows a class to inherit properties and methods from another class.

    • Inheritance promotes code reusability and saves time and effort in programming.

    • It allows for the creation of a hierarchy of classes with shared characteristics.

    • For example, a class Animal can be inherited by classes such as Dog, Cat, and Bird, which share common properties and methods.

    • Inheritance can be implemented using the 'extends' keywo

  • Answered by AI
  • Q7. What is Liskov substitution principle?
  • Ans. 

    Liskov substitution principle is a principle in object-oriented programming that states that objects of a superclass should be able to be replaced with objects of its subclasses without affecting the correctness of the program.

    • Subtypes must be substitutable for their base types

    • Derived classes must not change the behavior of the base class

    • Violating the principle can lead to unexpected behavior and errors

    • Example: A squar...

  • Answered by AI
  • Q8. Explain OOPs concepts with a program for each
  • Ans. 

    Explanation of OOPs concepts with programs

    • Encapsulation: Wrapping data and functions into a single unit. Example: Class in Java

    • Abstraction: Hiding implementation details and showing only necessary information. Example: Abstract class in C#

    • Inheritance: Acquiring properties and behavior of a parent class. Example: Child class extending parent class in Python

    • Polymorphism: Ability of an object to take many forms. Example:

  • Answered by AI
  • Q9. Write a code for dynamic polymorphism
  • Ans. 

    Dynamic polymorphism is achieved through virtual functions and inheritance in object-oriented programming.

    • Create a base class with virtual functions

    • Create derived classes that override the virtual functions

    • Use pointers or references of the base class to call the virtual functions

    • The appropriate derived class function will be called based on the object being pointed to or referred to

  • Answered by AI
  • Q10. What is the drawback of global variables?
  • Ans. 

    Global variables can lead to unexpected changes and make debugging difficult.

    • Global variables can be accessed and modified from any part of the code, making it difficult to track changes.

    • They can cause naming conflicts if multiple variables with the same name are used in different parts of the code.

    • Using global variables can make it harder to test and debug code, as it can be difficult to isolate the cause of errors.

    • Th...

  • Answered by AI
  • Q11. Why using 'goto' is a bad programming practice?
  • Ans. 

    Using 'goto' can make code hard to read, maintain and debug.

    • Goto statements can create spaghetti code that is difficult to follow.

    • It can make it harder to understand the flow of the program.

    • It can also make debugging more difficult.

    • There are usually better alternatives to using goto, such as using loops or functions.

    • Some programming languages, such as Java and Python, do not even have a goto statement.

    • Using goto can al...

  • Answered by AI
  • Q12. Which is your favourite subject? Why? Name a book for that subject
  • Ans. 

    My favorite subject is history because it helps me understand the present and learn from the past.

    • I enjoy learning about different cultures and how they have evolved over time

    • I find it fascinating to study the causes and effects of major historical events

    • One of my favorite books on history is 'Guns, Germs, and Steel' by Jared Diamond

  • Answered by AI
  • Q13. Bring modularity in the code that you had written in aptitude test
  • Q14. Told me to make changes as per his wishes in that code-What is DRY in software engineering?
  • Q15. Gave a puzzle (find the heaviest ball amongst 8 balls in an optimized way). Tell the logic and write code for it.-write Create, Update, Delete, Insert, Select, Join SQL queries for a given problem
  • Q16. Asked me one sentence questions about the technologies that I had mentioned in resume... What is..... HTML, CSS, JQuery, JSP?
  • Q17. What are implicit objects in JSP?
  • Ans. 

    Implicit objects are pre-defined objects in JSP that can be accessed without being explicitly declared.

    • Implicit objects are created by the JSP container during the translation phase.

    • They can be accessed using predefined names such as request, response, session, application, out, pageContext, config, and exception.

    • For example, the request object can be used to retrieve parameters from a form or URL.

    • The session object ca...

  • Answered by AI
  • Q18. Name a web server and an application server
  • Ans. 

    Apache is a popular web server and Tomcat is a widely used application server.

    • Apache is an open-source web server that supports multiple operating systems and is known for its stability and security.

    • Tomcat is a Java-based application server that is used to deploy Java web applications and supports servlets and JSPs.

    • Other popular web servers include Nginx and Microsoft IIS.

    • Other popular application servers include JBoss...

  • Answered by AI
  • Q19. How to deploy web application on apache tomcat?-What is Collections in Java?
  • Ans. 

    To deploy a web application on Apache Tomcat, the application needs to be packaged as a WAR file and then deployed to the Tomcat server.

    • Create a WAR file of the web application

    • Copy the WAR file to the Tomcat webapps directory

    • Start the Tomcat server

    • Access the web application using the URL http://localhost:8080/

    • Collections in Java are classes that implement collections of objects, such as lists, sets, and

  • Answered by AI

Interview Preparation Tips

College Name: IIT MADRAS

Skills evaluated in this interview

I applied via Referral

Interview Questionnaire 

13 Questions

  • Q1. I was asked to derive the time complexity of my code from the written test. It was to print the elements of a binary tree in spiral order
  • Q2. Program to swap two pointers
  • Ans. 

    A program to swap two pointers.

    • Declare two pointers of the same data type

    • Assign the first pointer to a temporary variable

    • Assign the second pointer to the first pointer

    • Assign the temporary variable to the second pointer

  • Answered by AI
  • Q3. Program to determine whether a given binary tree is binary search tree. I was asked to solve this in two different ways
  • Q4. Two DBMS queries involving aggregate functions
  • Q5. Program to implement Dijkstra’s algorithm
  • Ans. 

    Dijkstra's algorithm finds shortest path between nodes in a graph

    • Create a graph with nodes and edges

    • Initialize distances from source node to all other nodes as infinity

    • Set distance from source node to itself as 0

    • Create a set of unvisited nodes

    • While unvisited set is not empty, select node with minimum distance

    • For each neighbor of selected node, calculate distance from source node

    • If calculated distance is less than curre...

  • Answered by AI
  • Q6. Program to implement Floyd­Warshall’s agorithm
  • Ans. 

    Floyd-Warshall's algorithm is used to find the shortest path between all pairs of vertices in a weighted graph.

    • Create a 2D array to store the distances between all pairs of vertices.

    • Initialize the array with the weights of the edges in the graph.

    • Use nested loops to iterate over all pairs of vertices and update the distances if a shorter path is found through a third vertex.

    • The final array will contain the shortest dist

  • Answered by AI
  • Q7. Program to print the elements of a matrix in spiral order recursively
  • Ans. 

    Program to print matrix elements in spiral order recursively

    • Create a recursive function to print the elements in spiral order

    • Define the boundaries of the matrix and traverse the matrix in spiral order

    • Call the recursive function to print the elements in spiral order

    • Handle edge cases such as empty matrix or matrix with only one row/column

  • Answered by AI
  • Q8. Given an unsorted array of numbers, find two numbers which add up to the given sum in O(n)
  • Ans. 

    Find two numbers in an unsorted array that add up to a given sum in O(n)

    • Use a hash table to store the difference between the sum and each element in the array

    • Iterate through the array and check if the current element is in the hash table

    • If it is, return the current element and the corresponding difference

    • If not, add the current element to the hash table

  • Answered by AI
  • Q9. Explain indexing in DBMS
  • Ans. 

    Indexing is a technique used in DBMS to improve the performance of queries.

    • Indexing creates a separate data structure that allows faster retrieval of data.

    • It works by creating a pointer to the location of data in the table.

    • Indexes can be created on one or more columns of a table.

    • Types of indexing include B-tree, hash, and bitmap indexing.

    • Indexes can also be clustered or non-clustered.

    • Clustered indexes determine the phy...

  • Answered by AI
  • Q10. Explain B and B+ trees
  • Ans. 

    B and B+ trees are data structures used for efficient searching and sorting of large datasets.

    • B trees are balanced trees used for disk-based storage systems.

    • B+ trees are similar to B trees but have all data stored in the leaf nodes for faster searching.

    • B trees have a variable number of keys per node, while B+ trees have a fixed number.

    • B trees have a higher fanout than B+ trees, making them more efficient for smaller da...

  • Answered by AI
  • Q11. Given a binary tree, write a program to determine whether there exists a root to leaf path having the given sum
  • Q12. Program to find the lowest common ancestor of two nodes in binary search tree as well as binary tree. I was also asked to give the brute force approach for the same
  • Ans. 

    Program to find lowest common ancestor of two nodes in binary search tree and binary tree with brute force approach.

    • For binary search tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.

    • For binary tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.

    • Brute force approach involves checking each node's descendants to see if they contain both nodes.

    • ...

  • Answered by AI
  • Q13. Program to print all ancestors of a node in a binary tree
  • Ans. 

    Program to print all ancestors of a node in a binary tree

    • Create a recursive function to traverse the binary tree

    • Check if the current node is the target node

    • If yes, print all the nodes in the call stack

    • If not, recursively call the function for left and right subtrees

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

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 was interviewed before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

The Entire Test is held in HackerRank Platform. It has: 
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts

  • Q1. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Ans. 

    Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

    • Perform Inorder Traversal of the Binary Tree to get the nodes in order.

    • Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.

    • Return the head of the Doubly Linked List as the output.

  • Answered by AI
  • Q2. 

    Unique Element in Array

    Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

  • Ans. 

    Find the unique element in an array where every other element appears thrice.

    • Use XOR operation to find the unique element.

    • Iterate through the array and XOR each element to find the unique one.

    • Return the unique element as the answer.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it. 
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

  • 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. 

    Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Parse the input level-order tree elements to construct the binary tree.

    • Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.

    • Return the traversals as lists of lists for each test case.

  • Answered by AI
  • Q2. 

    Delete N Nodes After M Nodes in a Linked List

    Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...

  • Ans. 

    Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.

    • Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.

    • Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.

    • Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.

    • Repeat this process until the end of the lin...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked to put everything on the blackboard and write down the code of each and everything.

Question : Explain all the search algorithm you know with space and Time complexities. 
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1). 
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half. 
Steps : 
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. 
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.

  • 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. 

    Program to find the number with maximum frequency in an array of integers.

    • Create a dictionary to store the frequency of each number in the array.

    • Iterate through the array and update the frequency count in the dictionary.

    • Find the number with the maximum frequency in the dictionary and return it.

    • If multiple elements have the same maximum frequency, return the one with the lowest index.

  • Answered by AI

Interview Preparation Tips

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

Software Developer Interview Questions & Answers

Myntra user image Thommandru Vishnu

posted on 10 Mar 2015

Interview Questionnaire 

9 Questions

  • Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
  • Ans. 

    Print only the leaf nodes of a doubly linked tree.

    • Traverse the tree and check if a node has no children and both left and right pointers are null.

    • If yes, then it is a leaf node and print it.

    • If no, then continue traversing the tree.

    • Use recursion to traverse the tree in a depth-first manner.

  • Answered by AI
  • Q2. LRU page Replacement Algorithm for large data
  • Ans. 

    LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

    • LRU stands for Least Recently Used

    • It is a cache eviction algorithm

    • It is used to manage memory in operating systems

    • It works by keeping track of the pages that are used recently and the ones that are not

    • When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time

  • Answered by AI
  • Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
  • Ans. 

    Reverse m nodes and leave n nodes in a linked list till the end.

    • Traverse the linked list till m nodes and reverse them

    • Traverse n nodes and continue reversing m nodes

    • Repeat the above step till the end of the linked list

    • Handle edge cases like m or n being greater than the length of the linked list

  • Answered by AI
  • Q4. Inorder Traversal of a tree
  • Ans. 

    Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

    • Start at the root node

    • Traverse the left subtree recursively

    • Visit the root node

    • Traverse the right subtree recursively

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Inorder Travesal of a tree without recursion(write the code)
  • Ans. 

    Inorder traversal of a tree without recursion

    • Create an empty stack and initialize current node as root

    • Push the current node to stack and set current = current.left until current is NULL

    • If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right

    • Repeat step 2 and 3 until stack is empty

  • Answered by AI
  • Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
  • Ans. 

    Find the triplicate number in an array of duplicates.

    • Iterate through the array and keep track of the frequency of each number.

    • Return the number that appears three times.

    • If no number appears three times, return null.

  • Answered by AI
  • Q7. Explain all the serach algorithm you know with space and Time complexities
  • Ans. 

    Explanation of search algorithms with their space and time complexities.

    • Linear Search - O(n) time complexity, O(1) space complexity

    • Binary Search - O(log n) time complexity, O(1) space complexity

    • Jump Search - O(√n) time complexity, O(1) space complexity

    • Interpolation Search - O(log log n) time complexity, O(1) space complexity

    • Exponential Search - O(log n) time complexity, O(1) space complexity

    • Fibonacci Search - O(log n)

  • Answered by AI
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
  • Ans. 

    Find the most repeated number in an array of length n with numbers 1-n.

    • Create a dictionary to store the count of each number in the array

    • Iterate through the array and update the count in the dictionary

    • Find the key with the highest count in the dictionary

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist

Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7

Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules

Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)

General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence between two strings.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through the strings and build a matrix to store the lengths of common subsequences.

    • Return the length of the longest common subsequence found.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum, updating the value and carry as needed

    • Handle cases where one linked list is longer than the other by adding remaining digits with carry

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Use a queue to keep track of nodes to visit next in BFS traversal

    • Start traversal from vertex 0 and explore its neighbors first

    • Continue exploring neighbors level by level until all nodes are visited

    • Ensure to print connected nodes in numerical sort order

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal to find connected components in an undirected and disconnected graph.

    • Perform DFS traversal on each vertex to find connected components

    • Maintain a visited array to keep track of visited vertices

    • Print the vertices of each connected component in ascending order

  • Answered by AI
  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : 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

StockX Interview FAQs

How many rounds are there in StockX interview?
StockX interview process usually has 1-2 rounds. The most common rounds in the StockX interview process are Technical, Coding Test and One-on-one Round.
How to prepare for StockX interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at StockX. The most common topics and skills that interviewers at StockX expect are AWS, Accessories, Microsoft Power BI, Consumer Goods and Github.
What are the top questions asked in StockX interview?

Some of the top questions asked at the StockX interview -

  1. Find Kth largest elem...read more
  2. System Design question about designing a ecomme...read more
  3. Delta Lake, SCD2, ADF, Data Modelling, OLAP & O...read more

Tell us how to improve this page.

StockX Interview Process

based on 3 interviews

Interview experience

3.7
  
Good
View more

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 424 Interviews
Myntra Interview Questions
4.0
 • 213 Interviews
Snapdeal Interview Questions
3.8
 • 75 Interviews
Tata CLiQ Interview Questions
3.4
 • 15 Interviews
Shopclues Interview Questions
3.9
 • 9 Interviews
Paytm Mall Interview Questions
3.6
 • 7 Interviews
Alibaba Group Interview Questions
4.1
 • 7 Interviews
Infibeam Interview Questions
3.1
 • 4 Interviews
Shopify Interview Questions
4.0
 • 3 Interviews
View all

StockX Reviews and Ratings

based on 7 reviews

2.9/5

Rating in categories

2.1

Skill development

3.8

Work-life balance

3.6

Salary

2.1

Job security

2.9

Company culture

2.4

Promotions

2.4

Work satisfaction

Explore 7 Reviews and Ratings
Senior Software Engineer
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Business Analyst
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Lead
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Engineer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare StockX with

Flipkart

4.0
Compare

Snapdeal

3.8
Compare

Myntra

4.0
Compare

Shopclues

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