Filter interviews by
I applied via Approached by Company and was interviewed in Jun 2024. There was 1 interview round.
Asked about dictionary in C# and performance of Dictionary and Azure CI/CD experience details
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Binary search to find the closest element in a sorted array
Implement binary search to find the target element in the array
Keep track of the closest element found so far while searching
Update the closest element if a closer one is found during the search
Low level design for an online e-commerce website involves designing the architecture and components of the website.
Identify the main components such as user interface, database, payment gateway, product catalog, etc.
Design the database schema to store user information, product details, orders, etc.
Implement user authentication and authorization mechanisms for secure access.
Integrate payment gateway for processing tran...
I applied via campus placement at RV College Of Engineering (RVCE) and was interviewed in Aug 2024. There were 2 interview rounds.
3 Medium level dsa questions
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.
Define the interactions between these components and how data flows between them.
Specify the data structures and algorithms used for efficient bookin...
I applied via campus placement at Indraprastha Institute of Information Technology (IIIT), Delhi and was interviewed in Aug 2024. There was 1 interview round.
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
Start at the root node and compare the value of the node to be inserted with the current node.
If the value is less than the current node, move to the left child node. If it is greater, move to the right child node.
Repeat this process until reaching a leaf node, then insert ...
Find the sum of kth to bth largest numbers in a huge array efficiently.
Sort the array in descending order to easily find the kth and bth largest numbers.
Use a priority queue or min heap to efficiently find the kth and bth largest numbers without sorting the entire array.
Once you have the kth and bth largest numbers, iterate through the array and sum the numbers between them.
I applied via Job Portal and was interviewed in Aug 2024. There were 2 interview rounds.
DSA + JAVA + Spring boot
LLD (bookmyshow) + DSA
posted on 4 Sep 2024
Medium level question are asked
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Experienced Salesforce Developer with a passion for creating efficient solutions and improving user experience.
Over 5 years of experience developing custom Salesforce solutions
Strong knowledge of Apex, Visualforce, Lightning components, and Salesforce integrations
Certified Salesforce Developer with proven track record of successful project implementations
Collaborative team player with excellent communication skills
Pass...
I have over 5 years of experience as a Salesforce Developer, working on various projects and customizations.
Developed custom Salesforce solutions for clients in different industries
Implemented automation processes using Apex and Visualforce
Integrated third-party applications with Salesforce platform
Worked on data migration and system integration projects
Provided technical support and training to end users
based on 1 interview
Interview experience
Executive Accountant
5
salaries
| ₹17 L/yr - ₹20 L/yr |
Inside Sales Representative
4
salaries
| ₹17 L/yr - ₹19 L/yr |
Software Developer
3
salaries
| ₹21 L/yr - ₹24 L/yr |
Technical Consultant
3
salaries
| ₹9 L/yr - ₹10.5 L/yr |
Brand Manager
3
salaries
| ₹14 L/yr - ₹14.5 L/yr |
Infobip
RouteMobile
Kaleyra
Tanla Platforms