Upload Button Icon Add office photos

Filter interviews by

Sports 365 Sales Intern Interview Questions and Answers

Updated 19 Oct 2021

Sports 365 Sales Intern Interview Experiences

1 interview found

Sales Intern Interview Questions & Answers

user image Anonymous

posted on 19 Oct 2021

I applied via Campus Placement and was interviewed in Apr 2021. There was 1 interview round.

Interview Questionnaire 

4 Questions

  • Q1. Tell me about Yourself
  • Q2. Interests and hobbies
  • Q3. Something adventurous that you have done
  • Q4. Strengths and weakness

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and creative

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 Indian Institute of Technology (IIT), Guwahati and was interviewed in Oct 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

2 coding questions to be solved in 90 min. Medium difficulty

Round 3 - One-on-one 

(1 Question)

  • Q1. 2 rounds of interview 1st round was a coding round. Was asked to write pseudo code on a google shared by the interviewer during the interview Easy to medium difficulty questions
Round 4 - One-on-one 

(1 Question)

  • Q1. More like a Hr interview asked about things on resume, projects worked upon etc.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - HR 

(1 Question)

  • Q1. Basic Questions
Round 2 - Technical 

(1 Question)

  • Q1. Spray dryer , Heat exhangers, Evaporators, Feed type, Pasteurizer
Round 3 - Technical 

(1 Question)

  • Q1. About Projects and Internships

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well for what you have written
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - HR 

(2 Questions)

  • Q1. CV related questions were asked
  • Q2. About the location. About the domains,

Interview Preparation Tips

Interview preparation tips for other job seekers - Go through the CV and the Job role properly. Have the domain knowledge so that it will be easy to crack.

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.

  • Q1. Merge Intervals

    You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.

    The task is to merge all the overlapping interval...

  • Ans. 

    I firstly sorted the intervals based on their second values and then I considered each interval if it overlaps with the previous one or not.
    Time Complexity : O(nlogn)
    Space complexity : O(n)

  • Answered Anonymously
  • Q2. Josephus

    ‘N’ people are standing in a circle numbered from ‘1’ to ‘N’ in clockwise order. First, the person numbered 1 will proceed in a clockwise direction and will skip K-1 persons including itself and w...

  • Ans. 

    Firstly I tried recursively to fix my position to every place and check if I am remaining till Last to survive. But the Interviewer asked me to do better, then I thought of this question as a circular Linked List where in each step length decreases by one. Then I derived Mathematical formula for the position to survive till last with :
    Time Complexity : O(n)
    Space Complexity : O(n)

  • Answered Anonymously
Round 2 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.

  • Q1. Largest rectangle in a histogram

    You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of ...

  • Ans. 

    Firstly I tried brute force considering all possible left and right pointer and checking what all rectangle areas we can get and taking maximumm from them.
    But the interviewer wanted better time complexity than O(n*n)
    So I used two arrays Left and right and kept check of next shorter rectangle index to the present one.
    This had Time Complexity of O(n) and Space Complexity : O(n)
    The interviewer was pleased with this approa

  • Answered Anonymously
  • Q2. Boundary Traversal

    You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in Anti-Clockwise direction starting from the root node.

    NOTE:
    The boundary ...
  • Ans. 

    I made three functions as the order given in Problem statement and did the Traversals in the same way making sure to cover all the edge cases .
    This is similar to Preorder/Postorder/Inorder type problems.
    Time Complexity : O(n)

  • Answered Anonymously
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The face to face round was held on Google Meet where initially interviewer asked a DS/Algo problem. Later the manager joined and asked about our resume projects in detail.
The time was 10:00 AM.

  • Q1.  Maximum Subarray Sum

    Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

    For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since ...

  • Ans. 

    First I tried brute force approach with taking sum between all left top corner and bottom right corners rectangle formed .
    This had time complexity of O(n^4).
    Then I brought down the time complexity to O(n^3) by using Kadane's Algorithm and coded it on Docs Shared.

  • Answered Anonymously
  • Q2. Search In Rotated Sorted Array

    Aahad and Harshit always have fun by solving problems. Harshit took a sorted array and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1, 2,...

  • Ans. 

    Firstly I gave the solution of Linear Search but he asked to implement binary search with all corner cases .
    So I implemented binary search for finding the number of rotations array has went through.

  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACurefit interview preparation:Topics to prepare for the interview - Dynamic Programming, Greedy Techniques, Data Structures, OOPs, DBMS, Graph TheoryTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare OS,DBMS,OOPs too
