Upload Button Icon Add office photos
Engaged Employer

i

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

Programming.Com Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Programming.Com Android Developer Interview Questions and Answers

Updated 5 Dec 2024

Programming.Com Android Developer Interview Experiences

1 interview found

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

I applied via Job Portal

Round 1 - Coding Test 

Some Coding Question of kotlin

Android Developer Jobs at Programming.Com

View all

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Runtime pollymorphism

Interview Preparation Tips

Round: Test
Experience: I scored good.
Tips: Core java good knowledge.
Duration: 30 minutes
Total Questions: 25

Round: Technical Interview
Experience: like this many ques from core java and hibernate and sql also and I scored good.
Tips: Command over core java and sql also.

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 Naukri.com and was interviewed before Nov 2019. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Servlet life cycle, bubble sort, quick sort, binary search, how can a software ensure GDPR rules being followed, SQL queries (second highest salary)

Interview Preparation Tips

Interview preparation tips for other job seekers - you will need to give a psychometric test, some beginner sometimes mediocre level programming test and final technical interview which may last till an hour. Do read about 1 or 2 Newgen products before going for the interview. They will definitely ask. Just be confident.Offer letter generally comes within 2 weeks. All the best !!

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

It was very good

  • Q1. 

    Find the Longest Palindromic Substring

    Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.

    If there are multiple longest palin...

  • Ans. 

    Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.

    • Use dynamic programming to check if substrings are palindromes

    • Iterate through the string and expand around each character to find palindromic substrings

    • Keep track of the longest palindromic substring found

  • Answered by AI
  • Q2. 

    Minimum Sum in Matrix Problem Statement

    You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...

  • Ans. 

    Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.

    • Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.

    • Keep track of the minimum sum achieved so far.

    • Avoid selecting elements directly beneath previously selected elements.

    • Example: For input [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal selectio

  • Answered by AI
Round 2 - Face to Face 

Round duration - 1 hour
Round difficulty - Medium

It was a good interview

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Techno India NJR Institute of Technology. I applied for the job as SDE - 1 in IndoreEligibility criteria7 cgpaTata Consultancy Services (TCS) interview preparation:Topics to prepare for the interview - I have done a rigourous training on Data Structure and Algorithms. It really helped me a lot to excel in life. Also I did vocational courses which enhanced my personality. I did analytical mindset training with problem solving methodologies. The hands on training on Python and Unix helped me a lot.Time required to prepare for the interview - 1 yearInterview preparation tips for other job seekers

Tip 1 : Daily practice programming
Tip 2 : Work with honesty
Tip 3 : Do with utmost dedication

Application resume tips for other job seekers

Tip 1 : Write with honesty
Tip 2 : Mention about your achievements

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Technical questions and more scenario based questions. Performance related questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - It was a quick process which took just 6 days to complete the interviews and to get offer.

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

I was asked 2 coding questions, questions from my projects and questions related to different java concepts. One question from cloud computing was also asked.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in a given array.

    • Iterate through the array and keep track of the current sum and maximum sum seen so far.

    • If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.

    • Return the maximum sum as the result.

    • Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.

  • Answered by AI
  • Q2. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry

    • Create a new linked list to store the sum

    • Handle cases where one list is longer than the other

    • Consider edge cases like carry at the end of addition

  • Answered by AI
Round 2 - HR 

Round duration - 15 minutes
Round difficulty - Easy

It was a normal discussion about the role, the job expectations and about the company culture.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in DelhiEligibility criteriaAbove 8 CGPANewgen Software interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, System Design, OOPS, Dynamic Programming, AptitudeTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Do at-least 200+ dsa problems from various topics.
Tip 2 : Make 2-3 projects and be well versed with their functionality.
Tip 3 : Practice aptitude questions and time yourself while doing the questions.

Application resume tips for other job seekers

Tip 1: Keep your resume short, try to make it one pager only.
Tip 2: Mention only position specific projects, and if you have got a good academic score mention it on top.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. They asked the multiple questions regarding to my profile likr about the project , skills, domain and about your future expectations.

Interview Preparation Tips

Interview preparation tips for other job seekers - Just focus to the fundamentals and be confident.
Stick with your resume

I applied via Naukri.com and was interviewed in Nov 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basics on java

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong on the basics on which you are working or learned and the profile they have offered. Be brave and don't be get scared by seeing the interviewer and the way he asking questions.

I applied via Referral and was interviewed before Jun 2021. There were 4 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. General Java, springboot and oops
Round 2 - Technical 

(1 Question)

  • Q1. Managerial round with Technical Lld and design related questions
Round 3 - One-on-one 

(1 Question)

  • Q1. Client round technical LLD AND HLD questions
Round 4 - HR 

(1 Question)

  • Q1. HR discussion about salary and client details

Interview Preparation Tips

Topics to prepare for Altimetrik Senior Engineer interview:
  • Java 8
  • Spring Boot
  • Hibernate
  • React.Js
  • Oracle
  • MySQL
  • Kafka
  • JPA
  • JDBC
  • Rx java
Interview preparation tips for other job seekers - Keep your answer clean and simple, If the interviewer asks you to brief the answers then do it otherwise don't

Programming.Com Interview FAQs

How many rounds are there in Programming.Com Android Developer interview?
Programming.Com interview process usually has 1 rounds. The most common rounds in the Programming.Com interview process are Coding Test.
How to prepare for Programming.Com 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 Programming.Com. The most common topics and skills that interviewers at Programming.Com expect are Android, Java, Kotlin, Design Patterns and JSON.

Tell us how to improve this page.

Programming.Com Android Developer Interview Process

based on 2 interviews

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

TCS iON Interview Questions
3.9
 • 368 Interviews
ITC Infotech Interview Questions
3.6
 • 336 Interviews
CitiusTech Interview Questions
3.4
 • 270 Interviews
NeoSOFT Interview Questions
3.6
 • 263 Interviews
Tiger Analytics Interview Questions
3.7
 • 225 Interviews
Episource Interview Questions
3.9
 • 220 Interviews
Altimetrik Interview Questions
3.8
 • 217 Interviews
View all
Android Developer

New Delhi

1-4 Yrs

Not Disclosed

Explore more jobs
Software Developer
26 salaries
unlock blur

₹10 L/yr - ₹14.7 L/yr

Senior Software Developer
14 salaries
unlock blur

₹10 L/yr - ₹20 L/yr

Quality Analyst
8 salaries
unlock blur

₹4.9 L/yr - ₹14 L/yr

Software Engineer
7 salaries
unlock blur

₹11 L/yr - ₹16 L/yr

Senior Software Engineer
6 salaries
unlock blur

₹13 L/yr - ₹16.5 L/yr

Explore more salaries
Compare Programming.Com with

ITC Infotech

3.6
Compare

CMS IT Services

3.1
Compare

KocharTech

3.9
Compare

3i Infotech

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