Upload Button Icon Add office photos
Engaged Employer

i

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

Customer Analytics Verified Tick

Compare button icon Compare button icon Compare
3.9

based on 91 Reviews

Filter interviews by

Customer Analytics Software Engineer Interview Questions and Answers for Freshers

Updated 20 Apr 2022

Customer Analytics Software Engineer Interview Experiences for Freshers

1 interview found

I applied via Campus Placement and was interviewed before Apr 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 
Round 2 - Technical 

(1 Question)

  • Q1. Related to your skills
Round 3 - HR 

(1 Question)

  • Q1. General HR questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and prepare well .

Interview questions from similar companies

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

I applied via Company Website and was interviewed in Sep 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Focusing on moderate level patterns

Round 2 - Technical 

(4 Questions)

  • Q1. Discuss object oriented principles in depth
  • Ans. 

    Object oriented principles are fundamental concepts in software development that focus on organizing code into objects with properties and behaviors.

    • Encapsulation: Bundling data and methods that operate on the data into a single unit.

    • Inheritance: Allowing a new class to inherit properties and behaviors from an existing class.

    • Polymorphism: The ability for objects of different classes to respond to the same message in di...

  • Answered by AI
  • Q2. Deep discuss of interface
  • Q3. Deep discuss of exception, multithreading
  • Q4. Deep discuss of oop
Round 3 - HR 

(1 Question)

  • Q1. Asked some tricky question related to real life problems

Interview Preparation Tips

Interview preparation tips for other job seekers - All Good 👍🏻
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at National Institute of Technology (NIT), Raipur and was interviewed before Apr 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Coding round consisting DSA portion mainly.

Round 2 - Technical 

(2 Questions)

  • Q1. SQL questions on Joins
  • Q2. Problems given on Hacker rank
Round 3 - One-on-one 

(2 Questions)

  • Q1. Sorting related questions
  • Q2. Tell me about yourself, family background, hobbies

Interview Preparation Tips

Topics to prepare for MAQ Software Software Engineer interview:
  • SQL
  • DSA
  • English
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Normal question on Array & String

Round 2 - Technical 

(1 Question)

  • Q1. Linked list, sql, oop
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
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 - Aptitude Test 

Not so much difficult. english comprehension matters for this test.

Round 3 - Technical 

(2 Questions)

  • Q1. Departmental question asked.
  • Q2. What is C++ and what are the basics
  • Ans. 

    C++ is a high-level programming language used for developing system software, application software, and video games.

    • C++ is an extension of the C programming language

    • It supports object-oriented programming concepts like classes, inheritance, polymorphism, etc.

    • It is a compiled language and provides low-level memory manipulation features

    • C++ is widely used in developing operating systems, device drivers, game engines, and ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - brush up your IT knowledge. also, increase your confidence.

Skills evaluated in this interview

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

I applied via campus placement at SRM Institute of Science and Technology, NCR Campus, Ghaziabad and was interviewed before Oct 2022. There were 5 interview rounds.

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 - Technical 

(1 Question)

  • Q1. Proctored MCQ test
Round 3 - Coding Test 

Technical interview where DSA questions were asked

Round 4 - One-on-one 

(1 Question)

  • Q1. Manegerial round
Round 5 - HR 

(1 Question)

  • Q1. One on one HR round at the end

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

Interview Questionnaire 

