Upload Button Icon Add office photos
Engaged Employer

i

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

Vishal Mega Mart Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Vishal Mega Mart Senior Android Developer Interview Questions and Answers

Be the first one to contribute and help others!

Interview questions from similar companies

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.

  • Q1. 

    House Robber Problem Statement

    Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...

  • Ans. 

    House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.

    • Use dynamic programming to keep track of maximum stolen money at each house.

    • Consider two cases: either rob the current house and skip the next, or skip the current house.

    • Handle circular arrangement by considering the first and last houses separately.

    • Example: For arr[] = {2, 3, 2}, the output is 3. Rob...

  • Answered by AI
  • Q2. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

    • Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

    • Optimize the solution to avoid redundant calculations by storing intermediate results.

    • Time complexity can be reduced to O(N) using dynamic programming.

    • Example: For N = 5, the 5th F

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .

  • Q1. 

    Intersection of Linked Lists Problem Statement

    You are provided with two linked lists, L1 and L2, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...

  • Ans. 

    Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.

    • Traverse both linked lists simultaneously to find common elements

    • Create a new linked list to store the intersecting elements

    • Ensure the final linked list is sorted in ascending order

    • Handle cases where there are no common elements between the lists

  • Answered by AI
  • Q2. 

    Kth Largest Element Problem Statement

    Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.

    Input:

    The first line contains an integer 'T...
  • Ans. 

    Find the Kth largest element in a given list of numbers.

    • Sort the array in descending order.

    • Return the Kth element from the sorted array.

    • Handle multiple test cases efficiently.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .

  • Q1. 

    Data Structure with Insert, Delete, and GetRandom Operations

    Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...

  • Ans. 

    Design a data structure with insert, delete, search, and getRandom operations, all in constant time.

    • Use a combination of HashMap and ArrayList to achieve constant time operations.

    • For insert operation, add the element to the ArrayList and store its index in the HashMap.

    • For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Implement a doubly linked list to maintain the order of keys based on their recent usage.

    • Use a hashmap to store key-value pairs for quick access.

    • When capacity is reached, evict the least recently used item before inserting a new item.

    • Update the position of a key in the linked list whenever it is accesse

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

This round was inclined towards some Low Level Design Principles and some concepts from Java .

  • Q1. Design a Railway Reservation System.
  • Ans. 

    Design a Railway Reservation System

    • Create a database to store train schedules, seat availability, and passenger information

    • Implement a user interface for users to search for trains, book tickets, and view their reservations

    • Include features like seat selection, payment processing, and ticket confirmation

    • Handle scenarios like waitlisting, cancellations, and refunds

    • Ensure data security and privacy of passenger information

  • Answered by AI
  • Q2. Why is Java considered platform-independent while the Java Virtual Machine (JVM) is platform-dependent?
  • Ans. 

    Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.

    • Java code is compiled into bytecode, which can run on any platform with a JVM.

    • JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.

    • The JVM ...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAWalmart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 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 appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

  • Q1. 

    Minimum Cost to Buy Oranges Problem Statement

    You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...

  • Ans. 

    Find the minimum cost to buy a specific weight of oranges using given cost list.

    • Iterate through the cost list and find the minimum cost to achieve the desired weight

    • Keep track of the minimum cost while considering available packet weights

    • Return -1 if it is not possible to buy exactly W kg of oranges

  • Answered by AI
  • Q2. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    Find all paths in a binary tree where the sum of node values equals a given value 'K'.

    • Traverse the binary tree using DFS and keep track of the current path and its sum.

    • At each node, check if the current sum equals 'K' and add the path to the result if true.

    • Continue traversal to the left and right child nodes recursively.

    • Return the list of paths that sum up to 'K'.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .

  • Q1. You have two wires of different lengths that take different times to burn. How can you measure a specific amount of time using these two wires?
  • Ans. 

    Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.

    • Burn both wires at the same time, one wire will burn faster than the other.

    • Measure the time it takes for the faster burning wire to completely burn.

    • Calculate the specific amount of time by using the ratio of the lengths of the two wires.

  • Answered by AI
  • Q2. You have 3 ants located at the corners of a triangle. The challenge is to determine the movement pattern of the ants if they all start moving towards each other. What will be the outcome?