Tip 2 : Mention at-least one project or past work experience in your resume
Tip 3 : Try maintaining 8+ CGPA as sometimes shortlist is done based on CGPA
Tip 4 : Try past interview questions from Leetcode,Interviewbit.

Application resume tips for other job seekers

Tip 1 : Try to Keep Resume 1 Pager
Tip 2 : Have atleast one project or past work experience mentioned
Tip 3 : Don't put false things on Resume as questions are asked in detail from Resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was early in the morning from 8 am. It was a test from home itself. It was a conducted on HackerEarth and was of 60 minutes duration. 30 students were shortlisted. I was also shortlisted.

  • Q1. Word Break

    You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.

    Note :
    You can use any string of A mult...
  • Ans. Brute Force

    In this solution, we will try to generate all prefixes and If we want a prefix present in the string then we will recur for the remaining string. 

    Steps:

    1. Store all strings of A on the hash map.
    2. Declare and call function wordBreakHelper which will take a single argument string.

    wordBreakHelper(s):

    1. Base case if the length of the string is 0 then return true.
    2. Run a loop from i = 1 to the length of the string:
      • If ...
  • Answered Anonymously
  • Q2. Break The Board

    You’re given a board of length 'L' and width 'W'. Your task is to break this board into 'L' * 'W' smaller squares, such that the total cost involved in break...

  • Ans. Greedy Approach

    This problem can be solved using the greedy approach. By greedy, we mean that we simply start cutting the board along every horizontal and vertical line. But this cutting needs to be in a specific manner. Let’s see how we can do this.

     

    • Start by making an integer variable minCost and initialize it to 0.
    • Now we talked about cutting the board in a specific manner. This specific manner will involve minim...
  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Hard

This round was scheduled around 12 pm. It was a virtual round with one interviewer who was a Cure.Fit employee. My resume was scanned and a brief introduction was asked. After that a question was put up which I had to find solution to and code it. In the end, I asked questions regarding the type of projects they work on etc. I was selected for the next round

  • Q1. Balanced Sequence After Replacement

    You are given a string of length ‘N’ containing only the following characters: ‘[’, ‘{’, ‘(’, ‘)’, ‘}’, ‘]’. At some places, there is ‘X’ in place of any bracket. Your t...

  • Ans. Using Recursion

    The idea is to use stack data structure and is pretty much similar to the algorithm where we check if the expression is balanced or not. 

     

    We mainly have 3 conditions to fulfil i.e. 

    1. Opening bracket.
    2. Closing bracket.
    3. Character ‘X’.
       

    Algorithm:

    • Initialise a stack, say s.
    • We traverse the whole string such as,
    1. If all the elements of the string are traversed, return true if the stack is empty. Ot...
  • Answered Anonymously
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

As soon as the HR round got over. I was asked to sit for my next round. It was again a problem solving round along with Data Structure questions in the end. The interviewer was an employee of Cure.Fit and after a brief introduction, I was given a question. After solving it, I was asked questions on Hashmaps, their implementation, time complexities. Finally, I was selected :)

  • Q1. Pair with Given Sum in a Balanced BST

    You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target,’ you have to tell if there exists any pair of nodes such that the sum of their value ...

  • Ans. Checking For Every Node

    The idea is to fix one node and try to find, if there exists, a node whose sum along with the fixed node is equal to the given ‘target’.

     

    The steps are as follows:

    • We will use a helper function ‘findTargetPairHelper’ to fix each node.
    • ‘findTargetPairHelper’ takes ‘mainRoot,’ ‘curRoot’ and ‘target’ as input parameters, ‘mainRoot’ is the root of the given tree, ‘curRoot’ is the node we are fixing...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteria8 CGPA and students from CSE, IT onlyCurefit interview preparation:Topics to prepare for the interview - Recursion, Dynamic Programming, Trees, Data Structure, Algorithms, Graphs, Binary Search, OOPS, DBMSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Do competitive programming and maintain a decent rating across platforms. This will make you comfortable with the coding rounds and thinking under pressure and in a time-bounded manner.
