Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Shine Quality Analyst Interview Questions and Answers

Updated 24 May 2024

Shine Quality Analyst Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Not Selected

I applied via AmbitionBox and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Patttens Programs and the Core based Programs

Round 2 - HR 

(1 Question)

  • Q1. About the technically strong checking

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Sep 2022. There were 3 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - For INFO EDGE, I would only suggest the candidates not to hope much as the recruiters are not professional enough and keep you well communicated about the entire interview process. The position they are hiring for goes on hold and they do not even bother to inform this to the candidate. Also for me the 2nd instance was the interview was cleared and the recruiter quoted with such a low package that was unacceptable. I did not find INFO EDGE a company worth to work with. They had wasted a lot of my time and effort with no outcome.

I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 2 interview rounds.

Interview Preparation Tips

Topics to prepare for LinkedIn Consultant interview:
  • Java
  • MS Office
  • Ms World
  • Javascript
Interview preparation tips for other job seekers - Please ask computer base questions because I am bsc student
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before May 2022. There were 4 interview rounds.

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

I appeared for an interview before Nov 2023.

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep the hope and give your best
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. You are given a large array of n bits. Each bit is initially 0. You perform several operations of the type
  • Ans. 

    Solution to performing operations on a large array of bits.

    • Use bitwise operators to perform operations on individual bits

    • Use a loop to iterate through the array and perform the operations

    • Ensure that the array is large enough to accommodate all the bits

    • Consider using a data structure like a bitset for efficient bit manipulation

  • Answered by AI
  • Q2. Questions on Network programming
  • Q3. Questions on array,heap and binary trees
  • Q4. Round was both HR+Technical

Interview Preparation Tips

Round: Test
Experience: Questions can be found here:

-----/
Tips: Try to solve all 3.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: First discuss the solution and then paper-code it.
Tips: Try to code without mistakes.

Round: Technical Interview
Experience: First, I was asked to discuss my project based on networking and then I was given a question on network programming
Tips: Pay attention on discussion

Round: Technical Interview
Experience: Provide the optimised solution and code it without any mistakes.

Round: HR Interview
Experience: Why linkedin?
What changes will you make in 6 months?
Internship project: Discussion and lot of common questions on that.
Basic Questions of C++ and Java

Skills: Data Structure, Core courses understanding, Algorithms
College Name: IIT GUWHATI

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array in place.

    • Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

    • Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

    • Continue this process until all elements from ARR2 are merged into ARR1.

  • Answered by AI
  • Q2. 

    Word Distance Calculation

    Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...

  • Ans. 

    Find the smallest distance between two words in a document for multiple queries.

    • Iterate through the document array to find the indices of the two words in each query.

    • Calculate the absolute difference between the indices to get the distance.

    • If a word from the query is not present in the document, return the length of the document array.

    • Repeat the process for each query and output the smallest distance for each.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    The problem requires implementing a function to return the level order traversal of a binary tree.

    • Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

    • Use a queue data structure to perform level order traversal.

    • Process each level of the tree one by one, starting from the root node.

    • Print the node values at each level in the order they appear from left to ...

  • Answered by AI
  • Q2. 

    Combination Sum Problem Statement

    Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...

  • Ans. 

    Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.

    • Use backtracking to generate all possible combinations.

    • Sort the array to ensure elements are in non-decreasing order.

    • Track the current combination and sum while backtracking.

    • Terminate recursion when the sum equals the target sum.

    • Avoid duplicates by skipping elements that have been used in previou

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 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 Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo 10^9+7 to avoid overflow in calculations.

  • Answered by AI
  • Q2. 

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

    The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.

    • Start by understanding the rules of the game and how players take turns to choose coins.

    • Consider the scenario where both players play optimally to maximize winnings.

    • Iterate through different strategies to determine the best approach for selecting coins.

    • Keep track of the total winnings accumulated by eac...

  • Answered by AI
  • Q3. 

    Generate All Parentheses Combinations

    Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered w...

  • Ans. 

    Generate all possible valid parentheses configurations using N pairs.

    • Use backtracking to generate all possible combinations of parentheses.

    • Keep track of the number of open and close parentheses used.

    • Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.

    • Base case: when the length of the generated string is 2*N, add it to the result array.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn 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 interviewRejected

Skills evaluated in this interview

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

Shine Interview FAQs

How many rounds are there in Shine Quality Analyst interview?
Shine interview process usually has 2 rounds. The most common rounds in the Shine interview process are Coding Test and HR.

Recently Viewed

JOBS

Havas Worldwide

No Jobs

SALARIES

Eurofins Advinus

SALARIES

TCG Lifesciences

DESIGNATION

DESIGNATION

DESIGNATION

SALARIES

Cognito Breyn

JOBS

Browse jobs

Discover jobs you love

DESIGNATION

JOBS

SkyPoint Cloud

No Jobs

Tell us how to improve this page.

Shine Quality Analyst Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Info Edge Interview Questions
3.9
 • 317 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
Quikr Interview Questions
3.7
 • 31 Interviews
Indeed Interview Questions
4.0
 • 28 Interviews
Foundit Interview Questions
3.5
 • 26 Interviews
BlackBerry Interview Questions
3.9
 • 11 Interviews
Synaptics Interview Questions
3.8
 • 10 Interviews
Glassdoor Interview Questions
3.7
 • 8 Interviews
View all
Sales Executive
38 salaries
unlock blur

₹1.8 L/yr - ₹3.8 L/yr

Accounts Manager
22 salaries
unlock blur

₹6 L/yr - ₹8.5 L/yr

Assistant Manager
8 salaries
unlock blur

₹5 L/yr - ₹7.5 L/yr

Product Manager
8 salaries
unlock blur

₹16 L/yr - ₹22 L/yr

Business Development Executive
7 salaries
unlock blur

₹2.4 L/yr - ₹3.6 L/yr

Explore more salaries
Compare Shine with

Naukri

4.0
Compare

Info Edge

3.9
Compare

Quikr

3.7
Compare

Times Business Solutions

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