Filter interviews by
I applied via Approached by Company and was interviewed in Jan 2022. There were 2 interview rounds.
Top trending discussions
I applied via Approached by Company
Joining tables with different joins in SQL
Use INNER JOIN to return rows when there is at least one match in both tables
Use LEFT JOIN to return all rows from the left table and the matched rows from the right table
Use RIGHT JOIN to return all rows from the right table and the matched rows from the left table
Use FULL JOIN to return rows when there is a match in one of the tables
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
I applied via Walk-in and was interviewed before Aug 2022. There were 4 interview rounds.
Test of SQL, Tableau and other skills based on your resume on Skillate
I applied via Naukri.com and was interviewed before Feb 2022. There were 3 interview rounds.
I applied via Company Website and was interviewed before Jul 2021. There were 3 interview rounds.
Data validation in Hive involves using built-in functions and custom scripts to ensure data accuracy and consistency.
Use built-in functions like IS NULL, IS NOT NULL, and COALESCE to check for missing or null values
Use regular expressions and pattern matching to validate data formats
Write custom scripts to perform more complex data validation tasks
Perform data profiling to identify potential data quality issues
Use data...
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 4 Sep 2022
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
DSA Medium Level Questions. Solve within 3 Hours.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
based on 1 review
Rating in categories
Business Development Executive
22
salaries
| ₹3 L/yr - ₹6 L/yr |
Lead Generation Executive
15
salaries
| ₹2.7 L/yr - ₹4.7 L/yr |
Executive Accountant
10
salaries
| ₹3.9 L/yr - ₹6.4 L/yr |
Senior Medical Coder
8
salaries
| ₹4.6 L/yr - ₹6.8 L/yr |
Senior Team Leader
6
salaries
| ₹4.5 L/yr - ₹4.5 L/yr |
Medcode
Maxgen Technologies
Cyfuture
Value Point Systems