Upload Button Icon Add office photos
Engaged Employer

i

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

Altimetrik Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Altimetrik Android Developer Interview Questions, Process, and Tips

Updated 31 Jan 2024

Altimetrik Android Developer Interview Experiences

1 interview found

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

I applied via Recruitment Consulltant and was interviewed before Jan 2023. There was 1 interview round.

Round 1 - Technical 

(5 Questions)

  • Q1. Explain MVVM architecture
  • 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: MVVM uses data binding to synchronize the View and ViewModel.

    • Example: In an Android app, the...

  • Answered by AI
  • Q2. Explain Java Basic concept
  • Ans. 

    Java is a high-level programming language known for its simplicity and versatility.

    • Java is an object-oriented language

    • It is platform-independent due to its 'write once, run anywhere' principle

    • Java uses a virtual machine (JVM) to execute code

    • It supports multithreading for concurrent programming

    • Java has automatic memory management through garbage collection

  • Answered by AI
  • Q3. Explain Kotlin modifiers
  • Ans. 

    Kotlin modifiers are keywords used to modify classes, properties, functions, and other elements in Kotlin programming language.

    • Kotlin modifiers include 'public', 'private', 'protected', 'internal', 'open', 'final', 'abstract', 'override', 'lateinit', 'const', 'companion', 'inline', 'data', 'sealed', 'inner', etc.

    • Modifiers like 'public', 'private', 'protected', and 'internal' control the visibility of classes, functions...

  • Answered by AI
  • Q4. Explain RXJava networking library
  • Ans. 

    RXJava is a popular Java library for composing asynchronous and event-based programs using observable sequences.

    • RXJava provides a powerful way to handle asynchronous operations by using observables and subscribers.

    • It simplifies complex asynchronous code by allowing developers to chain operations and handle errors more easily.

    • RXJava is commonly used in Android development for handling network requests and background tas...

  • Answered by AI
  • Q5. Explain Git commit , merge and rebase command
  • Ans. 

    Git commit records changes to the repository, merge combines changes from different branches, and rebase moves changes to a new base commit.

    • Git commit saves changes to the local repository with a message describing the changes made.

    • Git merge combines changes from different branches into the current branch.

    • Git rebase moves changes from one branch to another by applying each commit from the source branch to the target br

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

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

Interview Questionnaire 

1 Question

  • Q1. Exam was conducted on programmes. 10 questions were asked

Interview Questionnaire 

1 Question

  • Q1. Focus mainly on Javascript basics and React or Angular.

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
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
No response

I applied via Approached by Company and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Testing in React
  • Q2. Redux, Async Thunk
Round 2 - Coding Test 

- Test Cases
- Redux

Interview Preparation Tips

Topics to prepare for Brillio Software Developer interview:
  • React
  • Jest
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. About javascript
Round 2 - Technical 

(1 Question)

  • Q1. About project , roles and responsibilities
Round 3 - HR 

(1 Question)

  • Q1. Salary and working things

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

Round 1 - Coding Test 

This are the Java coding questions, be sound in Java 8

Round 2 - Speech Test 

(1 Question)

  • Q1. Speech test is test of English
Round 3 - HR 

(2 Questions)

  • Q1. Why should I hire you?
  • Ans. 

    I have extensive experience and expertise in senior engineering roles.

    • I have a proven track record of successfully leading and managing complex engineering projects.

    • I possess strong technical skills and stay up-to-date with the latest industry trends and advancements.

    • I am a problem-solver and have a knack for finding innovative solutions to challenging engineering problems.

    • I am a team player and excel at collaborating ...

  • Answered by AI
  • Q2. What are your expectations from us?
  • Ans. 

    I expect a challenging and collaborative work environment with opportunities for growth and learning.

    • Opportunities for professional development

    • Collaborative work environment

    • Challenging projects

    • Clear expectations and goals

    • Supportive and inclusive company culture

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well in one of the programming language, in speech round, grammer is must. I HR round, be specific, and clear to the point.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Mar 2023.

Round 1 - Coding Test 

Medium difficulty coding test will be there for experienced

Round 2 - Technical 

(1 Question)

  • Q1. Basics in core java
Round 3 - Technical 

(1 Question)

  • Q1. Advance technical concepts covered
Round 4 - HR 

(1 Question)

  • Q1. Salary negotiations

Altimetrik Interview FAQs

How many rounds are there in Altimetrik Android Developer interview?
Altimetrik interview process usually has 1 rounds. The most common rounds in the Altimetrik interview process are Technical.
How to prepare for Altimetrik Android Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Altimetrik. The most common topics and skills that interviewers at Altimetrik expect are Kotlin, Android, Java, Android Studio and Rest.
What are the top questions asked in Altimetrik Android Developer interview?

Some of the top questions asked at the Altimetrik Android Developer interview -

  1. Explain Git commit , merge and rebase comm...read more
  2. Explain RXJava networking libr...read more
  3. Explain MVVM architect...read more

Tell us how to improve this page.

Altimetrik Android Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

CitiusTech Interview Questions
3.4
 • 270 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
 • 140 Interviews
Brillio Interview Questions
3.4
 • 131 Interviews
Luxoft Interview Questions
3.7
 • 123 Interviews
View all
Altimetrik Android Developer Salary
based on 4 salaries
₹8 L/yr - ₹17.4 L/yr
96% more than the average Android Developer Salary in India
View more details
Senior Software Engineer
1.2k salaries
unlock blur

₹9 L/yr - ₹35 L/yr

Staff Engineer
884 salaries
unlock blur

₹10.9 L/yr - ₹41 L/yr

Senior Engineer
693 salaries
unlock blur

₹9 L/yr - ₹30 L/yr

Software Engineer
313 salaries
unlock blur

₹4.8 L/yr - ₹19 L/yr

Staff Software Engineer
232 salaries
unlock blur

₹10.4 L/yr - ₹34 L/yr

Explore more salaries
Compare Altimetrik with

Accenture

3.8
Compare

Xoriant

4.1
Compare

CitiusTech

3.4
Compare

HTC Global Services

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