Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Amazon Team. If you also belong to the team, you can get access from here

Amazon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Amazon Counsellor Interview Questions and Answers

Updated 26 Sep 2022

Amazon Counsellor Interview Experiences

1 interview found

Counsellor Interview Questions & Answers

user image Anonymous

posted on 26 Sep 2022

I applied via Company Website and was interviewed in Aug 2022. There were 3 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 - Assignment 

General knowledge and system gripe and working knowledge

Round 3 - Aptitude Test 

Specking test and next behavior test

Interview Preparation Tips

Interview preparation tips for other job seekers - I'm respecting to ur COMPANY plz give me on job I will properly get my job done

Interview questions from similar companies

I applied via Naukri.com and was interviewed before Nov 2021. There were 2 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 - One-on-one 

(3 Questions)

  • Q1. Tell me about yourself
  • Q2. Why you want to job here
  • Q3. And how you manage ur studies and work

Interview Preparation Tips

Interview preparation tips for other job seekers - If you go here for a interview so please remember that you should have good comunication skill
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

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

Round 1 - Assignment 

Based on aptitude and retail

Round 2 - Group Discussion 

Group of 12 people.. in which there is filtration after 3 minute

Round 3 - HR 

(2 Questions)

  • Q1. Introduction, why should we hire your, your salary expectation
  • Q2. Salary expectation

Interview Preparation Tips

Topics to prepare for Reliance Retail Consultant interview:
  • Communication
Interview preparation tips for other job seekers - Be confident

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

Round 1 - Coding Test 

Basic hackerrank or leetcode kind of test to verify basic coding skills.

Round 2 - Technical 

(2 Questions)

  • Q1. String related question Testing related question. Normal interview process. Took 2 hours with intermediate breaks.
  • Q2. Looking forward for your attitude and answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Be well prepare for coding knowledge.
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Indeed and was interviewed before Mar 2023. There were 2 interview rounds.

Round 1 - HR 

(1 Question)

  • Q1. 1. Hr asks to the candidate about the introduction part, qualifucations, Experience 2.Reason of joining Flipkart and knowing about Flipkart E- commerce business 3. customer services Questions
Round 2 - Aptitude Test 

Apitude test is also simple and anyone can easily clear the Apitute test also

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

It was quit hard and had codes

Round 2 - Technical 

(2 Questions)

  • Q1. Was easy though ,scenario based questions were asked
  • Q2. How would you manage this if this ahppens and so on
Round 3 - HR 

(1 Question)

  • Q1. Gave me lot of hopes but did not get selected after hr

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.

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

Amazon Interview FAQs

How many rounds are there in Amazon Counsellor interview?
Amazon interview process usually has 3 rounds. The most common rounds in the Amazon interview process are Resume Shortlist, Assignment and Aptitude Test.

Tell us how to improve this page.

Interview Questions from Similar Companies

Reliance Retail Interview Questions
3.9
 • 1.6k Interviews
Flipkart Interview Questions
3.9
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 752 Interviews
Tata Group Interview Questions
4.2
 • 359 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Blinkit Interview Questions
3.7
 • 183 Interviews
AmbitionBox Interview Questions
4.9
 • 151 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
JioMart Interview Questions
3.9
 • 94 Interviews
View all

Amazon Counsellor Reviews and Ratings

based on 5 reviews

4.7/5

Rating in categories

4.9

Skill development

4.9

Work-life balance

4.7

Salary

4.7

Job security

4.9

Company culture

4.9

Promotions

4.9

Work satisfaction

Explore 5 Reviews and Ratings
Customer Service Associate
4.2k salaries
unlock blur

₹0.6 L/yr - ₹6.8 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹2.4 L/yr - ₹6.3 L/yr

Associate
2.9k salaries
unlock blur

₹0.8 L/yr - ₹7 L/yr

Senior Associate
2.2k salaries
unlock blur

₹2 L/yr - ₹10.1 L/yr

Program Manager
2.1k salaries
unlock blur

₹9 L/yr - ₹36 L/yr

Explore more salaries
Compare Amazon with

Flipkart

3.9
Compare

TCS

3.7
Compare

Google

4.4
Compare

Netflix

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