Filter interviews by
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
Binary search program code in Python
Define a function that takes a sorted array and a target value as input
Initialize two pointers, low and high, to the start and end of the array
While low is less than or equal to high, calculate mid as (low + high) // 2 and compare array[mid] with target
If array[mid] is equal to target, return mid
If array[mid] is less than target, update low to mid + 1
If array[mid] is greater than tar...
Top trending discussions
Data structure and algorithms
I applied via Referral and was interviewed in Dec 2023. There was 1 interview round.
Strong consistency ensures that all replicas of data are updated synchronously, while eventual consistency allows for temporary inconsistencies.
Strong consistency guarantees that all clients see the same data at the same time.
Eventual consistency allows for temporary inconsistencies but eventually all replicas will converge to the same state.
Strong consistency is often used in systems where data integrity is critical, ...
Calculating the size of a file system
Determine the total size of all files and directories within the file system
Include the size of all subdirectories and their contents
Consider the size of metadata and file system overhead
Use appropriate tools or commands to gather the necessary information
I applied via Campus Placement
Question related to operating system and computer network
I applied via campus placement at Dayananda Sagar College of Engineering, Bangalore and was interviewed in Oct 2024. There were 4 interview rounds.
3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well
Ssh round , quant and logical
Tip: bring your calculator
I was interviewed before Jan 2024.
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
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...
posted on 24 Sep 2024
Map unique elements in an array of strings
Create a map to store unique elements
Iterate through the array and add each element to the map as a key
Retrieve the keys of the map to get the unique elements
Sets are data structures that store unique elements and can be used to efficiently find elements in the set.
Sets do not allow duplicate elements, so each element in a set is unique.
To find elements in a set, you can use the 'has' method to check if a specific element is present in the set.
Sets are commonly used in programming for tasks like removing duplicates from a list or checking for the presence of specific elemen
based on 1 review
Rating in categories
Software Engineer
385
salaries
| ₹5.6 L/yr - ₹23.5 L/yr |
Senior Software Engineer
241
salaries
| ₹8.5 L/yr - ₹32 L/yr |
Software Developer
188
salaries
| ₹5.3 L/yr - ₹19.5 L/yr |
Software Engineer2
158
salaries
| ₹9.8 L/yr - ₹21 L/yr |
Software Engineer II
147
salaries
| ₹9.2 L/yr - ₹21.5 L/yr |
TCS
Infosys
Wipro
HCLTech