i
Tracxn
Filter interviews by
Top trending discussions
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
How to maintain control spillage
F&V stages refer to the different stages of fruits and vegetables from harvesting to consumption.
The first stage is harvesting, where the produce is picked from the plant.
The second stage is grading, where the produce is sorted based on quality and size.
The third stage is packaging, where the produce is packed for transportation and storage.
The fourth stage is transportation, where the produce is transported to the mar...
Majorily on SQL and Databases
Use CSS to align two images with same width and height on a page
Set both images to have the same width and height using CSS
Use flexbox or grid layout to align the images horizontally or vertically
Adjust margins or padding to fine-tune the alignment
I applied via Referral and was interviewed in Aug 2024. There was 1 interview round.
I was asked question on sliding window on finding the largest subarray with all distinct numbers. The interviewer was very helpful.
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Duration 1Hr
2 coding questions
I applied via Walk-in and was interviewed in Jan 2022. There was 1 interview round.
Maximum sale medicine
I was interviewed in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were a total of 3 coding questions to be solved, and the time limit was 90 minutes. The candidate was free to use language of their choice.
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
The task is to find the length of the longest palindromic subsequence in a given string.
A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters.
A string is said to be palindrome if the reverse of the string is the same as the actual string.
Find the longest palindromic subsequence by considering all possible subs...
Round duration - 45 minutes
Round difficulty - Easy
The first round of interview lasted for around 45 minutes. I was asked two DSA questions, and was supposed to code them while my screen was shared. I wrote code for both the questions with little help from the interviewer. Finally, I was asked couple of questions based on my resume.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...The task is to merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged list
Compare the values of the nodes from both lists and add the smaller value to the new list
Move the pointer of the list with the smaller value to the next node
Repeat the comparison and addition until one of the lists is empty
Add the remaining nodes from the non-empty list to the new list
Return th
Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...
The task is to check if one string can be converted into another string by cyclically rotating it to the right any number of times.
Iterate through each character of the first string and check if it matches the corresponding character in the second string after a certain number of cyclic rotations.
If all characters match for any number of cyclic rotations, then the first string can be converted into the second string.
Us...
Round duration - 30 minutes
Round difficulty - Medium
I was given one data structure question and was then asked about recursion.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of the elements
For each element, pop elements from the stack until a greater element is found or the stack is empty
If a greater element is found, it is the next greater element for the current element
If the stack becomes empty, there is no greater element to the right
Store the ...
Round duration - 40 minutes
Round difficulty - Easy
This was the hiring manager round. No data structures question were asked in this round. There was discussion around the projects that I had done and my resume. As I am from EEE branch, I was asked why I want to get into software. The interview happened around 8 PM. I was asked to create a schema for one of my projects.
I want to get into software because of my passion for problem-solving and the opportunity to create innovative solutions.
Passion for problem-solving
Opportunity to create innovative solutions
Interest in technology and its impact on society
Career growth and job stability
Flexibility and remote work options
Tip 1 : Practice regularly, meaning once you have covered all the topics, revisit them every week, and solve 3-5 questions.
Tip 2 : Use the Feynman technique. Explain your approach towards solving the problem to someone, or better yet, note it down so that when you revisit that question, the explanation is handy.
Tip 3 : Do 1 project, preferably a full-stack one including a database. This would provide some material for discussion, and be through with each aspect of the project.
Tip 1 : Keep the resume to one page and put info that is directly related to the role applied.
Tip 2 : In the projects section, keep a maximum of 3 projects, but ensure that at least one of them is hosted/live that can be shown to the interviewer.
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Basic React JS clock/ stopwatch
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Information Executive
269
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
132
salaries
| ₹0 L/yr - ₹0 L/yr |
Research Analyst
120
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Vice President
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Manager
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Sequoia Capital
Matrix Partners
Kalaari Capital
Nexus Venture Partners