11 Questions

  • Q1. Introduce yourself
  • Ans. 

    I am a software engineer with expertise in developing and maintaining software applications.

    • Proficient in programming languages such as Java, C++, and Python

    • Experienced in developing web applications using frameworks like Spring and Django

    • Skilled in database management and SQL queries

    • Familiar with software development methodologies like Agile and Scrum

    • Strong problem-solving and analytical skills

    • Excellent communication

  • Answered by AI
  • Q2. Given a table storing details of student like enrollment number, graduation date, enrollment date, output the recent 10 graduates details
  • Ans. 

    Output details of recent 10 graduates from a table storing student details.

    • Sort the table by graduation date in descending order.

    • Select the top 10 rows from the sorted table.

    • Output the selected rows.

  • Answered by AI
  • Q3. Find the third largest element from array, give the optimized approach using just half traversal of array.
  • Ans. 

    Optimized approach to find third largest element from array using half traversal.

    • Sort the array in descending order and return the element at index 2.

    • Use a max heap to keep track of the top 3 elements while traversing the array.

    • Use two variables to keep track of the second and third largest elements while traversing the array.

    • Divide the array into two halves and find the maximum and second maximum in each half, then co

  • Answered by AI
  • Q4. Print first character of words in a string 1) using one stack and 2)using an array.
  • Ans. 

    Answering how to print first character of words in a string using one stack and an array.

    • For using one stack, push each character onto the stack and pop when a space is encountered. Print the popped character.

    • For using an array, split the string into words and print the first character of each word.

    • In both cases, handle edge cases like empty string and string with only one word.

  • Answered by AI
  • Q5. Which data structure inserts and deletes in O(1) time and is it possible to create a data structure with insertion, deletion and search retrieval in O(1) time
  • Ans. 

    Hash table. No, it is not possible to create a data structure with all operations in O(1) time.

    • Hash table uses a hash function to map keys to indices in an array.

    • Insertion and deletion can be done in O(1) time on average.

    • Search retrieval can also be done in O(1) time on average.

    • However, worst-case scenarios can result in O(n) time complexity.

    • It is not possible to create a data structure with all operations in O(1) time

  • Answered by AI
  • Q6. What are acid properties , how two transactions occur simultaneously while maintaining Acid properties
  • Ans. 

    ACID properties ensure database transactions are reliable. Two transactions can occur simultaneously using locking and isolation.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that a transaction is treated as a single unit of work, either all or none of it is executed.

    • Consistency ensures that a transaction brings the database from one valid state to another.

    • Isolation ensures that co...

  • Answered by AI
  • Q7. What are indexes , example, Is it possible to have more than one clustered index and more than one non clustered index ?
  • Ans. 

    Indexes are used to improve query performance. Multiple clustered and non-clustered indexes can be created on a table.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Clustered index determines the physical order of data in a table.

    • Non-clustered index is a separate structure that contains a copy of the indexed columns and a pointer to the actual data.

    • A table can have only one clustered index, b...

  • Answered by AI
  • Q8. Explain Project done and questions related to project were asked.
  • Q9. Given a array and a number , find whether number can be generated using sum of array members if yes output those numbers
  • Ans. 

    Given an array and a number, find if the number can be generated using sum of array members and output those numbers.

    • Iterate through the array and check if the number can be generated using the sum of array members

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

    • If the difference is found in the hash table, output the corresponding array elements

    • If no such combination is found, output '

  • Answered by AI
  • Q10. Time complexity of various data structure operations
  • Ans. 

    Time complexity of data structure operations

    • Arrays: O(1) for access, O(n) for search/insert/delete

    • Linked Lists: O(n) for access/search, O(1) for insert/delete

    • Stacks/Queues: O(1) for access/insert/delete

    • Hash Tables: O(1) for access/insert/delete (average case)

    • Trees: O(log n) for access/search/insert/delete (balanced)

    • Heaps: O(log n) for access/insert/delete

    • Graphs: Varies depending on algorithm used

  • Answered by AI
  • Q11. Difference between span and div tag
  • Ans. 

    Span and div tags are both HTML elements used for grouping content, but they have different purposes.

    • Span is an inline element used for grouping text or other inline elements.

    • Div is a block-level element used for grouping larger sections of content.

    • Span is often used for styling individual words or phrases within a larger block of text.

    • Div is often used for creating layout structures and separating content into distinc...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Explain your approach , don't be silent make it interactive, reason your answer, prepare acid properties and practice SQL queries for joins and finding sum and average ,referring primary key using foreign keys between two tables, for dsa learn time complexity of data structure and algorithm you explain.

Skills evaluated in this interview

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

Round 1 - Technical 

(2 Questions)

  • Q1. Joins types. Rank functions
  • Q2. SQL related questions. Joins , Rank , functions , Sps
Round 2 - One-on-one 

(2 Questions)

  • Q1. Roles and responsibilities.
  • Q2. Project related questions. Your role and responsibilities .
Round 3 - HR 

(3 Questions)

  • Q1. What are your salary expectations?
  • Q2. Where do you see yourself in 5 years?
  • Q3. What are your strengths and weaknesses?

Interview Preparation Tips

