Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Hopscotch Director Interview Questions and Answers

Updated 10 Jun 2024

Hopscotch Director Interview Experiences

1 interview found

Director Interview Questions & Answers

user image Anonymous

posted on 10 Jun 2024

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

I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.

Interview questions from similar companies

I applied via Approached by Company and was interviewed before May 2021. There was 1 interview round.

Interview Preparation Tips

Interview preparation tips for other job seekers - Just be confident, don’t fidget, maintain eye contact.

I applied via Naukri.com and was interviewed in Jul 2021. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Can you take a min to introduce yourself?
  • Q2. What projects (academic or professional) have you done in the past?
  • Q3. Tell me about an instance where you used your problem solving skill
  • Q4. Do you know advanced excel?
  • Ans. 

    Yes, I have advanced Excel skills.

    • I am proficient in using advanced functions such as VLOOKUP, INDEX-MATCH, and PivotTables.

    • I can create complex formulas and macros to automate tasks and improve efficiency.

    • I have experience in data analysis and visualization using Excel.

    • I am familiar with Excel add-ins such as Power Query and Power Pivot.

    • I have used Excel for financial modeling and forecasting.

    • I am comfortable working ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and know your Resume as well as you can. The questions would mostly be based on your CV. Your communication skill and confidence level are the keys.

Skills evaluated in this interview

I applied via Referral and was interviewed in May 2021. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. There were 5 rounds in total. First-round was written. They asked fashion-related questions like sleeve types, prints, grammar correction, and paragraph-writing on one of the related topics. The second rou...
  • Q2. What are contractor benefits at Myntra? Do they get employee discount code?
  • Ans. 

    Contractors at Myntra receive certain benefits, including an employee discount code.

    • Contractors at Myntra receive certain benefits, such as access to the company's employee discount code.

    • The employee discount code allows contractors to purchase Myntra products at a discounted rate.

    • Other benefits for contractors may include flexible work hours and the opportunity to work on exciting projects.

    • However, the specific benefi...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Must have good knowledge in fashion otherwise, you won't be able to crack first round only.
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Interview Preparation Tips

Topics to prepare for LimeRoad Senior Business Analyst interview:
  • SQL
  • Business Analysis
  • Case Studies
Interview preparation tips for other job seekers - Be good with SQL (working knowledge), know your past & current projects in depth, be aware about the general industry trends.

Interview Preparation Tips

Round: Test
Tips: Be perfect on what you know
Duration: 60 minutes

College Name: IIT KHARAGPUR

I appeared for an interview 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

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

Interview Questionnaire 

12 Questions

  • Q1. What is the difference between get and post?
  • Ans. 

    GET is used to retrieve data from a server, while POST is used to send data to a server.

    • GET requests are idempotent, meaning they can be repeated without changing the result

    • POST requests are not idempotent and can have side effects on the server

    • GET requests can be cached by the browser, while POST requests cannot

    • GET requests have limitations on the amount of data that can be sent, while POST requests have no limitation...

  • Answered by AI
  • Q2. What is session in php?
  • Ans. 

    Session in PHP is a way to store and retrieve data for a user across multiple requests.

    • Sessions are used to maintain user-specific data on the server side.

    • A session is created for each user and is identified by a unique session ID.

    • Session data can be stored in server files or in a database.

    • Session variables can be accessed and modified throughout the user's session.

    • Sessions can be used to implement features like user a

  • Answered by AI
  • Q3. Where does session id is stored in php? How server identifies request has come from which client and many other related questions?
  • Ans. 

    Session ID is stored in PHP as a cookie or a query parameter.

    • Session ID can be stored as a cookie in the client's browser.

    • Session ID can also be stored as a query parameter in the URL.

    • The server identifies the client by retrieving the session ID from the cookie or query parameter.

    • The session ID is then used to retrieve the corresponding session data stored on the server.

    • The server can also use other methods like IP add

  • Answered by AI
  • Q4. Cookie in php? Size of the cookie, expiry etc?
  • Ans. 

    A cookie in PHP is a small piece of data stored on the client's computer. It has a size limit and an expiry date.

    • A cookie is used to store information on the client's computer for future use.

    • In PHP, cookies are set using the setcookie() function.

    • The size of a cookie is limited to 4KB.

    • Cookies can have an expiry date, after which they are no longer valid.

    • The expiry date can be set using the 'expires' parameter in the set...

  • Answered by AI
  • Q5. Memcache?
  • Q6. Myisam and Innnodb?
  • Q7. Triggers in mysql?
  • Ans. 

    Triggers in MySQL are database objects that are automatically executed in response to specified events.

    • Triggers are used to enforce business rules, maintain data integrity, and automate tasks.

    • They can be defined to execute before or after an INSERT, UPDATE, or DELETE operation.

    • Triggers can be written in SQL or in a programming language like PL/SQL.

    • Examples of trigger events include inserting a new record, updating a re...

  • Answered by AI
  • Q8. Overriding and Overloading?
  • Q9. Static class and static variable?
  • Q10. Singleton pattern and factory pattern?
  • Q11. Can constructor be declared as private?
  • Ans. 

    Yes, a constructor can be declared as private.

    • Declaring a constructor as private restricts its accessibility to only the class itself.

    • This can be useful in scenarios where you want to control the creation of objects of that class.

    • Private constructors are commonly used in singleton design pattern implementations.

    • Example: private constructor in a singleton class:

    • class Singleton { private Singleton() {} }

  • Answered by AI
  • Q12. Indexing in mysql?
  • Ans. 

    Indexing in MySQL improves the performance of database queries by creating a data structure that allows for faster data retrieval.

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

    • They help in speeding up the search, sorting, and joining of data.

    • Indexes can be created using the CREATE INDEX statement.

    • Common types of indexes include B-tree, hash, and full-text indexes.

    • Indexes should be used judiciously as they consu...

  • Answered by AI

