Filter interviews by
I applied via LinkedIn and was interviewed in Aug 2022. There were 4 interview rounds.
Types of joins in SQL include inner join, left join, right join, and full outer join.
Inner join: Returns rows when there is a match in both tables.
Left join: Returns all rows from the left table and the matched rows from the right table.
Right join: Returns all rows from the right table and the matched rows from the left table.
Full outer join: Returns rows when there is a match in either table.
Static RLS restricts access based on predefined rules, while dynamic RLS adjusts access based on user attributes or context.
Static RLS uses fixed rules to control access to data
Dynamic RLS adjusts access based on user attributes or context
Static RLS example: Only managers can view salary information
Dynamic RLS example: Employees can only access data for their own department
Top trending discussions
Easy with 40-50 questions
Easy was for 30 minutes. Team vs Individual
I applied via Company Website and was interviewed in May 2022. There were 7 interview rounds.
This aptitude + technical MCQ test was of 120 minutes in duration. Had MCQs on quantitative ability, logical ability, Language, and technical MCQs consisted of questions on DBMS, OS, Networks, DSA. There were two coding questions as well. One on Bit Manipulating, and the other on DFS.
Search an element in a sorted and rotated array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Proposed system for a popular media stream service
Implement a recommendation engine to suggest content based on user preferences and viewing history
Integrate with social media platforms to allow users to share and discuss content
Provide multiple subscription options with varying levels of access and features
Ensure high-quality streaming with minimal buffering through the use of content delivery networks
Implement robust...
Guesstimate on number of Reddit users in India. No starting input was given. Gave solution by using bottom to top approach. Tried to focus on quantifying teenagers with internet access and a particular interest about internet. Gave a figure around ~1 million in a year.
posted on 24 Sep 2021
I applied via Recruitment Consultant and was interviewed in Aug 2021. There was 1 interview round.
Polymorphism can be used to create a Card class with different types of cards. A function can then use polymorphism to randomize the pack.
Create a Card class with different types of cards as subclasses
Implement a function that creates a pack of cards using polymorphism to add different types of cards
Use a random number generator to shuffle the pack
I applied via Approached by Company and was interviewed before Jul 2021. There were 7 interview rounds.
Two easy questions two wasy questions two easy questions two easy questions
I appeared for an interview in Jul 2024.
Leet code medium level question
Hashmap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
Hashmap uses a hashing function to map keys to indices in an array.
It allows for constant time complexity O(1) for insertion, deletion, and retrieval operations.
Example: HashMap<String, Integer> map = new HashMap<>(); map.put("key", 123); int value = map.get("key");
1 coding question, and basic MCQ
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
I appeared for an interview before Apr 2023.
Simple basic application
based on 8 reviews
Rating in categories
4-6 Yrs
₹ 7.55-19 LPA
Research Associate
179
salaries
| ₹2 L/yr - ₹7 L/yr |
Research Analyst
109
salaries
| ₹3.2 L/yr - ₹9.8 L/yr |
Senior Research Associate
108
salaries
| ₹3.5 L/yr - ₹8.6 L/yr |
Senior Software Engineer
57
salaries
| ₹4.7 L/yr - ₹12.3 L/yr |
Analyst
55
salaries
| ₹4 L/yr - ₹10.2 L/yr |
Chegg
CMA CGM
Tekwissen
Nasser S. Al Hajri Corporation