Filter interviews by
I applied via Referral and was interviewed in Feb 2021. There were 3 interview rounds.
There are two types of network calls available in Android: Synchronous and Asynchronous.
Synchronous network calls are executed on the main thread and block the UI until the response is received.
Asynchronous network calls are executed on a separate thread and do not block the UI.
Examples of synchronous network calls include HttpUrlConnection and OkHttp.
Examples of asynchronous network calls include Retrofit and Volley.
There are two types of intents in Android: Explicit and Implicit.
Explicit Intents are used to start a specific activity within the app.
Implicit Intents are used to request an action from another app or system component.
Implicit Intents can be used to open a web page, send an email, or make a phone call.
Intents can also carry data between activities or apps.
FrameLayout is a layout manager that allows multiple child views to be stacked on top of each other.
FrameLayout is used to display a single view at a time.
It is commonly used for displaying fragments, dialogs, and popups.
It is also useful for creating custom views with overlapping elements.
The child views are positioned relative to the top-left corner of the layout.
The last child added to the layout is displayed on top
Services in Android are background processes that can run even when the app is not in foreground.
Services are used for long-running operations such as playing music or downloading files.
They can be started and stopped using startService() and stopService() methods.
Services can also be bound to an activity using bindService() method.
Foreground services are used for tasks that require user attention such as playing music...
Firebase offers a variety of features for mobile and web app development.
Realtime Database
Authentication
Cloud Firestore
Cloud Storage
Cloud Functions
Hosting
Crashlytics
Performance Monitoring
Remote Config
Dynamic Links
Broadcast receiver is a component that receives and responds to system-wide broadcast announcements.
Broadcast receiver is a part of the Android system that listens to system-wide broadcast announcements.
It can be used to receive and respond to events such as battery low, network connectivity changes, incoming SMS, etc.
It can be registered either statically in the AndroidManifest.xml file or dynamically in code.
Once reg...
Coordinating layout is a type of layout in Android that allows multiple child views to be positioned relative to each other.
Coordinating layout is used to create complex and dynamic user interfaces.
It allows views to be positioned relative to each other using constraints.
It is more flexible than other types of layouts like LinearLayout and RelativeLayout.
Examples of coordinating layouts include ConstraintLayout and Coo
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
I applied via Company Website and was interviewed in Oct 2018. There was 0 interview round.
I applied via Naukri.com and was interviewed before Oct 2019. There were 3 interview rounds.
TCS
Accenture
Wipro
Cognizant