Round 3 - HR 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

  • Q1. What do you know about the company?
  • Q2. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAWalmart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Puzzles, OOPSTime required to prepare for the interview - 3 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 appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were of easy to medium level I would say with some lenghty implementations .

  • Q1. 

    Minimum Numbers Required Problem Statement

    Given an array 'ARR' consisting of N integers, along with two integers, 'SUM' and 'MAXVAL', you need to determine the minimum number of integers to be added to t...

  • Ans. 

    Determine the minimum number of integers to be added to an array to make its sum equal to a given value.

    • Iterate through the array and calculate the current sum.

    • Determine the difference between the target sum and the current sum.

    • Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.

  • Answered by AI
  • Q2. 

    Maximum Sum Subsequence Problem Statement

    Given an array of integers NUMS consisting of N integers and an integer K, determine the maximum sum of an increasing subsequence with exactly K elements.

    Exampl...

  • Ans. 

    Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.

    • Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.

    • For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.

    • Update the dynamic programming table with the maximum sum found...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.

  • Q1. 

    Check Whether Binary Tree Is Complete

    You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.

    A Complete Binary Tree is defined as a binary tree where ever...

  • Ans. 

    Check if a binary tree is a Complete Binary Tree or not based on given criteria.

    • Traverse the binary tree level by level and check if all levels are completely filled except the last one.

    • Ensure all nodes at the last level are positioned at the leftmost side.

    • Use level order traversal to check for completeness of the binary tree.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.

  • Answered by AI
  • Q2. 

    Consecutive Elements

    Given an array arr of N non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.

    Input:

    The first line of inp...
  • Ans. 

    Check if an array of integers consists of consecutive numbers.

    • Iterate through the array and check if the absolute difference between consecutive elements is 1.

    • Sort the array and check if the elements are consecutive.

    • Use a set to store the elements and check if the size of the set is equal to the length of the array.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.

  • Q1. How can you print numbers from 1 to 100 using more than two threads in an optimized approach?
  • Ans. 

    Use multiple threads to print numbers from 1 to 100 in an optimized approach.

    • Divide the range of numbers (1-100) among the threads to avoid duplication.

    • Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.

    • Consider using a shared data structure like a queue to coordinate the threads.

    • Implement a mechanism to signal the threads when to start and stop printing.

  • Answered by AI
  • Q2. What are the advantages of using views in a database management system?
  • Ans. 

    Views in a database management system provide data security, simplify complex queries, and improve performance.

    • Enhanced security by restricting access to certain columns or rows

    • Simplify complex queries by pre-defining joins and filters

    • Reduce redundancy by storing commonly used queries as views

    • Improve performance by storing pre-processed data in views

    • Allow for data abstraction, making it easier to work with complex data

  • Answered by AI
Round 4 - HR 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

  • Q1. What do you know about the company?
  • Q2. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAWalmart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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 appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
1.) 25 MCQs (Both Easy and Gate Level Based) 
2.) 1 Coding Question, that needs to be solved in O(logn) time. Program for Fibonacci numbers. The basic idea behind that question is we need to crack the pattern and then based on constraints we need to solve it.

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Given an integer 'N', the task is to compute the N'th Fibonacci number using matrix exponentiation. Implement and return the Fibonacci value for the provided 'N'.

    N...
  • Ans. 

    Use matrix exponentiation to efficiently compute the Nth Fibonacci number modulo 10^9 + 7.

    • Implement matrix exponentiation to calculate Fibonacci numbers efficiently.

    • Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.

    • Return the result modulo 10^9 + 7 to handle large Fibonacci numbers.

    • Optimize the solution to achieve better than O(N) time complexity.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

It was a technical round. The platform was Zoom time duration was 40 mins. Started with Tell me something about yourself.
 

  • Q1. 

    Similar Strings Problem Statement

    Determine whether two given strings, A and B, both of length N, are similar by returning a 1 if they are, otherwise return a 0.

    Explanation:

    String A is similar to stri...

  • Ans. 

    Determine if two strings are similar based on given conditions.

    • Check if the strings are equal first.

    • Then check if the strings can be divided into two halves with similar patterns.

    • Return 1 if the strings are similar, 0 otherwise.

  • Answered by AI
