Upload Button Icon Add office photos
Premium Employer

i

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

Capco Technologies Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Capco Technologies Senior Android Developer Interview Questions and Answers

Updated 26 Aug 2023

Capco Technologies Senior Android Developer Interview Experiences

1 interview found

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

(1 Question)

  • Q1. Basic Android questions and Kotlin
Round 3 - Technical 

(1 Question)

  • Q1. Architecture like MVVM explain
  • Ans. 

    MVVM is an architectural pattern that separates the UI, business logic, and data layers in an Android app.

    • Model: Represents the data and business logic of the application.

    • View: Represents the UI components of the application.

    • ViewModel: Acts as a mediator between the Model and View, handling communication and logic.

    • Data binding: Allows automatic updates between the ViewModel and View.

    • Example: Using LiveData to observe c

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I applied via Job Portal and was interviewed before Jun 2021. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. PHP and JS Oops concepts
Round 2 - One-on-one 

(1 Question)

  • Q1. Manager Round with technical questions
Round 3 - HR 

(1 Question)

  • Q1. Salary Negotiation, company policies etc...

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for oops concepts, Should have a good knowledge on your technology.

Interview Questionnaire 

1 Question

  • Q1. Interview questions on .net technology

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd 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

I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Core Java Questions on Stream API, Exception handling, Java 8 features and some questions from collections
Round 2 - Technical 

(1 Question)

  • Q1. Small program to write and other questions on Spring, Spring Boot, Hibernate, JPA, jQuery and HTML & CSS.
Round 3 - HR 

(1 Question)

  • Q1. Basic discussion on salary expectations and other general discussion.

Interview Preparation Tips

Interview preparation tips for other job seekers - Good company with great work culture. All leaders are supportive. Always motivate to learn new things.

I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Data structures

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was good.

I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. A detailed explanation on yourself and how you got to know of the company.
  • Q2. Ambitions? Why are you looking to change organisations?

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare yourself well on Collections framework and proper communication skills. You'll crack the interviews. All the best to everyone reading this.

I applied via Naukri.com and was interviewed before Jul 2021. 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 - Technical 

(1 Question)

  • Q1. It was went well they will ask some Basic quesadillas regarding the technologies that you have worked before.
Round 3 - Technical 

(1 Question)

  • Q1. It will be like another round in interview process they will dig your knowledge about technologies a bit more.

Interview Preparation Tips

Interview preparation tips for other job seekers - Please go through projects and technologies once again when you are going to face an interview.

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

Interview Questionnaire 

3 Questions

  • Q1. 1. Write a code to split an array of integers into two subarray where both the array has equal sum.
  • Ans. 

    Code to split an array of integers into two subarrays with equal sum.

    • Iterate through the array and calculate the total sum.

    • Divide the sum by 2 to get the target sum for each subarray.

    • Use dynamic programming to find a subset of the array that adds up to the target sum.

    • Return the two subarrays.

    • Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]

    • Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]

  • Answered by AI
  • Q2. To write code to build up a binary tree from scratch (implement a BST) and then to write all the methods like all the tree traversal algo, and all other stuffs.
  • Ans. 

    Implementing a binary search tree and its traversal methods.

    • Start by defining a Node class with left and right child pointers.

    • Implement insert() method to add nodes to the tree.

    • Implement inorder(), preorder(), and postorder() traversal methods.

    • Implement search() method to find a node in the tree.

    • Implement delete() method to remove a node from the tree.

    • Consider edge cases like empty tree, duplicate nodes, etc.

  • Answered by AI
  • Q3. Other OOPs concept and questions related to DSA and OS.

Interview Preparation Tips

Interview preparation tips for other job seekers - Accolite has a difficult hiring bar and hires only the good ones. Focus on DSA concepts and practice as many questions from Leetcode, Interviewbits, GFG. Focus on all the OOPs concept and subject like OS.

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Java multithreading, oops

Capco Technologies Interview FAQs

How many rounds are there in Capco Technologies Senior Android Developer interview?
Capco Technologies interview process usually has 3 rounds. The most common rounds in the Capco Technologies interview process are Technical and Resume Shortlist.
What are the top questions asked in Capco Technologies Senior Android Developer interview?

Some of the top questions asked at the Capco Technologies Senior Android Developer interview -

  1. Architecture like MVVM expl...read more
  2. Basic Android questions and Kot...read more

Tell us how to improve this page.

Capco Technologies Senior Android Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

CitiusTech Interview Questions
3.4
 • 271 Interviews
Altimetrik Interview Questions
3.8
 • 218 Interviews
Xoriant Interview Questions
4.1
 • 182 Interviews
Globant Interview Questions
3.8
 • 173 Interviews
ThoughtWorks Interview Questions
3.9
 • 147 Interviews
Apexon Interview Questions
3.3
 • 141 Interviews
Brillio Interview Questions
3.4
 • 132 Interviews
View all
Senior Consultant
953 salaries
unlock blur

₹10.1 L/yr - ₹35 L/yr

Consultant
503 salaries
unlock blur

₹6.5 L/yr - ₹27 L/yr

Senior Consultant 2
173 salaries
unlock blur

₹15 L/yr - ₹38 L/yr

Business Analyst
135 salaries
unlock blur

₹5.8 L/yr - ₹23.6 L/yr

Consultant2
128 salaries
unlock blur

₹8 L/yr - ₹25 L/yr

Explore more salaries
Compare Capco Technologies with

Xoriant

4.1
Compare

CitiusTech

3.4
Compare

HTC Global Services

3.6
Compare

HERE Technologies

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