Filter interviews by
Be the first one to contribute and help others!
posted on 25 May 2023
I applied via Naukri.com and was interviewed before May 2022. There were 2 interview rounds.
I applied via Naukri.com
I applied via Naukri.com and was interviewed in Jan 2023. There were 4 interview rounds.
All about profit, percentages,desicion making, English grammar etc
I applied via Referral and was interviewed before May 2023. There was 1 interview round.
posted on 28 Dec 2021
I applied via Naukri.com and was interviewed before Dec 2020. There were 4 interview rounds.
posted on 4 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 2 interview rounds.
Standard Aptitude topics, 30 mins - 30 questions
posted on 10 Nov 2021
Filters in Tableau and SQL are used to narrow down data based on specific criteria.
Filters in Tableau can be applied to individual worksheets or the entire dashboard
SQL filters can be applied using the WHERE clause
Tableau filters can be based on dimensions or measures
SQL filters can be based on any column in the table
Tableau filters can be interactive, allowing users to adjust the criteria
SQL filters can be combined wi
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...
Desktop Support Engineer
174
salaries
| ₹1.5 L/yr - ₹4.5 L/yr |
Engineer- Customer Support
55
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
Desktop Support Engineer L2
19
salaries
| ₹2 L/yr - ₹4.2 L/yr |
Desktop Support Engineer L1 and L2
15
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Information Technology Support Engineer
14
salaries
| ₹2 L/yr - ₹3.9 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech