Filter interviews by
I applied via Company Website and was interviewed in Jul 2023. There were 2 interview rounds.
Android app making project
Volley is an HTTP library that makes networking for Android apps easier and faster.
Volley library handles network requests in a background thread
It provides request queuing and prioritization
Supports request cancellation and retry policies
Used for fetching data from the internet in Android apps
I applied via Walk-in and was interviewed before Sep 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2020. There were 4 interview rounds.
Factorial can be calculated using a loop by multiplying numbers from 1 to n.
Initialize a variable to 1
Use a loop to multiply the variable with numbers from 1 to n
Return the variable
I applied via Campus Placement and was interviewed before Apr 2020. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Jun 2021. There was 1 interview round.
Answering questions related to software development and Salesforce administration.
Process Builder is a visual tool in Salesforce used to automate business processes.
Types of relationships in Salesforce include lookup, master-detail, and many-to-many relationships.
User represents an individual who can log in and access Salesforce, Profile defines the permissions and settings for a user, and Role determines the hierarchy...
I have configured various software systems and tools for development purposes.
Configured IDEs such as Eclipse and Visual Studio for development
Set up version control systems like Git and SVN
Installed and configured build tools like Maven and Gradle
Configured application servers like Tomcat and JBoss
Set up databases like MySQL and Oracle for development and testing
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Walk-in and was interviewed in Jul 2019. There were 3 interview rounds.
I applied via Company Website and was interviewed in Feb 2021. There was 1 interview round.
Count the number of pairs in an array whose sum is equal to a given number k.
Iterate through the array and for each element, check if k minus the element exists in the array.
Use a hash table to store the frequency of each element in the array.
If the array contains duplicates, handle them separately to avoid overcounting.
Time complexity can be improved to O(n) using a two-pointer approach.
based on 1 interview
Interview experience
TCS
Accenture
Cognizant
Infosys