Interview Preparation Tips

Skills: PHP, Algorithm
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

10 Questions

  • Q1. Change Binary tree so that parent node is the sum of root nodes
  • Ans. 

    Change binary tree to make parent node the sum of root nodes

    • Traverse the tree in post-order

    • For each node, update its value to the sum of its children

    • Return the updated root node

  • Answered by AI
  • Q2. Reverse a linkedlist ?
  • Ans. 

    Reverse a linkedlist by changing the direction of pointers.

    • Iterate through the linkedlist and change the direction of pointers.

    • Keep track of previous, current and next nodes.

    • Set the next pointer of current node to previous node.

    • Move to next node and repeat until end of list is reached.

  • Answered by AI
  • Q3. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)
  • Ans. 

    Rearrange an array of positive and negative numbers with positive numbers on the left and negative numbers on the right.

    • Create two empty arrays, one for positive numbers and one for negative numbers

    • Loop through the original array and add positive numbers to the positive array and negative numbers to the negative array

    • Concatenate the positive and negative arrays to create the rearranged array

  • Answered by AI
  • Q4. Singleton pattern, observer pattern?
  • Q5. String pool and how garbage collection functionality works?
  • Ans. 

    String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.

    • String pool is a cache of string literals in memory

    • Strings are immutable and can be shared among multiple objects

    • Garbage collection removes unused objects to free up memory

    • String objects that are no longer referenced are eligible for garbage collection

  • Answered by AI
  • Q6. HashMap , how can you synchronize ?
  • Q7. Process vs Thread differences and synchronization,deadlock examples?
  • Ans. 

    Process vs Thread differences and synchronization, deadlock examples

    • Process is an instance of a program while thread is a subset of a process

    • Processes are independent while threads share the same memory space

    • Synchronization is used to coordinate access to shared resources

    • Deadlock occurs when two or more threads are blocked waiting for each other to release resources

    • Examples of synchronization include mutex, semaphore, ...

  • Answered by AI
  • Q8. Database: Design with one-one mapping, one-many mapping…some basic questions, I don’t remember all
  • Q9. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?
  • Q10. CTO round

Interview Preparation Tips

Round: HR Interview
Experience: This was CTO round, if you make this round…you are doing pretty good. 
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.

General Tips: Process:5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR
I got almost the same package that I am currently getting (Myntra gave stock options, which I don’t have in my current company) but I am looking for a change so accepted the offer.
Skills: Algorithm, data structure, database
College Name: na

Skills evaluated in this interview

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

Hopscotch Interview FAQs

How many rounds are there in Hopscotch Director interview?
Hopscotch interview process usually has 1 rounds. The most common rounds in the Hopscotch interview process are One-on-one Round.

Recently Viewed

DESIGNATION

REVIEWS

Skewb Analytics

No Reviews

SALARIES

Skewb Analytics

COMPANY BENEFITS

YASH Technologies

No Benefits

JOBS

YASH Technologies

No Jobs

INTERVIEWS

Hopscotch

No Interviews

REVIEWS

Procter & Gamble

No Reviews

REVIEWS

Procter & Gamble

No Reviews

INTERVIEWS

YoBoHo New Media

No Interviews

SALARIES

Skewb Analytics

Tell us how to improve this page.

Hopscotch Director Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Myntra Interview Questions
4.0
 • 215 Interviews
FirstCry Interview Questions
3.6
 • 169 Interviews
Nykaa Interview Questions
3.5
 • 114 Interviews
Biba Apparels Interview Questions
3.6
 • 39 Interviews
Indorama Interview Questions
4.0
 • 26 Interviews
Apache Footwear Interview Questions
3.8
 • 13 Interviews
Kazo Fashion Interview Questions
3.2
 • 10 Interviews
JAY JAY MILLS Interview Questions
4.2
 • 10 Interviews
Zivame.com Interview Questions
3.7
 • 9 Interviews
LimeRoad Interview Questions
2.6
 • 9 Interviews
View all
Hopscotch Director Salary
based on 7 salaries
₹39 L/yr - ₹63 L/yr
At par with the average Director Salary in India
View more details

Hopscotch Director Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

3.0

Skill development

4.0

Work-life balance

4.0

Salary

3.0

Job security

4.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Business Analyst
14 salaries
unlock blur

₹8.2 L/yr - ₹17 L/yr

Assistant Buyer
11 salaries
unlock blur

₹3.5 L/yr - ₹6.6 L/yr

Customer Care Executive
10 salaries
unlock blur

₹1.7 L/yr - ₹4 L/yr

Sdet 2
9 salaries
unlock blur

₹13 L/yr - ₹25.9 L/yr

Customer Service Executive
8 salaries
unlock blur

₹2.5 L/yr - ₹4 L/yr

Explore more salaries
Compare Hopscotch with

FirstCry

3.6
Compare

Myntra

4.0
Compare

Nykaa

3.5
Compare

Zivame.com

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