Interview preparation tips for other job seekers - Simple rounds, supportive interviewers.

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Timing: Morning
Environment: Online
Description: This round was conducted immediately after Aptitude Round if you cleared it. 4 Questions in 60 minutes.

  • Q1. MergeSort Linked List

    For a given Singly Linked List of integers, sort the list using the 'Merge Sort' algorithm.

    Input format :
    The first and the only line of input contains the elements of the...
  • Ans. Merge Sort Linked List
    1. The idea is to take a recursive approach by calling the sort function on the left half and right half of the list.
    2. In order to do so, get the middle node and split the list into two halves. We can use a two-pointer technique to get the middle node by running a slow and a fast pointer.
      1. The idea here is to move both the slow and fast pointer simultaneously until fast reaches the end of the list.
      2. Here, ...
  • Answered by CodingNinjas
  • Q2. Rotate array

    Given an array with N elements, the task is to rotate the array to the left by K steps, where K is non-negative.

    Input Format:

    The first line contains an integer N representing the size of ...
  • Ans. Naive Approach
    • We rotate the array K times where in each iteration we rotate the array by 1.
    • Rotating the array once can be done by changing input[i] to input[i+1] and appending the first character to the end.
    Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
  • Answered by CodingNinjas
  • Q3. Permutations of a String

    You are given a string 'STR' consisting of lowercase English letters. Your task is to return all permutations of the given string in lexicographically increasing order.

    S...

  • Ans. Backtracking

    The idea is to fix a character at a position and then find the permutations for rest of the characters.

    Make a list ‘ans’ which will contain the permutations of the given string.

     

    Algorithm:

    Let’s define a function generatePermutaionsHelper(Str, l, r). This function generates the permutations of the substring which starts from index  ‘l’ and ends at index  ‘r’.

    • Call the function: generatePermutai...
  • Answered by CodingNinjas
  • Q4. Factorial

    You are given an integer ‘N’. You have to print the value of Factorial of ‘N’. The Factorial of a number ‘N’ is defined as the product of all numbers from 1 to ‘N’.

    For Example:
    Consider if ‘N...
  • Ans.  Using Linked List

    In this approach, we will calculate the factorial of the given number and store it in the form of a Linked List of digits named digits. To do this, we will define a function multiply(digits,x) that will multiply the number corresponding to the digits with x and update the digits with the product’s value. Then we will initialize the linked list digits with 1 and multiply it with all numbers from 2 to N...

  • Answered by CodingNinjas
Round 2 - Video Call 

(4 Questions)

Round duration - 40 minutes
Round difficulty - Medium

Timing: Morning
Environment: Online

  • Q1. Print Series

    You have given two positive integers N and K. Your task is to print a series of numbers i.e subtract K from N until it becomes 0 or negative then add K until it becomes N. You need to do thi...

  • Ans. Recursion

    The idea here is to use recursion,we can print current N two times in the current recursion stack. One for decreasing order and one for increasing order. 

     

    Steps : 

     

    • Declare an empty array to store our series, say answer.
    • Define and call function series(answer, N, K), where N, and K is the given number.
    • At last return answer.

     

    void series(answer, N, K):

     

    • Add N to answer.
    • Base condition, ...
  • Answered by CodingNinjas
  • Q2. Unique Element In Sorted Array

    Nobita wants to impress Shizuka by guessing her lucky number.

    Shizuka gave Nobita a sorted list of ‘N’ numbers such that every number occurred twice in the list except Shiz...

  • Ans. Brute force

    The idea here is to use the fact that the array is sorted and the element of the array (‘arr[i]’) is unique if it doesn't have an adjacent element that has the same value as ‘arr[i]’. 

     

    Algorithm:

    • If the length of the array equal to 1 then return ‘arr[0]’.
    • Declare a variable ‘answer’ to store Shizuka’s lucky number.
    • Run a loop from i = 0 to the length of the array - 1.
    • If ‘arr[i]’ does not have an adjac...
  • Answered by CodingNinjas
  • Q3. Second largest element in the array

    You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

    Note:
    a) Duplicate elements ...
  • Ans. Simple solution

    The idea is to sort the array in decreasing order and return the second largest element in the array.

    1. Sort the array in decreasing order.
    2. We can create a function to sort the elements using a sorting algorithm such as quicksort or use inbuilt sorting functions.
    3. Traverse from index 1(0-based indexing) because the element at index 0 will clearly be the first largest and check whether duplicates of the larger ...
  • Answered by CodingNinjas
  • Q4. SQL Question

    write-a-query-to-find-the-nth-highest-salary-and-the-employee-name

Round 3 - Video Call 

(2 Questions)

Round duration - 25 minutes
Round difficulty - Easy

Timing: It was in the morning then rescheduled to evening
Environment: Online

  • Q1. Remove String

    You have been given a linked list where each node has a single character. You have also been given a string 'STR'.

    You have to remove all the occurrences of string STR from the link...

  • Ans. Remove String

    Starting from the head of the linked list make recursive calls until you reach the end of a linked list. Store the address of the head of the linked list in a pointer. Now you reach the end of the linked list and while backtracking, try to match the corresponding character of the string with the data stored in the current pointer ‘TEMP’ in linked list char by char. 

     

    If found then simply return th...

  • Answered by CodingNinjas
  • Q2. SQL Question

    Employee table
    ~~~~~~~~~~~~~~~~
    empid, deptid, empname, empsalary

    Department table
    ~~~~~~~~~~~~~~~~~
    deptid, depname

    Output:
    depname, total salary (dep wise) 

    conditions
    ~~~~~~~~~~~~
    such that only ...

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as Software Engineer in HyderabadEligibility criteriaBE/B.Tech / ME/M.Tech, BCA, MCA, B.Sc (2021)MAQ Software interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, Operating Systems, DBMS, Computer NetworkTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : For DS and Algo, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews.

