i
6Sense
Filter interviews by
Count the number of unival subtrees in a binary tree, where all nodes have the same value.
A unival subtree is a subtree where all nodes have the same value.
To count unival subtrees, perform a post-order traversal of the tree.
During traversal, check if the current node's value matches its children's values.
If a node is a unival subtree, increment the count and return true for that subtree.
Example: For a tree with r...
Design a cab fare service considering demand, weather, and traffic factors.
1. Fare Calculation: Base fare + variable factors (demand, weather, traffic).
2. Demand Factor: Surge pricing during peak hours or events (e.g., concerts).
3. Weather Impact: Increased fares during rain or snow due to higher demand.
4. Traffic Conditions: Higher fares during rush hours or accidents causing delays.
5. User Interface: Mobile app ...
Check if all nodes in an n-ary tree have the same value (unival tree).
A unival tree has all nodes with the same value, e.g., [1, [1, 1], [1, 1]] is unival.
If any child node has a different value, return false, e.g., [1, [1, 2], [1]] is not unival.
Use a recursive function to traverse the tree and compare values.
A rate limiter controls the number of requests a user can make to a service in a given timeframe.
Use token bucket or leaky bucket algorithms for implementation.
Set limits based on user roles (e.g., free vs. premium users).
Implement a sliding window to allow burst traffic while enforcing limits.
Store request counts in a distributed cache like Redis for scalability.
Provide feedback to users when limits are reached (...
Find the longest substring in a given string that reads the same forwards and backwards.
A palindrome is a string that reads the same forwards and backwards, e.g., 'racecar'.
To find the longest palindromic substring, we can use dynamic programming or expand around the center technique.
Example: For the input 'babad', the longest palindromic substring can be 'bab' or 'aba'.
Dynamic programming approach involves creati...
Find the kth largest element in an unsorted array using efficient algorithms.
Use a max heap to extract the largest elements. Example: For [3, 2, 1, 5, 6, 4] and k=2, the result is 5.
Alternatively, use quickselect algorithm for average O(n) time complexity. Example: For [3, 2, 1, 5, 6, 4] and k=2, it finds 5.
Sorting the array and accessing the kth largest element is O(n log n). Example: Sort [3, 2, 1, 5, 6, 4] to g...
Implement a function to mimic the functionality of merging two DataFrames in Python.
Create a function that takes two DataFrames as input.
Merge the two DataFrames based on a common column or index.
Handle different types of joins like inner, outer, left, and right joins.
Return the merged DataFrame as output.
I appeared for an interview in Mar 2025, where I was asked the following questions.
Check if all nodes in an n-ary tree have the same value (unival tree).
A unival tree has all nodes with the same value, e.g., [1, [1, 1], [1, 1]] is unival.
If any child node has a different value, return false, e.g., [1, [1, 2], [1]] is not unival.
Use a recursive function to traverse the tree and compare values.
Count the number of unival subtrees in a binary tree, where all nodes have the same value.
A unival subtree is a subtree where all nodes have the same value.
To count unival subtrees, perform a post-order traversal of the tree.
During traversal, check if the current node's value matches its children's values.
If a node is a unival subtree, increment the count and return true for that subtree.
Example: For a tree with root 5...
A rate limiter controls the number of requests a user can make to a service in a given timeframe.
Use token bucket or leaky bucket algorithms for implementation.
Set limits based on user roles (e.g., free vs. premium users).
Implement a sliding window to allow burst traffic while enforcing limits.
Store request counts in a distributed cache like Redis for scalability.
Provide feedback to users when limits are reached (e.g.,...
Design a cab fare service considering demand, weather, and traffic factors.
1. Fare Calculation: Base fare + variable factors (demand, weather, traffic).
2. Demand Factor: Surge pricing during peak hours or events (e.g., concerts).
3. Weather Impact: Increased fares during rain or snow due to higher demand.
4. Traffic Conditions: Higher fares during rush hours or accidents causing delays.
5. User Interface: Mobile app for f...
I appeared for an interview in Jan 2025, where I was asked the following questions.
I appeared for an interview in Oct 2024.
Excel Test contains questions related to only excel topics mainly V lookup and all
I applied via Approached by Company and was interviewed in Jan 2024. There were 2 interview rounds.
Implement a function to mimic the functionality of merging two DataFrames in Python.
Create a function that takes two DataFrames as input.
Merge the two DataFrames based on a common column or index.
Handle different types of joins like inner, outer, left, and right joins.
Return the merged DataFrame as output.
1 hour - Find longest palindromic substring
Manager and employee problem. Given a table with id, Employee, managerId. Print the hierarchy in a tree format.
I applied via Company Website and was interviewed in Mar 2023. There were 7 interview rounds.
I applied via LinkedIn and was interviewed before Nov 2022. There were 7 interview rounds.
About Jira Permission and approval seeking through Automation
I appeared for an interview before Mar 2024, where I was asked the following questions.
Top trending discussions
Some of the top questions asked at the 6Sense interview -
The duration of 6Sense interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 10 interview experiences
Difficulty level
Duration
based on 105 reviews
Rating in categories
Software Engineer III
37
salaries
| ₹27.6 L/yr - ₹41.4 L/yr |
Research Specialist
16
salaries
| ₹2.2 L/yr - ₹4.2 L/yr |
Senior Software Engineer
15
salaries
| ₹37 L/yr - ₹52 L/yr |
Senior Product Manager
12
salaries
| ₹43.1 L/yr - ₹60 L/yr |
Product Manager
8
salaries
| ₹32 L/yr - ₹38.5 L/yr |
Celebal Technologies
NoBrokerHood
Duck Creek Technologies
Innovaccer