i
Tracxn
Filter interviews by
I applied via Job Portal and was interviewed in Mar 2024. There was 1 interview round.
I solve complex production environments by identifying issues, optimizing performance, and implementing solutions.
Identifying bottlenecks and optimizing performance
Troubleshooting and resolving production issues
Implementing scalable solutions for high traffic websites
Working with cloud services like AWS or Azure
Automating deployment processes with tools like Jenkins or Docker
Developed a real-time chat feature for a social networking platform.
Implemented WebSocket technology for instant messaging
Designed user interface for chat window with message history
Integrated push notifications for new messages
Developed backend logic for message encryption and decryption
I prepared the design doc by outlining the requirements, architecture, data flow, and user interactions.
Outlined the requirements and goals of the feature
Defined the architecture and technologies to be used
Described the data flow and interactions between components
Included wireframes or mockups for user interfaces
Listed potential edge cases and how to handle them
Check if Array2 is a substring of Array1
Iterate through Array1 and check if each element contains Array2
Use built-in string functions like includes() or indexOf() to check for substring
Consider edge cases like empty arrays or arrays with empty strings
Breadcrumbs in React can be built using a combination of state management and conditional rendering.
Create a state variable to store the breadcrumb data.
Update the state variable as the user navigates through the application.
Render the breadcrumbs component with the data stored in the state.
Design a parking system with APIs for managing parking spots and reservations.
Create API for adding new parking spots with details like location, availability, and pricing
Create API for listing available parking spots based on location and availability
Create API for reserving a parking spot with user details and duration
Create API for cancelling a parking reservation
Response object for adding parking spot: { success: t...
Top trending discussions
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
Implement using a doubly linked list and a hashmap for efficient operations
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Binary search to find the closest element in a sorted array
Implement binary search to find the target element in the array
Keep track of the closest element found so far while searching
Update the closest element if a closer one is found during the search
Low level design for an online e-commerce website involves designing the architecture and components of the website.
Identify the main components such as user interface, database, payment gateway, product catalog, etc.
Design the database schema to store user information, product details, orders, etc.
Implement user authentication and authorization mechanisms for secure access.
Integrate payment gateway for processing tran...
I applied via campus placement at RV College Of Engineering (RVCE) and was interviewed in Aug 2024. There were 2 interview rounds.
3 Medium level dsa questions
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.
Define the interactions between these components and how data flows between them.
Specify the data structures and algorithms used for efficient bookin...
It was an online test
HAckerrank based test
I applied via campus placement at Pondicherry University and was interviewed in May 2024. There were 2 interview rounds.
Basic aptitude with tracing program
3 problem with easy to hard
I was interviewed in Jun 2021.
Round duration - 60 minutes
Round difficulty - Medium
Algorithm and Data Structures. MCQ based on dbms, html, css, js, sql, oops, program output.
The first line contains an Integer &...
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
Pseudo Code:
The key idea behind this approach is that we can transform each string into a string representing the character count. We will use an array “count”, of size 26 such that each element of the array represents the number of a’s, b’s, c’s and so on… We will be using these frequencies to create a string, delimited by ‘#’ characters, that we will use as a key for our HashMap.
For example :
str=”abbccc”...
Round duration - 60 minutes
Round difficulty - Medium
Algorithm and Data Structures. Sql queries insert and update commands.
The basic idea is that, try all possible transactions, means move to every index and try to perform one transaction before the current index and one after the current index. For all the possibilities choose maximum.
The idea is to use BFS traversal of the graph because considering an edge between any two adjacent words(words that will have a difference of only one alphabet) after that you just have to find the shortest between the start word and the target word and that can be done using BFS.
Here is the algorithm:
Round duration - 45 minutes
Round difficulty - Medium
Some questions related to html and css. What are the various selector in css. SQL queries on how to use group by and having. Difference between truncate and delete.
The basic idea is to use modified Breadth-First Search (BFS) here. We can keep track of all the possible positions of the robot after ‘N’ instructions (N = 0, 1, 2, 3, 4, ...) and return the smallest ‘N’ such that the ‘TARGET’ position is reached
The steps are as follows:
Tip 1 : Practice leetcode medium problems and also geeksforgeeks
Tip 2 : Have good knowledge of OOPS concept
Tip 3 : Good to know about Java
Tip 1 : Put your achievements like ranks in coding contest or leetcode rating
Tip 2 : Better to have Java as a skill and some good projects or internships.
4-12 Yrs
₹ 10-25 LPA
Information Executive
262
salaries
| ₹1.6 L/yr - ₹3.9 L/yr |
Business Development Manager
157
salaries
| ₹3.3 L/yr - ₹8 L/yr |
Research Analyst
107
salaries
| ₹2 L/yr - ₹6 L/yr |
Associate Vice President
85
salaries
| ₹7.3 L/yr - ₹29 L/yr |
Senior Business Development Manager
80
salaries
| ₹4.5 L/yr - ₹10.9 L/yr |
Sequoia Capital
Matrix Partners
Kalaari Capital
Nexus Venture Partners