Upload Button Icon Add office photos
Engaged Employer

i

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

DeHaat Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

DeHaat Senior Android Developer Interview Questions and Answers

Updated 24 Feb 2024

DeHaat Senior Android Developer Interview Experiences

1 interview found

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

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

Interview Preparation Tips

Topics to prepare for DeHaat Senior Android Developer interview:
  • Android
  • jetpack
  • compose
Interview preparation tips for other job seekers - Learn all latest component of android

Interview questions from similar companies

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

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

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

I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.

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

I applied via Campus Placement

Interview Preparation Tips

Interview preparation tips for other job seekers - System design knowledge is very important.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I appeared for an interview in Apr 2024.

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

  • Q1. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.

    ...

  • Ans. 

    The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.

    • Iterate through the array and calculate the sum of each subarray of length K

    • Store the maximum sum obtained from the first subarray

    • Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

    • Store the maximum sum obtained from the second subarray

    • Return the sum of the two maximum

  • Answered by AI
  • Q2. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    The task is to find the count of distinct subsequences in a given string.

    • Use dynamic programming to solve the problem.

    • Create a 2D array to store the count of distinct subsequences for each prefix of the string.

    • Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

    • For each character in the string, calculate the count of distinct subsequences by considering two cases: including...

  • Answered by AI
  • Q3. 

    Array Intersection Problem Statement

    Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...

  • Ans. 

    The task is to find the intersection of two integer arrays/lists.

    • Read the number of test cases

    • For each test case, read the size and elements of the first array/list

    • Read the size and elements of the second array/list

    • Find the intersection of the two arrays/lists

    • Print the intersection elements in the order they appear in the first array/list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

  • Q1. 

    Number of Islands Problem Statement

    You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.

    An island is defined as a group of 1s (re...

  • Ans. 

    The task is to find the number of islands in a grid consisting of 0s and 1s.

    • An island is a group of 1s connected horizontally, vertically, or diagonally

    • The grid is surrounded by 0s on all four edges

    • Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

    • Initialize a visited array to keep track of visited cells

    • For each unvisited cell with a value of 1, p...

  • Answered by AI
  • Q2. 

    Arrangement Problem Statement

    Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].

    Input:

    The input start...
  • Ans. 

    The goal is to find the number of permutations of a list satisfying certain conditions.

    • Iterate through all permutations of the list

    • Check if each permutation satisfies the given conditions

    • Count the number of permutations that satisfy the conditions

    • Return the count for each test case

  • Answered by AI
  • Q3. 

    Idempotent Matrix Verification

    Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:

    M * M = M

    Input:

    The first line cont...
  • Ans. 

    An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.

    • Check if the given matrix satisfies the property M*M = M

    • Iterate through each element of the matrix and perform the matrix multiplication

    • Compare the result with the original matrix

    • If they are equal, return true; otherwise, return false

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

  • Q1. Can you design an attendance management system?
  • Ans. 

    Design attendance management system

    • Create a database to store employee information

    • Implement a user interface for employees to mark their attendance

    • Develop a system to track and record attendance data

    • Generate reports and analytics based on attendance data

  • Answered by AI
Round 4 - HR 

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaMeesho interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Dynamic Programming, Low level designTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.

