Filter interviews by
Sorting an array of 0, 1 and 2 can be done in O(n) using two pointers.
Use two pointers, one for 0 and one for 2, and a current pointer to traverse the array
If the current pointer encounters a 0, swap it with the 0 pointer and move both pointers to the right
If the current pointer encounters a 2, swap it with the 2 pointer and move the 2 pointer to the left
Repeat until the current pointer meets the 2 pointer
Algorithm to find if a number is present in a sorted n x n matrix with linear time complexity.
Start with the top right element
Compare the element with x
If equal, return its position
If e < x, move down (if out of bounds, return false)
If e > x, move left (if out of bounds, return false)
Repeat till element is found or returned false
The problem is to find non-empty subsets of a given set of integers whose sum is zero.
The problem is a special case of the knapsack problem and is known to be NP-Complete.
A brute-force approach would involve generating all subsets and checking their sums.
The brute-force approach has an exponential time complexity.
There is no known polynomial time solution for this problem.
Data structure with O(1) insert, delete, and find min without creating new structures
Use two stacks, one for actual data and one for minimum values
When inserting, push the value onto the data stack and push the minimum of the new value and the top of the minimum stack onto the minimum stack
When deleting, pop from both stacks
When finding the minimum, return the top of the minimum stack
I applied via Walk-in and was interviewed in Feb 2023. There were 5 interview rounds.
Basic HR Round to get basic requirements of IT Manager
I applied via Recruitment Consulltant
It was a clear job and I managed to do well with the guidelines presented. This is not a real review because theyre forcing me to write one
None at all of course this is all nonsense because I want to read reviews so I need to write this crap
The coding test was just terrific easy and manageable all in all a good experience
I applied via Naukri.com and was interviewed before Jun 2023. There were 2 interview rounds.
Given a set of questions to be solved within a given time frame.
Directi interview questions for popular designations
I have a strong background in product management and a passion for creating innovative solutions. I applied for the Product Manager position at DirectI because of their reputation for excellence and the opportunity to work on their cutting-edge products.
I have X years of experience in product management, successfully launching several products in the past.
I have a proven track record of driving product strategy and del...
The case solution submitted suggested features such as personalized recommendations, social media integration, and a user-friendly interface.
Personalized recommendations based on user behavior and preferences
Social media integration for easy sharing and promotion
User-friendly interface with intuitive navigation and clear calls to action
Integration with third-party services such as payment gateways and shipping provider...
The subscription feature is a revenue stream.
Subscription feature allows users to pay for premium content or services.
Estimate revenue based on current user base and potential growth.
Consider pricing strategy and competition.
Example: Spotify Premium generates $1.5 billion in revenue annually.
The bid for the AdWord should be based on the value of a click and the conversion rate.
Calculate the value of a click by estimating the revenue generated per click.
Determine the conversion rate of the website to estimate the number of clicks needed to generate a sale.
Consider the competition for the keyword and adjust the bid accordingly.
Use tools like Google Keyword Planner to estimate the bid range for the keyword.
Re...
As Product Manager of YouTube, troubleshoot the problem of falling average time spent on YouTube by a user in the last 2 weeks.
Analyze user behavior and identify the reason for the drop in average time spent
Conduct surveys to understand user preferences and expectations
Review competitor offerings and identify areas of improvement
Introduce new features or content to increase user engagement
Improve user experience and in...
Merge two unsorted arrays into one sorted array.
Create a new array to store the merged array
Loop through both arrays and add elements to the new array
Sort the new array using any sorting algorithm
Return the sorted array
Factors to consider while designing a recommendation engine for a news website like MSN.
Identify user preferences and behavior
Analyze user history and engagement
Consider content relevance and recency
Incorporate social media trends and user feedback
Use collaborative filtering and machine learning algorithms
Ensure diversity in recommendations
Optimize for speed and scalability
Ad fraud and detecting bot fraud mechanisms
Ad fraud can be carried out through click fraud, impression fraud, and conversion fraud
Detecting bot fraud can be done through analyzing user behavior, IP addresses, and device information
Other mechanisms include using machine learning algorithms and third-party verification tools
Examples of bot fraud detection tools include WhiteOps, DoubleVerify, and Integral Ad Science
Algorithm to list Fibonacci series and find median of combined array with and without 3rd array
For Fibonacci series, start with 0 and 1, then add previous two numbers to get next number
For finding median of combined array, merge the two arrays and sort them, then find the middle element(s)
For finding median without 3rd array, use two pointers to traverse both arrays simultaneously and keep track of previous and current
As a Product Manager, my typical day involved collaborating with cross-functional teams, analyzing market trends, and prioritizing product roadmap.
Collaborated with cross-functional teams to ensure alignment on product vision and roadmap
Analyzed market trends and customer feedback to identify opportunities for product improvement
Prioritized product roadmap based on business goals and customer needs
Conducted user resear...
A car sharing app that connects car owners with people who need a ride.
Users can search for available cars in their area and book a ride.
Car owners can list their car and set their own price for the ride.
The app should have a rating system for both drivers and passengers.
Payment should be handled through the app.
Customer acquisition strategy can include social media advertising, referral programs, and partnerships with
Advertisers want to remove 'skip to video' option on Youtube. How should it be priced?
Pricing should be based on the length of the video.
Advertisers should pay more for longer videos.
Pricing should also consider the popularity of the video.
Advertisers should pay more for popular videos.
Auction-based pricing could be used to determine the price.
Advertisers could bid on the price they are willing to pay for the option.
Pr...
Feasibility and monetisation strategy for product features.
Conduct market research to determine demand and willingness to pay
Assess technical feasibility and resource requirements
Consider potential revenue streams and pricing models
Evaluate competition and differentiation opportunities
Prioritize features based on impact and feasibility
Iterate and refine monetisation strategy based on user feedback
As PM of Flipkart, what SQL data would you ask the DB admin to find the root cause of cart abandonment increase?
Ask for data on the number of abandoned carts in the last week compared to previous weeks
Check if there were any changes made to the checkout process or payment options
Analyze the data on the products that were abandoned in the cart
Look for any technical issues or errors that may have occurred during the chec...
I was interviewed in Jan 2021.
Round duration - 60 minutes
Round difficulty - Medium
There were 2 coding questions. All of them were pretty easy and solvable in less than 40 minutes. Some string and pattern matching + some number theory problems were there.
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
A subarray can be derived from th...
Find the contiguous subarray with the maximum product of elements in an array.
Iterate through the array and keep track of the maximum and minimum product ending at each index.
Update the maximum product by taking the maximum of current element, current element * previous maximum, current element * previous minimum.
Update the minimum product by taking the minimum of current element, current element * previous maximum, cu...
Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...
Evaluate postfix expressions by applying operators after operands. Return result modulo (10^9+7).
Iterate through each character in the postfix expression
If character is an operand, push it onto the stack
If character is an operator, pop two operands from stack, apply operator, and push result back
Repeat until end of expression, return final result modulo (10^9+7)
Round duration - 60 minutes
Round difficulty - Hard
This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.
You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your objective is to identify and list all nodes that do not possess a...
Identify and list nodes in a Binary Tree that do not have a sibling.
Traverse the Binary Tree in level order to identify sibling nodes.
Keep track of nodes without siblings and output them in ascending order.
Handle cases where nodes have only one child or no children.
Consider the root node as a sibling node.
Sort the output list of nodes without siblings in ascending order.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
Design a streaming service like Netflix and explain content onboarding process.
Create a user-friendly dashboard for content providers to submit new content.
Implement a review process to ensure quality and compliance with guidelines.
Use algorithms to categorize and recommend new content to users based on their preferences.
Negotiate licensing deals with production companies to acquire new content.
Regularly update the lib
Tip 1 : Make sure to solve the most recommended problems of LeetCode. Around 200 will do
Tip 2 : Be confident with your basics of chapters from Operating Systems and DBMS or SQL Queries.
Tip 3 : Have a slight knowledge of system designing concepts.
Tip 1 : Make your Resume such that it is properly readable. Keep it of one page. If it exceeds try your best to include only the most important highlights.
Tip 2 : Put your most important achievements at the top and after than the not so important ones. You want the interviewer to see them first.
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
It was problem solving round.
Questions revolve around solving problems in javascript.
Like deep flattened the array, print level wise elements of same problem.
Given a sorted array of integers of size N and an integer X, determine the total number of occurrences of X in the array.
The first line of the...
Count occurrences of a given integer in a sorted array.
Use binary search to find the first and last occurrence of X in the array.
Calculate the total occurrences by subtracting the indices and adding 1.
Handle edge cases like X not present in the array.
Time complexity can be O(log N) using binary search.
Round duration - 60 minutes
Round difficulty - Medium
There were 2 problems, related to DS and Algorithms.
Given a binary tree, implement a function that returns a list of leaf nodes following their appearance from left to right. If leaf nodes are equidistant from the left...
Implement a function to retrieve leaf nodes from a binary tree in left-to-right order.
Traverse the binary tree in a depth-first manner, keeping track of leaf nodes encountered.
Store leaf nodes in a list while traversing the tree.
If leaf nodes are equidistant from the leftmost node, prefer the node at a lesser depth.
Return the list of leaf nodes in the order they appear from left to right.
We are executing a program containing 'N' functions on a single-threaded CPU. Each function has a unique 'ID' between 0 and (N-1). Each time a function starts or ends, a log is...
Calculate exclusive time of functions based on logs of function start and end times.
Parse the input logs to calculate exclusive time for each function ID.
Use a stack to keep track of function start times and calculate exclusive time when function ends.
Iterate through the logs and update exclusive time for each function ID accordingly.
Round duration - 60 Minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Develop a lots of projects with medium complexity [around 5-8].
Tip 2 : Develop projects using css, js html to practice machine coding round under time constraints
Tip 3 : Prepare mostly asked interview questions in JS.
Tip 1: Keep resume only 1 page, don't keep your college at top of resume unless you are from tier 1 and good academic record [I keep at last , though from tier 1 college but poor academic record] .
Tip 2: Write projects, interns and what impact you made, don't waste lines about project.
I was interviewed in Dec 2017.
Maximum Sum SubArray Problem is to find the contiguous subarray within a one-dimensional array of numbers which has the largest sum.
The problem can be solved using Kadane's algorithm in O(n) time complexity.
Initialize two variables, max_so_far and max_ending_here, to 0.
Loop through the array and for each element, add it to max_ending_here.
If max_ending_here becomes negative, reset it to 0.
If max_so_far is less than max...
Find a rectangular region in a binary matrix with k 1's.
Iterate over all possible rectangular regions and count the number of 1's in each.
Use a sliding window approach to efficiently count the number of 1's in each rectangular region.
Use dynamic programming to precompute the number of 1's in each sub-rectangle and answer queries in constant time.
Find the maximum sum of non-consecutive elements in an array.
Create an array to store the maximum sum up to each index.
Iterate through the array and calculate the maximum sum at each index.
Return the maximum sum at the last index of the array.
Exclude consecutive elements by skipping the previous index in the sum calculation.
Find indices i and j such that A[i]>a[j] and i>j such that ij is minimum
Iterate through the array and keep track of the minimum value and its index
Iterate through the array again and check if A[i]>min and i
If yes, update the minimum index to j
Return the minimum index
Time complexity: O(n)
Finding majority element in an array
Use a hash table to store the frequency of each element
Iterate through the hash table to find the element with frequency greater than n/2
If no such element exists, return -1
Find any duplicate number in an array of very big size
Use a hash table to keep track of visited numbers
Iterate through the array and check if the number is already in the hash table
If it is, return the number as duplicate
Top trending discussions
Some of the top questions asked at the Directi interview -
based on 6 interviews
Interview experience
Software Development Engineer II
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
TCS
Infosys
Wipro