Tip 2 : Practice some company wise questions, especially of Google, Facebook, Amazon, Microsoft from Leetcode 1-2 months before the placement/internship season to get yourself accustomed to good interview type questions. 
Tip 3 : Practice Dynamic Programming using a top-down approach as this not only improves DP but also improves recursion thinking. Recursion in turn help you to solve questions on Trees, graphs, and backtracking.
Tip 4 : Have at least 2 good projects on your resume which is solving some real-life problems. I won't recommend making just clones, rather add more functionalities. Web Development projects are good to start with. 
Tip 5 : Study the core subjects for internships in the following priority manner: OOPS>>OS>=DBMS. Some colleges may have System Design as well. That can be studied in the same manner like OS.
Tip 6 : Get yourself a good mentor to guide yourself.

Application resume tips for other job seekers

Tip 1 : Keep your resume simple and formal. 
Tip 2 : Having a past internship opportunity is a plus.
Tip 3 : Have good projects and mention them only if you know the depth of it.
Tip 4 : List your achievements chronologically and focus on participating in various competitions and getting recognition.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Had to solve 2 easy coding problems. Could be solved in 25 minutes if you are well prepared with DS-Algo.

  • Q1.  Job Scheduling Problem

    You are given a list of ‘N’ jobs which has to be performed. Each job is associated with a deadline and a profit if the job is completed before the deadline. Each job takes one unit ...

  • Ans. 

    I used maxheap to keep track of max element  [(frequency, taskname),...] and queue to keep track of used elements [(time last used, (frequency, taskname)),...] I used t as current time. I removed max from heap, added max to result , updated the timestamp and pushed to queue each time Then I checked from queue if I could use it based on timestamp, if yes I pushed to heap and repeated above step again

  • Answered Anonymously
  • Q2. Water flow

    You are given a matrix 'A' having ‘N’ rows and ‘M’ columns. Each cell of the matrix represents the height of water placed in that cell. Water can flow only in four directions ( up, down,...

  • Ans. 

    Hint: DFS on matrix
    I had solved this problem before. Didn't require much thinking on the spot. Always prepare company archives.

  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Questions on Computer science subjects like OS, DBMS, OOP

  • Q1. Operating System

    Questions on types of memories

  • Ans. 

    Tip 1 : Do not use bookish language
    Tip 2 : Use examples
    Tip 3 : Be to the point

  • Answered Anonymously
Round 3 - Video Call 

Round duration - 40 minutes
Round difficulty - Easy

General Discussion on Resume, some in depth questions on a project of interviewer's choice.

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Delhi Technological University. I applied for the job as SDE - Intern in BangaloreEligibility criteria8.5 CGPACurefit interview preparation:Topics to prepare for the interview - Operating System, DBMS, Data Structures and Algorithms, OOPs, Computer NetworksTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Never leave any topic from any chapter or subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : At least have 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : At least have 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

Cult.fit Interview Questions
3.7
 • 68 Interviews
Vestige Interview Questions
4.3
 • 33 Interviews
Fitelo Interview Questions
3.6
 • 33 Interviews
Nutricia Interview Questions
3.6
 • 18 Interviews
Mosaic Wellness Interview Questions
3.9
 • 15 Interviews
Gold's Gym Interview Questions
4.0
 • 14 Interviews
View all
Assistant Manager Operations
3 salaries
unlock blur

₹2.7 L/yr - ₹2.7 L/yr

Branch Manager
3 salaries
unlock blur

₹9 L/yr - ₹14 L/yr

Manager Sales & Operations
3 salaries
unlock blur

₹5 L/yr - ₹7.5 L/yr

Senior Category Manager
3 salaries
unlock blur

₹7.5 L/yr - ₹11 L/yr

Explore more salaries
Compare Sports 365 with

Cult.fit

3.7
Compare

Forever Living Products

4.3
Compare

Amway India Enterprises

4.1
Compare

Vestige

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