i
EduTech VC
Filter interviews by
I applied via Approached by Company and was interviewed in Apr 2023. There was 1 interview round.
posted on 26 Jun 2017
I appeared for an interview before Jun 2016.
The question asks to construct a k-ary tree using the given k and DFS traversal string.
Iterate through the DFS traversal string
If the current character is 'P', create a parent node
If the current character is 'L', create a leaf node
Link the nodes according to the DFS traversal order
To determine if a graph has a node with n degree, iterate through all nodes and count their edges.
Iterate through each node in the graph
Count the number of edges connected to each node
If any node has n edges, then the graph has a node with n degree
I applied via Referral and was interviewed in Jun 2023. There were 3 interview rounds.
Asked about the SQL and python.
Mostly Excel based, and they see if your answers are logical or not!
If you have visualization like PowerBi or Tableau Project then they will ask to explain and share details!
Mensa is an international high IQ society that provides a forum for intellectual exchange among its members.
Mensa was founded in 1946 in the UK by Roland Berrill and Dr. Lance Ware.
To join Mensa, individuals must score in the top 2% of the general population on a standardized intelligence test.
Mensa has members in more than 100 countries around the world.
The organization hosts various events, gatherings, and activities...
posted on 13 Feb 2025
I appeared for an interview before Feb 2024.
First round was a coding test which has 2 problem solving questions and 3 subjective questions based on C++
More of a subjective round, highly focused on OS, networking and computer architecture.
posted on 21 Jun 2022
3 coding questions
A time series database stores data points with timestamps for efficient retrieval and analysis.
Choose a suitable data model for the database
Use a time-based partitioning scheme for efficient data retrieval
Implement compression techniques to reduce storage requirements
Support for querying and analyzing time-based data
Ensure data consistency and durability
Consider scalability and high availability
Examples: InfluxDB, Time
posted on 7 Nov 2024
2 coding questions based on DSA.
posted on 13 Feb 2025
I appeared for an interview before Feb 2024.
I prefer a mix of both working from the office and working from home.
I believe in the benefits of face-to-face collaboration and communication that come with working from the office.
At the same time, I appreciate the flexibility and productivity that working from home offers.
I think a hybrid approach, where employees have the option to choose between WFO and WFH based on their tasks and preferences, is ideal.
I have exp...
posted on 14 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
Understand the problem statement and expected output.
Review the code for syntax errors, logical errors, and potential bugs.
Use debugging tools like breakpoints, print statements, and IDE debuggers.
Test the code with different inputs to identify the bug.
Make necessary corrections based on the iden...
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
Traverse the binary tree to find the target node.
Use BFS to traverse the tree from the target node to nodes at distance K.
Keep track of the distance while traversing the tree.
Return the values of nodes at distance K in any order.
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input beg...
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as the key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Return the length of the longest subarray found.
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.
posted on 28 May 2022
I appeared for an interview in Feb 2022.
Round duration - 90 minutes
Round difficulty - Easy
Consisted of 3 DSA questions and MCQ on python proficiency
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome by comparing it with its reverse.
Store all palindromic substrings in a set to ensure uniqueness.
Return the sorted list of palindromic substrings.
Round duration - 60 minutes
Round difficulty - Medium
It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems
Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.
The grid has only one i...
Calculate the perimeter of an island represented by a binary grid.
Iterate through the grid and count the perimeter based on land cells and their adjacent cells.
Each land cell contributes 4 units to the perimeter, subtract 2 units for each adjacent land cell.
Handle edge cases where land cells are at the boundaries of the grid.
Return the total perimeter for each test case.
Round duration - 60 minutes
Round difficulty - Hard
DSA+OS
Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...
Calculate the minimum number of steps Ninja needs to cut down all trees in a forest grid.
Iterate through the grid to find the shortest path to cut down all trees in order.
Use a priority queue to keep track of the shortest trees to cut next.
If it's impossible to cut all trees, return -1.
Consider all four cardinal directions for movement in the grid.
Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional
based on 3 interviews
Interview experience
based on 62 reviews
Rating in categories
IT Helpdesk Analyst
15
salaries
| ₹4.2 L/yr - ₹8.5 L/yr |
Java Developer
12
salaries
| ₹4.8 L/yr - ₹6.5 L/yr |
Business Analyst
9
salaries
| ₹5.4 L/yr - ₹11 L/yr |
Customer Success Manager
8
salaries
| ₹14 L/yr - ₹17.7 L/yr |
Full Stack Developer
6
salaries
| ₹6 L/yr - ₹8.4 L/yr |
Sequoia Capital
Matrix Partners
Kalaari Capital
Nexus Venture Partners