Filter interviews by
The Trapping Rain Water problem calculates how much rainwater can be trapped between elevation bars after rainfall.
The problem involves an array representing heights of bars.
Water trapped above each bar depends on the minimum of the tallest bars to its left and right.
Example: For heights [0,1,0,2,1,0,1,3,2,1,2,1], the trapped water is 6 units.
Use two-pointer technique for an efficient O(n) solution.
Dynamic program...
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
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 ...
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...
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.
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...
I applied via Company Website and was interviewed in Jun 2024. There were 3 interview rounds.
3 questions, medium hard
I applied via Campus Placement and was interviewed in Jul 2023. There were 2 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-...
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...
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 in Aug 2023. There were 2 interview rounds.
Leetcode practice should be sufficient to tackle this round.
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 before Jun 2023. There was 1 interview round.
2 Greedy Algo problems
I applied via Company Website and was interviewed in Apr 2021. There was 1 interview round.
Top trending discussions
I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.
Hashtable is synchronized while hashmap is not.
Hashtable is thread-safe while hashmap is not.
Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.
Hashtable is slower than hashmap due to synchronization.
Hashtable is a legacy class while hashmap is a newer implementation.
Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.
Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.
Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.
Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.
Concurrent Hashmap is slower than Hashma...
I applied via Naukri.com and was interviewed before Sep 2020. There were 4 interview rounds.
Some of the top questions asked at the Arcesium Software Engineer interview -
based on 4 interview experiences
Difficulty level
Duration
based on 16 reviews
Rating in categories
Senior Analyst
385
salaries
| ₹14.6 L/yr - ₹25.4 L/yr |
Analyst
327
salaries
| ₹10.2 L/yr - ₹19 L/yr |
Senior Software Engineer
252
salaries
| ₹25 L/yr - ₹43 L/yr |
Manager
162
salaries
| ₹23 L/yr - ₹38.5 L/yr |
Software Engineer
157
salaries
| ₹18 L/yr - ₹33 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech