Filter interviews by
String related problems
Top trending discussions
I applied via Company Website and was interviewed in Apr 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Jan 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2021. There were 3 interview rounds.
Yes, I have knowledge of Hadoop data warehouse.
I have experience in designing and implementing Hadoop-based data warehouses.
I am proficient in Hadoop ecosystem technologies such as HDFS, MapReduce, Hive, and Pig.
I have worked with large-scale data processing and storage using Hadoop.
I am familiar with data warehousing concepts such as ETL, data modeling, and data integration.
I have used Hadoop to build data warehouses
Yes, I have used Python scripts extensively in my testing.
I have used Python scripts for automated testing of web applications.
I have also used Python scripts for unit testing of backend code.
Python's unittest module is particularly useful for this purpose.
I have also used Python scripts for load testing and performance testing.
Python's requests library is very helpful for testing APIs.
I have also used Python scripts f
I applied via Recruitment Consultant and was interviewed in May 2021. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 interview rounds.
They will ask you simple programs to check your logical abilities.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Software Engineer
228
salaries
| ₹20.1 L/yr - ₹70 L/yr |
Software Engineer2
151
salaries
| ₹20 L/yr - ₹62 L/yr |
Software Engineer
102
salaries
| ₹27.6 L/yr - ₹47.6 L/yr |
Software Developer
53
salaries
| ₹10.2 L/yr - ₹35.4 L/yr |
Devops Engineer
44
salaries
| ₹4.6 L/yr - ₹16 L/yr |
Salesforce
Yodlee
Xoriant
CitiusTech