Application resume tips for other job seekers

Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for machine coding rounds.

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

  • Q1. 

    Hurdle Game Problem Statement

    Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).

    Given the total number ...

  • Ans. 

    Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.

    • Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level

    • Return the current level as the number of levels cleared

  • Answered by AI
  • Q2. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q3. 

    Count Ways To Travel Triangular Pyramid

    Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...

  • Ans. 

    Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.

    • Bob can move to any adjacent vertex in a single step

    • Bob must return to vertex 'O' after exactly 'N' steps

    • Calculate the number of different ways Bob can complete the journey

    • Return the result modulo 1000000007

    • Consider the constraints provided

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

  • Q1. 

    Generate Binary Strings with No Consecutive 1s

    Given an integer K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.

    Input:

    The input begins with an integer ...
  • Ans. 

    Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.

    • Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.

    • Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.

    • Sort the generated strings in lexicographically increasing order before outputting them.

  • Answered by AI
  • Q2. 

    Shuffle Two Strings Problem Statement

    You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:

    • T...
  • Ans. 

    Check if a string is formed by interleaving two other strings.

    • Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.

    • Use dynamic programming to efficiently solve the problem.

    • Handle edge cases like empty strings or unequal lengths of A, B, and C.

    • Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

  • Q1. 

    Ninja and Intersection of Lines

    You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...

  • Ans. 

    Find the intersection point of two lines on a 2D plane given their coordinates.

    • Calculate the slopes of both lines using the given coordinates.

    • Use the slope-intercept form of a line to find the equations of the two lines.

    • Solve the equations simultaneously to find the intersection point.

    • Return the coordinates of the intersection point with precision up to 6 decimal places.

  • Answered by AI
  • Q2. 

    Cycle Detection in Directed Graph

    Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.

    Input:

    The first line of input contains...
  • Ans. 

    Detect cycles in a directed graph and return true if a cycle exists, false otherwise.

    • Use Depth First Search (DFS) to detect cycles in the directed graph.

    • Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.

    • If a vertex is visited and is present in the recursion stack, then a cycle exists.

    • Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

  • Q1. How does a URL work and what is a load balancer?
  • Ans. 

    A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.

    • A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.

    • URLs typically consist of a protocol (such as HTTP ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Jalpaiguri Government Engineering College. Eligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - DSA, Networking, Operating Systems, DBMS, Spring JavaTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects

Application resume tips for other job seekers

Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

  • Q1. 

    Lowest Common Ancestor of a Binary Tree III

    The structure of a binary tree has been modified so that each node includes a reference to its parent node.

    Problem Statement

    You are provided with two nodes,...

  • Ans. 

    This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.

    • Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

    • Compare the two lists and find the last common node.

    • Return the last common node as the lowest common ancestor.

  • Answered by AI
  • Q2. 

    Maximum Subarray Problem Statement

    Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.

    A subarray 'A' is considered greater than a...

  • Ans. 

    The problem is to find a subarray with the maximum sum in a given array.

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

    • If the current sum becomes negative, reset it to 0.

    • Update the maximum sum if the current sum is greater.

    • Also keep track of the start and end indices of the subarray with the maximum sum.

    • Return the subarray using the start and end indices.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

  • Q1. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that have a greater element to their right.

    • For each element, pop elements from the stack until a greater element is found or the stack is empty.

    • If a greater element is found, it is the next greater element for the current element.

    • If the stack becomes empty, the...

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right side of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

    • Sum up the amount of water trapped at each bar to get the total amo

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

DeHaat Interview FAQs

How many rounds are there in DeHaat Senior Android Developer interview?
DeHaat interview process usually has 1 rounds. The most common rounds in the DeHaat interview process are Technical.

Recently Viewed

INTERVIEWS

Toothsi

No Interviews

JOBS

Glenmark Pharmaceuticals

No Jobs

JOBS

Indiamart Intermesh

No Jobs

INTERVIEWS

DeHaat

No Interviews

INTERVIEWS

Toothsi

No Interviews

INTERVIEWS

DeHaat

No Interviews

INTERVIEWS

Toothsi

No Interviews

INTERVIEWS

DeHaat

No Interviews

INTERVIEWS

DeHaat

No Interviews

JOBS

ZenHeal Wellness

No Jobs

Tell us how to improve this page.

DeHaat Senior Android Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 425 Interviews
Udaan Interview Questions
4.0
 • 333 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zepto Interview Questions
3.5
 • 207 Interviews
Blinkit Interview Questions
3.7
 • 179 Interviews
BlackBuck Interview Questions
3.8
 • 175 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
Urban Company Interview Questions
3.4
 • 134 Interviews
Ninjacart Interview Questions
4.0
 • 94 Interviews
View all
Assistant Manager
126 salaries
unlock blur

₹2.7 L/yr - ₹10.1 L/yr

Senior Executive
58 salaries
unlock blur

₹3.4 L/yr - ₹6.6 L/yr

Manager
44 salaries
unlock blur

₹7 L/yr - ₹16 L/yr

Sales Executive
40 salaries
unlock blur

₹2.5 L/yr - ₹4.8 L/yr

Executive
31 salaries
unlock blur

₹2.5 L/yr - ₹5.3 L/yr

Explore more salaries
Compare DeHaat with

Ninjacart

4.0
Compare

Crofarm

3.7
Compare

Agrostar

3.8
Compare

BIGHAAT AGRO

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