Round 3 - Video Call 

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom time duration was 1 hour 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms, so she was like let’s start with trees then.

 

Round 4 - Video Call 

Round duration - 30 minutes
Round difficulty - Medium

This was a Hiring Manager Round. The platform was Zoom time duration was 30 mins. Started with Tell me something about yourself.


 

Round 5 - HR 

Round duration - 20 minutes
Round difficulty - Easy

The platform was Zoom time duration was 20 mins. Asked me to give my introduction.

 

Interview Preparation Tips

Eligibility criteriaNo criteriaWalmart interview preparation:Topics to prepare for the interview - Data Structures, Aptitude, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Don't stick to a single topic too much. Cover all and prepare short notes for all the topics so it will be easier for revision. 
Tip 2 : Do projects so that they will be an added weightage.
Tip 3 : Practice a minimum of 100 questions on that particular topic so that it will be easy to crack within no time.

Application resume tips for other job seekers

Tip 1 : Projects add good weight to the resume. So the interviewer asks the questions based on that.
Tip 2 : Resume should be genuine. You have to be confident of whatever is written in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were a bit lengthy but the implementation part was quite easy .

  • Q1. 

    Encode the Message Problem Statement

    Given a text message, your task is to return the Run-length Encoding of the given message.

    Run-length encoding is a fast and simple method of encoding strings, repres...

  • Ans. 

    Implement a function to encode a text message using run-length encoding.

    • Iterate through the message and count consecutive characters

    • Append the character and its count to the encoded message

    • Handle edge cases like single characters or empty message

  • Answered by AI
  • Q2. 

    Make All Elements of the Array Distinct

    Given an array/list ARR of integers with size 'N', your task is to determine the minimum number of increments needed to make all elements of the array distinct. You...

  • Ans. 

    Find the minimum number of increments needed to make all elements of the array distinct by increasing any element by 1 in each operation.

    • Iterate through the array and keep track of the frequency of each element.

    • For each element with frequency greater than 1, increment it until it becomes distinct.

    • Return the total number of operations needed to make all elements distinct.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed the
approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was related to OS and was a bit theoretical .

  • Q1. 

    Distinct Characters Problem Statement

    Given a string STR, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.

    Example:

    Input:
    STR = ...
  • Ans. 

    Return all possible non-empty subsequences with distinct characters from a given string.

    • Use a recursive approach to generate all possible subsequences with distinct characters.

    • Keep track of the characters used in each subsequence to ensure uniqueness.

    • Return the generated subsequences as an array of strings.

  • Answered by AI
  • Q2. 

    Calculate Score of Balanced Parentheses

    In this intellectual game, Ninja is provided with a string of balanced parentheses called STR. The aim is to calculate the score based on specific game rules. If Nin...

  • Ans. 

    Calculate the score of a string of balanced parentheses based on specific game rules.

    • Iterate through the string and keep track of the score based on the rules provided

    • Use a stack to keep track of the scores of valid parentheses expressions

    • For each '()', increment the score by 1; for '(x)', double the score of x

    • Return the final computed score for the string

  • Answered by AI
  • Q3. Can you explain demand paging?
  • Ans. 

    Demand paging is a memory management technique where pages are loaded into memory only when they are needed.

    • Pages are loaded into memory on demand, rather than all at once.

    • Helps in reducing the amount of physical memory needed.

    • Improves overall system performance by allowing more processes to run simultaneously.

    • Commonly used in modern operating systems like Linux and Windows.

    • Example: When a program is executed, only the...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 40 Minutes
Round difficulty - Medium

I was given 2 preety good questions of DSA in this round . One was related to Binary Trees and the other was a good DP problem in which I struggled a bit but with some hints I was able to solve this problem too . The last question was related to OOPS and was preety easy .

  • Q1. 

    Binary Tree Construction from Traversals Problem

    Given the POSTORDER and PREORDER traversals of a binary tree, where the tree consists of N nodes with each node representing a distinct positive integer fr...

  • Ans. 

    Construct a binary tree from given POSTORDER and PREORDER traversals.

    • Use the first element in PREORDER as the root node

    • Find the root node in POSTORDER to divide the tree into left and right subtrees

    • Recursively construct left and right subtrees using the divided traversals

  • Answered by AI
  • Q2. 

    Minimum Cost to Buy Oranges Problem Statement

    You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...

  • Ans. 

    Find the minimum cost to buy a specific weight of oranges given the cost of different weight packets.

    • Iterate through the list of costs and find the minimum cost to achieve the desired weight.

    • Keep track of the minimum cost for each weight up to the desired weight.

    • Handle cases where a specific weight packet is unavailable by setting the cost to infinity.

    • Return the minimum cost for the desired weight, or -1 if it is not p

  • Answered by AI
  • Q3. Can you explain the concepts of static and dynamic polymorphism in Object-Oriented Programming?
  • Ans. 

    Static polymorphism is achieved at compile time through method overloading and overriding. Dynamic polymorphism is achieved at runtime through method overriding.

    • Static polymorphism is also known as compile-time polymorphism.

    • Dynamic polymorphism is also known as runtime polymorphism.

    • Static polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

    • Dynamic poly...

  • Answered by AI
Round 4 - HR 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

  • Q1. Why should we hire you?
  • Q2. What do you know about the company?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAWalmart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 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 experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Fair and was interviewed in Aug 2023. There were 2 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 

(37 Questions)

  • Q1. What is your name?
  • Q2. My is gurasala bhoomika
  • Q3. What is your hobbies?
  • Q4. Watching TV, listing music
  • Q5. Explain finally year study?
  • Q6. I have studying audisankara institute of technology in guduru
  • Q7. Explain about intermediate ?
  • Ans. 

    Intermediate refers to a level of proficiency or knowledge that falls between beginner and advanced.

    • Intermediate level typically involves a deeper understanding of concepts and the ability to apply them in practical scenarios.

    • Individuals at an intermediate level may have some experience in the field but still have room for growth and learning.

    • Examples of intermediate skills include proficiency in a programming language...

  • Answered by AI
  • Q8. I have completed my intermediate in Narayanganj junior college in tirupati
  • Q9. Explain about ur SCC ?
  • Ans. 

    SCC stands for Source Code Control. It is a system used to manage and track changes to source code files.

    • SCC helps developers collaborate on code by providing version control and tracking changes.

    • Popular SCC tools include Git, SVN, and Mercurial.

    • SCC allows developers to revert to previous versions of code, track changes made by team members, and merge code changes seamlessly.

    • SCC helps in maintaining code integrity and ...

  • Answered by AI
  • Q10. I have studied in nice English medium school In VarAdaiahpalem
  • Q11. What is your favourite colour ?
  • Q12. Who is your favourite teacher?
  • Q13. My favourite teacher is prasanna sir
  • Q14. What is your short term goal?
  • Q15. I want become a software developer
  • Q16. What is achievement?
  • Q17. I have got prices in 8 th
  • Q18. Which topic do you get?
  • Q19. Story telling topic
  • Q20. What is ur strength ?
  • Ans. 

    My strength lies in my problem-solving skills and ability to learn quickly.

    • Strong problem-solving skills

    • Quick learner

    • Adaptability to new technologies

    • Ability to work well under pressure

  • Answered by AI
  • Q21. My knowledge is my power Communication skills Smart work
  • Q22. What can support you?
  • Ans. 

    Support from my team, access to resources, clear communication

    • Support from my team helps me stay motivated and overcome challenges

    • Access to resources such as training materials and tools enables me to perform my job effectively

    • Clear communication ensures that I understand project requirements and expectations

  • Answered by AI
  • Q23. My teachers,my brother
  • Q24. What is popular temple in ur village?
  • Ans. 

    The popular temple in my village is the Sri Ranganathaswamy Temple.

    • Located in the heart of the village

    • Dedicated to Lord Ranganatha

    • Annual festivals and rituals attract devotees from neighboring villages

  • Answered by AI
  • Q25. The popular temple is god shiva
  • Q26. How many languages do know?
  • Ans. 

    I am proficient in 5 programming languages including Java, Python, C++, JavaScript, and SQL.

    • Java

    • Python

    • C++

    • JavaScript

    • SQL

  • Answered by AI
  • Q27. I know Telugu, hindi
  • Q28. What is the best in you?
  • Q29. I can do smart work
  • Q30. Why want hire you?
  • Q31. I can communicate with people well manner
  • Q32. What is the best memory in frist year?
  • Q33. My birthday can do well
  • Q34. What much salary expectations?
  • Q35. I expections 4000
  • Q36. What can do frist salary?
  • Q37. I enjoy my self.i go to my parents

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected
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 - Coding Test 

2 qns. Dp and backtracking. Problems were medium level.

Round 3 - One-on-one 

(1 Question)

  • Q1. Sql, big data, one coding question , os concepts.
Round 4 - HR 

(1 Question)

  • Q1. How will u see you after 5 years. Why walmart. Is sql better or firebase better.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in May 2024. There were 3 interview rounds.

Round 1 - Coding Test 

DSA sliding window problems , Hashmaps etc

Round 2 - Technical 

(1 Question)

  • Q1. Coding round Questions on Coroutines and MVVM
Round 3 - Technical 

(1 Question)

  • Q1. System Design based on android applications
  • Ans. 

    System design for android applications involves planning the architecture, components, and interactions of the app.

    • Identify the key features and functionalities of the app

    • Design the user interface and user experience (UI/UX)

    • Choose the appropriate architecture pattern (e.g. MVC, MVP, MVVM)

    • Consider scalability, performance, and security

    • Implement data storage solutions (e.g. SQLite, Room, Firebase)

    • Integrate with external ...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Questions will be mostly on Data structures and Algorithms

Round 2 - System Design 

(1 Question)

  • Q1. System design on web applications
  • Ans. 

    System design on web applications involves planning and organizing the architecture, components, and interactions of the system.

    • Understand the requirements and constraints of the web application

    • Identify the components and modules needed for the system

    • Design the architecture including front-end, back-end, and database

    • Consider scalability, security, and performance

    • Use appropriate technologies and frameworks

    • Implement test

  • Answered by AI
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Feb 2024.

Round 1 - Coding Test 

Multiple choice + leetcode medium

Round 2 - Technical 

(1 Question)

  • Q1. Take home project, with APIs fetch etc.
  • Ans. 

    Develop a take home project involving fetching data from APIs

    • Create a project that fetches data from a public API such as weather forecast or news articles

    • Use libraries like Axios or Fetch API to make API calls

    • Display the fetched data in a user-friendly interface

    • Implement error handling for failed API calls

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. System design - Curb side pickup

Tell us how to improve this page.

Interview Questions from Similar Companies

DMart Interview Questions
3.9
 • 411 Interviews
Walmart Interview Questions
3.7
 • 388 Interviews
Titan Company Interview Questions
4.3
 • 157 Interviews
V-Mart Interview Questions
4.1
 • 150 Interviews
Shoppers Stop Interview Questions
4.1
 • 115 Interviews
Decathlon Interview Questions
3.8
 • 106 Interviews
MedPlus Interview Questions
3.6
 • 82 Interviews
Future Group Interview Questions
4.3
 • 78 Interviews
Trent Interview Questions
4.0
 • 78 Interviews
View all
Department Manager
739 salaries
unlock blur

₹1.8 L/yr - ₹5.1 L/yr

Store Manager
507 salaries
unlock blur

₹4.3 L/yr - ₹12 L/yr

Assistant Store Manager
484 salaries
unlock blur

₹3.6 L/yr - ₹6.6 L/yr

Head Cashier
227 salaries
unlock blur

₹1.1 L/yr - ₹3.5 L/yr

Retail Store Manager
186 salaries
unlock blur

₹4.7 L/yr - ₹12 L/yr

Explore more salaries
Compare Vishal Mega Mart with

DMart

3.9
Compare

Future Group

4.3
Compare

Titan Company

4.3
Compare

Walmart

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