Filter interviews by
Code to delete duplicate nodes in a sorted linked list
Traverse the linked list and compare adjacent nodes
If nodes are equal, delete one of them
Repeat until all duplicates are removed
Printing all root to leaf paths in a binary search tree
Traverse the tree recursively and keep track of the current path
When a leaf node is reached, add the current path to the list of paths
Print all the paths in the list
Use an array of strings to store the paths
Find two integers in an array whose sum is closest to zero.
Sort the array in ascending order.
Initialize two pointers at the beginning and end of the array.
Move the pointers towards each other until the sum is closest to zero.
Count set bits in a 32-bit integer in linear time
Use bit manipulation to count set bits
Divide the integer into 16-bit chunks and count set bits in each chunk
Use lookup tables to count set bits in each 8-bit chunk
Use parallel processing to count set bits in multiple integers simultaneously
To determine the width of a binary tree using breadth-wise traversal, we need to count the number of nodes at each level.
Perform a breadth-first traversal of the binary tree
Count the number of nodes at each level
Keep track of the maximum number of nodes seen at any level
Return the maximum number of nodes seen
Files are preferred over databases for certain types of data and applications.
Files are faster for small amounts of data.
Files are easier to manage and backup.
Files are more flexible for certain types of data, such as images or videos.
Databases are better for complex data relationships and queries.
Databases are more secure and scalable for large amounts of data.
The choice between files and databases depends on the spec
I applied via Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
It was a coding round interview along with interviewer via Virtual mode. I was given 2 coding questions on HackerRank for the interview:
1. one was an easy problem on counting minimum replacements.
2. "pat is an ordinary kid who works hard to be a great runner...." this was a challenging problem (which I managed to solve).
3. I was asked some basic Python questions, as the role was for a Python Developer.
I would use a relational database like MySQL for the Parking lot as it provides structured data storage and supports complex queries.
Relational databases like MySQL offer structured data storage for parking lot information
Supports complex queries for managing parking lot data efficiently
Ability to handle large amounts of data and transactions
Provides data integrity and security features
Can easily integrate with other s
posted on 11 Dec 2024
I applied via LinkedIn and was interviewed in Nov 2024. There were 3 interview rounds.
Basic DSA from the hacker rank website
I applied via Walk-in and was interviewed in Nov 2024. There were 2 interview rounds.
1st round is aptitude and pesudocode
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
In first round 4 coding question like 1 dsa 2 database and one is api and question is very simple . coding round was conducted in hackerrank
Again same but dsa question and oops concept in deep level
I am a software developer with 5 years of experience in Java, Python, and SQL.
5 years of experience in Java, Python, and SQL
Worked on developing web applications using Java Spring framework
Proficient in database management with SQL
Key concepts of OOP include encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: Bundling data and methods that operate on the data into a single unit (object).
Inheritance: Allowing a class to inherit properties and behavior from another class.
Polymorphism: Objects of different classes can be treated as objects of a common superclass.
Abstraction: Hiding complex implementation details and showing onl
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where the pair will be stored.
If multiple keys hash to the same index (collision), a linked list is used to store these pairs.
To retrieve a value, t...
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
2medium level questions
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There were 2 interview rounds.
Some of the top questions asked at the Informatica Software Developer interview -
based on 1 review
Rating in categories
Software Engineer
176
salaries
| ₹9 L/yr - ₹30 L/yr |
Senior Software Engineer
150
salaries
| ₹10 L/yr - ₹40 L/yr |
Associate Software Engineer
70
salaries
| ₹6 L/yr - ₹16.8 L/yr |
Lead Software Engineer
59
salaries
| ₹24 L/yr - ₹51 L/yr |
Senior QA Engineer
58
salaries
| ₹13 L/yr - ₹26 L/yr |
TCS
Wipro
HCLTech
Tech Mahindra