i
Confidential Company
Filter interviews by
I applied via Referral and was interviewed before Sep 2022. There were 2 interview rounds.
Object Oriented Programming is a programming paradigm based on the concept of objects, which can contain data and code.
OOP focuses on creating objects that interact with each other to solve problems
Encapsulation: bundling data and methods that operate on the data into a single unit
Inheritance: allows a class to inherit properties and behavior from another class
Polymorphism: ability for objects to be treated as instance...
Different normal forms in DBMS help in organizing data efficiently and reducing redundancy.
First Normal Form (1NF) - Eliminates repeating groups and ensures each attribute contains only atomic values.
Second Normal Form (2NF) - Meets 1NF requirements and all non-key attributes are fully functional dependent on the primary key.
Third Normal Form (3NF) - Meets 2NF requirements and eliminates transitive dependencies between...
My expected CTC is based on my experience, skills, and the market rate for Salesforce Developers.
Consider my years of experience in Salesforce development
Research the current market rate for Salesforce Developers in the location
Factor in any additional skills or certifications that may add value
Top trending discussions
I applied via Naukri.com and was interviewed in Sep 2021. There were 2 interview rounds.
Types of test steps in software testing
Unit testing - testing individual units or components of the software
Integration testing - testing how different units or components work together
System testing - testing the entire system as a whole
Acceptance testing - testing if the software meets the requirements and is ready for release
Regression testing - testing to ensure that changes or updates to the software did not intro...
Answering questions about transformation and lookup types used in a project
Transformation types used in the project may include data mapping, aggregation, filtering, and sorting
Lookup is a process of searching for a specific value in a table or database
Types of lookup include exact match, range match, and fuzzy match
Questions about organization may refer to project management, team collaboration, or software developmen
I applied via Company Website and was interviewed in Jun 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Feb 2021. There were 4 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in Aug 2020. There was 1 interview round.
I applied via Walk-in and was interviewed in Aug 2020. There were 4 interview rounds.
based on 1 interview
Interview experience
TCS
Accenture
Wipro
Cognizant