i
Intellias
Filter interviews by
I applied via Company Website and was interviewed before Mar 2023. There was 1 interview round.
Use a loop to iterate through the list and compare each element with the target element
Iterate through the list using a loop
Compare each element with the target element
Return the element if found, otherwise return null
I applied via Company Website and was interviewed in Apr 2021. There was 1 interview round.
posted on 11 Feb 2025
A linked list is a linear data structure where elements are stored in nodes with each node pointing to the next node in the sequence.
Consists of nodes connected by pointers
Can be singly linked (each node points to the next) or doubly linked (each node points to the next and previous)
Allows for dynamic size and efficient insertion/deletion operations
posted on 24 Jun 2024
I applied via Campus Placement
45 questions were asked
3 questions were asked one from SQL and 2 from java
posted on 22 Nov 2024
Encapsulation, Inheritance, Polymorphism, Abstraction are the four pillars of OOPS in Java.
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 to present the same interface for different data types.
Abstraction: Hiding the implementation details and showing only the necessary features.
A constructor in Java is a special type of method that is used to initialize objects.
Constructors have the same name as the class they are in.
They do not have a return type, not even void.
Constructors are called when an object of a class is created.
Example: public class Car { public Car() { // constructor code } }
I applied via Recruitment Consulltant and was interviewed before Sep 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
There were 13 MCQ questions on DSA, 17 MCQ aptitude questions, and 2 coding questions.
Check if after interleaving strings s1 and s2, we get s3 as one of the answers.
Create a recursive function to check all possible interleavings of s1 and s2
Check if the current interleaving matches s3
Return true if a valid interleaving is found, false otherwise
Cluster indexing physically reorders the data on disk to match the index, while non-cluster indexing does not.
Cluster indexing physically reorders the data on disk to match the index structure, leading to faster retrieval of data.
Non-cluster indexing creates a separate data structure that points to the actual data, which may result in slower retrieval times.
Cluster indexing is typically used in primary keys, while non-...
Stack memory is used for static memory allocation and follows a Last In First Out (LIFO) structure, while heap memory is used for dynamic memory allocation and has a more flexible structure.
Stack memory is limited in size and is typically faster to access compared to heap memory.
Variables stored in stack memory have a fixed size determined at compile time, while variables in heap memory can have a size determined at ru...
A stable sort is a sorting algorithm that preserves the relative order of equal elements in the sorted output.
Stable sorts are useful when the original order of equal elements needs to be maintained.
Examples of stable sorting algorithms include Merge Sort, Bubble Sort, and Insertion Sort.
In a stable sort, if two elements have the same key value, their relative order in the original array is preserved in the sorted arra
Time complexity of insertion in a hashmap is O(1).
Insertion in a hashmap has a constant time complexity of O(1) on average.
This is because hashmaps use a hashing function to determine the index where the key-value pair should be stored.
Even in the worst-case scenario, where there are collisions, the time complexity is still O(1) due to techniques like chaining or open addressing.
Example: Inserting a key-value pair into...
Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.
Hashing is used to securely store passwords by converting them into a hash value.
Hashing is used in data structures like hash tables to quickly retrieve data based on a key.
Common hash functions include MD5, SHA-1, and SHA-256.
I applied via Referral and was interviewed before Jun 2023. There was 1 interview round.
2 Greedy Algo problems
I applied via Job Portal and was interviewed in Aug 2022. There were 4 interview rounds.
2 coding questions 10 aptitude and other 15 technical questions
I applied via Referral and was interviewed in Aug 2023. There were 2 interview rounds.
Leetcode practice should be sufficient to tackle this round.
Trapping Rain Water problem involves calculating the amount of water that can be trapped between buildings given their heights.
Calculate the maximum height of buildings to the left and right of each building
Find the minimum of the two heights
Subtract the height of the current building to get the amount of water that can be trapped at that building
based on 1 interview
Interview experience
Senior Software Engineer
4
salaries
| ₹25 L/yr - ₹38 L/yr |
Business Development Executive
3
salaries
| ₹16 L/yr - ₹16 L/yr |
Arcesium
Diverse Lynx
Solartis Technology Services
NexWave Talent Management Solutions