Application resume tips for other job seekers

Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Mar 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 90 minutes
Round difficulty - Medium

A time range is given you can attempt with in that time and once started you cant resume .

  • Q1. Sort String with alternate lower upper.

    Given a string ‘STR’ containing lowercase and uppercase letters. You need to sort the string so that the resulting string contains uppercase and lowercase letters at...

  • Ans. Brute Force Approach
    • We will solve this problem by taking two arrays, ‘upCount’ and ‘lowCount’ of size ‘26’ that will store the count of uppercase and lowercase letters.
    • We will traverse the given string and increment its count corresponding to its value.
    • Now, ‘upCount’ and ‘lowCount’ will store the count of uppercase and lowercase letters in sorted order, but there will be some characters whose count is ‘0’, i.e., the ch...
  • Answered by CodingNinjas
  • Q2. Remove Invalid Parentheses

    You are given a string consisting only of parentheses and letters. Your task is to remove the minimum number of invalid parentheses and return all possible unique, valid strings ...

  • Ans. Breadth First Search

    The idea here is to use the BFS algorithm. Using BFS, we will move through states level by the level that will ensure the removal of the minimal number of parentheses. At each level, we will remove only one parenthesis. So, if we found a valid string, we will restrict ourselves to that level only.

    Please note that the overhead to pass parameters in a recursive call is also avoided because of BFS.

    &nbs...

  • Answered by CodingNinjas
  • Q3. Nth Fibonacci Number

    Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -

        F(n) = F(n-1) + F(n-2), 
        Where, F(1) = F(2) = 1
    

    Provided N you have...

  • Ans. Recursive Approach
    • In this approach, we use recursion and uses a basic condition that :
      • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
      • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
    • In this way, we reached our answer.
    Space Complexity: O(n)Explanation:

    O(N),  where ‘N’ is the given number.  

    As recursion uses a stack of size ‘N’

    Time Complexity: O(2^n)Explanation:

    O(2^N), where ‘N’ i...

  • Answered by CodingNinjas
  • Q4. Find Kth row of Pascal's Triangle

    You are given a non-negative integer 'K'. Your task is to find out the Kth row of Pascal’s Triangle.

    In Mathematics, Pascal's triangle is a triangular array ...

  • Ans. Naive Approach

    In this approach, we find the row elements of the previous row using recursion, and based on the values of previous row elements, we will evaluate the current row elements.

    1. We are given a function kthRow() which takes an integer ‘K’ as the only parameter and returns an integer vector. This is the definition of our recursive function too.
    2. As the base condition of our recursive function, we will check if ‘K’ ...
  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. I applied for the job as Software Engineer in MumbaiEligibility criteriaNo backlogsMAQ Software interview preparation:Topics to prepare for the interview - Core Java , Data Structures , SQL , Algorithms , OopsTime required to prepare for the interview - 15 daysInterview preparation tips for other job seekers

Tip 1 : Basics of java should be clear 
Tip 2 : Do maximum question on strings and array

Application resume tips for other job seekers

Tip 1 : Atleast 1 good project
Tip 2 : Good ranks on websites like hackerrank , leetcode.

Final outcome of the interviewRejected

Skills evaluated in this interview

Customer Analytics Interview FAQs

How many rounds are there in Customer Analytics Software Engineer interview for freshers?
Customer Analytics interview process for freshers usually has 3 rounds. The most common rounds in the Customer Analytics interview process for freshers are Aptitude Test, Technical and HR.

Tell us how to improve this page.

Customer Analytics Software Engineer Salary
based on 54 salaries
₹3.2 L/yr - ₹11 L/yr
At par with the average Software Engineer Salary in India
View more details

Customer Analytics Software Engineer Reviews and Ratings

based on 11 reviews

4.1/5

Rating in categories

3.7

Skill development

4.3

Work-life balance

4.5

Salary

4.6

Job security

4.4

Company culture

4.0

Promotions

4.4

Work satisfaction

Explore 11 Reviews and Ratings
Senior Software Engineer
194 salaries
unlock blur

₹5.5 L/yr - ₹18 L/yr

Software Engineer
54 salaries
unlock blur

₹3.2 L/yr - ₹11 L/yr

Technical Lead
49 salaries
unlock blur

₹10.5 L/yr - ₹19 L/yr

Project Lead
21 salaries
unlock blur

₹12 L/yr - ₹29 L/yr

Lead Developer
19 salaries
unlock blur

₹11.2 L/yr - ₹17 L/yr

Explore more salaries
Compare Customer Analytics with

Fractal Analytics

4.0
Compare

Mu Sigma

2.7
Compare

Tiger Analytics

3.7
Compare

LatentView Analytics

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