i
TriNet
Filter interviews by
Clear (1)
1 hour , leetcode medium
DSA question.
1 - stocks buy/sell
I applied via Naukri.com and was interviewed before Aug 2023. There were 4 interview rounds.
Implement a linked list data structure and solve a problem using it.
Understand the basic concepts of linked lists such as nodes and pointers.
Implement functions to insert, delete, and search for elements in the linked list.
Solve a problem like reversing a linked list or finding the middle element using linked list operations.
Design a system similar to TrueCaller for identifying unknown callers.
Implement a database of phone numbers and associated names
Allow users to report spam numbers
Use machine learning algorithms to identify spam calls
Provide a caller ID feature for incoming calls
Led development of a cloud-based inventory management system for a retail company.
Managed a team of 5 developers to design and implement the system
Utilized AWS services for scalability and reliability
Integrated with existing ERP system for seamless data flow
Seeking new challenges and opportunities for growth
Looking for a new challenge to further develop my skills and knowledge
Interested in exploring different technologies and industries
Seeking opportunities for career advancement and growth
Current job lacks opportunities for professional development
Top trending discussions
I was interviewed in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was late evening . Platform was good.
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr
of 'N' integers where arr[i]
denotes the cell number that can be reached from the 'i'...
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.
Keep track of visited cells to avoid infinite loops.
Return the length of the largest cycle found or -1 if no cycles exist.
Tip 1 : Do some projects
Tip 2 : Be good in data structure
Tip 1 : Keep it short
Tip 2 : Don't try to add false things.
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
When reaching the destination, add the path to the list of valid paths.
Tip 1 : Practice question and try to understand with using javascript
Tip 2 : The Elm Architecture.
Tip 3 : Project matters
Tip 1 : Have web development project
Tip 2 : learn purescript and node.js
3 Graph Questions Were asked of difficulty medium to hard.
Hackathon round which revolved around multithreading
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Hard questions of graph and dp.
It was good and tough
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
They have their own coding platform. The questions are basically from tree.
Tree of space question
I was interviewed before Sep 2023.
Designing Facebook involves creating a social networking platform with features like user profiles, news feed, messaging, and more.
Create a user registration and login system
Develop a news feed algorithm to display relevant content
Implement a messaging system for users to communicate
Design a user profile page with customizable options
Incorporate features like groups, events, and pages
Ensure scalability and security of
Reverse a linked list
Iterative approach using three pointers
Recursive approach with base case and recursive call
In-place reversal using stack
based on 3 interviews
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Tax Specialist
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Automatic Data Processing (ADP)
Paychex IT Solutions India
Glint
MagicPin