Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Tracxn Team. If you also belong to the team, you can get access from here

Tracxn Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Tracxn Senior Full Stack Developer Interview Questions and Answers

Updated 11 Apr 2024

6 Interview questions

A Senior Full Stack Developer was asked
Q. Given two arrays, determine if Array2 is a substring of Array1.
Ans. 

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

A Senior Full Stack Developer was asked
Q. How would you implement breadcrumbs in React?
Ans. 

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.

Senior Full Stack Developer Interview Questions Asked at Other Companies

Q1. How the clients of one domain will be made to access the API serv ... read more
Q2. How do you configure the Authentication system in API service and ... read more
asked in Boeing
Q3. Describe a critical situation you faced and how you solved the pr ... read more
asked in Boeing
Q4. Any idea which increased performance and have benefited in delive ... read more
Q5. In ReactJS, when is it best to use state variables versus propert ... read more
A Senior Full Stack Developer was asked
Q. What kind of production environment problems have you solved?
Ans. 

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

A Senior Full Stack Developer was asked
Q. How did you prepare the design doc for this feature? What was your Approach?
Ans. 

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

A Senior Full Stack Developer was asked
Q. How will you design a parking system? What api's will you create ? Their body and response object.
Ans. 

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: { succe...

A Senior Full Stack Developer was asked
Q. What Features you have worked on? Explain 1 feature?
Ans. 

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

Tracxn Senior Full Stack Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Portal and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(7 Questions)

  • Q1. What is your Role and responsibility in your current organization?
  • Q2. What Kind of Production environments do you solve?
  • Ans. 

    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

  • Answered by AI
  • Q3. What Features you have worked on? Explain 1 feature?
  • Ans. 

    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

  • Answered by AI
  • Q4. How did you prepare the design doc for this feature? What was your Approach?
  • Ans. 

    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

  • Answered by AI
  • Q5. Find if Array2 is a substring of Array1
  • Ans. 

    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

  • Answered by AI
  • Q6. How will you build breadcrums in react?
  • Ans. 

    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.

  • Answered by AI
  • Q7. How will you design a parking system? What api's will you create ? Their body and response object.
  • Ans. 

    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...

  • Answered by AI

Skills evaluated in this interview

Are these interview questions helpful?

Top trending discussions

View All
Interview Tips & Stories
1w (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Tracxn?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

The test was conducted in the evening from 5:00 pm to 6:30 pm. Because of the covid situation, all the students attempted the test from their homes. But it was a webcam-based test to avoid any kind of cheating.
There were 3 coding problems to be done in 90 minutes.
After resume based shortlisting, 70 candidates were selected to appear for the test out of which 30 were shortlisted for interviews.

  • Q1. 

    Amazing Strings Problem Statement

    Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".

    Input:

    Line ...
  • Ans. 

    Check if the third string contains all characters from the first and second strings in any order.

    • Create a frequency map for characters in the first and second strings.

    • Check if all characters in the third string are present in the frequency map.

    • Ensure the count of characters in the third string matches the count in the frequency map.

    • Return 'YES' if all conditions are met, otherwise return 'NO'.

  • Answered by AI
  • Q2. 

    Shortest Path Visiting All Nodes

    You are given a connected undirected unweighted graph comprising 'N' nodes and 'M' edges. In this graph, each pair of connected nodes is linked by exactly one undirected e...

  • Ans. 

    Find the length of the shortest path visiting all nodes in a connected undirected unweighted graph.

    • Use Breadth First Search (BFS) to find the shortest path that visits all nodes at least once.

    • Maintain a bitmask to keep track of visited nodes and their states.

    • Consider all possible permutations of nodes to find the shortest path length.

  • Answered by AI
  • Q3. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

Round 2 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

This round started at 9 am and went till 4 pm.
Out of 70 students that appeared in online coding test, 30 were shortlisted for the first round (this round) of interviews.
In this round, everyone was asked one moderate level coding question. The interviewer provided the link to an IDE, where I wrote my code.
The interview started with the introduction being followed by 1 coding problem. In the end, the interviewer asked me if I wanted to ask any questions. To which I asked him my feedback so that I can improve my wear areas.
Of the 30 candidates, 17 were selected for the final interview round.

  • Q1. 

    Print All Subsets Challenge

    Given an array arr containing 'N' distinct integers, your task is to generate all possible non-empty subsets of this array.

    Note: While the elements within each subset should ...

  • Ans. 

    Generate all possible non-empty subsets of an array of distinct integers.

    • Use recursion to generate all subsets by including or excluding each element in the array.

    • Maintain a current subset and add it to the result when reaching the end of the array.

    • Ensure elements within each subset are in increasing order.

    • Handle the input and output format as specified in the question.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

This was a technical + HR round. Started in the evening at 4:30 pm, this round went till 9:30 pm.
17 students were shortlisted for this final round of interview.
This interview was also virtual and involved both technical and HR-related questions. The interview started with an introduction and then questions based on my resume were asked.
Out of 17 candidates, 8 candidates got a full-time offer from Urban Company.

  • Q1. 

    Find Row With Maximum 1's in a Sorted 2D Matrix

    You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...

  • Ans. 

    Find the row with the maximum number of 1's in a sorted 2D matrix.

    • Iterate through each row of the matrix and count the number of 1's in each row.

    • Keep track of the row index with the maximum number of 1's seen so far.

    • Return the index of the row with the maximum number of 1's.

    • If multiple rows have the same number of 1's, return the row with the smallest index.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA and more than 70% in 10th and 12thUrban Clap interview preparation:Topics to prepare for the interview - Object-Oriented Programming, Data Structures, Dynamic Programming, Operating System, Database Management System, System DesignTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Coding Problems are asked from DSA, so a good practice of standard problems is a must. Revisit these problems before the interview to ace and crack the interview.
Tip 2 : To tackle the conceptual questions, you need to have thorough knowledge about the concepts, so to prepare for OS and DBMS, read one standard book.
Tip 3 : Have proper and clear knowledge about your project. Basic but tricky questions are asked based on the internship experience and the projects you have done.

Application resume tips for other job seekers

Tip 1 : The best way to ace an interview is to take command of your interview in your hands. And this is done by having a balanced resume. Projects give direction to the interview and increase the probability of selection. So add at least 2 projects.
Tip 2 : Urban Company seeks team players and not just good coders. So add your achievements outside the academics to get shortlisted.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.

  • Q1. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

  • Q2. 

    Maximize XOR Value

    You are provided with an integer X and are tasked with identifying an integer Y such that the bitwise XOR operation between X and Y yields the maximum possible value. The condition is t...

  • Ans. 

    Find an integer Y such that XOR operation with X yields maximum value within given constraints.

    • Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.

    • To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.

    • Ensure the final Y does not exceed (2^61) - 1.

    • Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.

    • Examp...

  • Answered by AI
  • Q3. 

    Minimize Maximum Difference Between Adjacent Elements

    You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...

  • Ans. 

    Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.

    • Sort the array in non-decreasing order.

    • Iterate through the array and calculate the difference between adjacent elements.

    • Remove elements to minimize the maximum difference.

    • Return the minimized maximum difference.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.

  • Q1. 

    Frequency in a Sorted Array Problem Statement

    Given a sorted array ARR and a number X, your task is to determine the count of occurrences of X within ARR.

    Note:

    • If X is not found in the array, return...
  • Ans. 

    Count occurrences of a number in a sorted array efficiently.

    • Use binary search to find the first and last occurrence of the target number in the array.

    • Calculate the count of occurrences by subtracting the indices of the last and first occurrences.

    • Handle cases where the target number is not found in the array.

    • Time complexity: O(log(N)), Space complexity: O(1).

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Q3. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

Round 3 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.

Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

It was the culture fit round taken by the Director of Engineering.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in GurgaonEligibility criteriaNoneUrban Clap interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic programming, Algorithms, DBMS, OSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.

Application resume tips for other job seekers

Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Dec 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It has 3 Coding Questions of medium-hard level and the time limit was 1 hour only. I don’t exactly remember the questions but I was able to do only two of them completely.

  • Q1. 

    Biggest Number Formation Problem

    Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.

    Input:

    Integer T denoting the nu...
  • Ans. 

    Construct the largest number by concatenating positive integers in the array exactly once.

    • Sort the array of integers in a way that the concatenation of the numbers forms the largest possible number.

    • Use a custom comparator function to sort the numbers based on their concatenated values.

    • Join the sorted array elements to form the final largest number.

  • Answered by AI
  • Q2. 

    Number of Longest Increasing Subsequence Problem Statement

    Given an integer array ARR of length N, determine the count of longest increasing subsequences present in the array.

    Explanation:

    The Longest I...

  • Ans. 

    Count the number of longest increasing subsequences in an integer array.

    • Identify the longest increasing subsequences in the array

    • Count the number of such subsequences

    • Consider the constraints while implementing the solution

    • Examples: For input [50, 3, 90, 60, 80], the output is 2

  • Answered by AI
Round 2 - Telephonic Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

First, the interviewer introduced himself and then asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 3 coding questions on their personal live code environment.

He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.

  • Q1. 

    Cache Operations Problem

    You are provided with a cache that can hold a maximum of 'N' elements. Initially, this cache is empty. There are two main operations you can perform on this cache:

    Explanation:

      ...
  • Ans. 

    Implement a cache with insert, update, and retrieve operations, returning results of retrieve operations in order.

    • Create a cache data structure with specified size 'N'.

    • Implement insert and update operations based on the given criteria.

    • For retrieve operation, return the value associated with the 'U_ID' if present, else return -1.

    • Handle cases where the cache is full and least frequently used items need to be removed.

    • Retu...

  • Answered by AI
  • Q2. 

    Possible Words from a Phone Number: Problem Statement

    Given a string S composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...

  • Ans. 

    Given a phone number, generate all possible words by mapping digits to letters on a T9 keypad.

    • Create a mapping of digits to letters on a T9 keypad

    • Use recursion to generate all possible combinations of letters for the given phone number

    • Sort the resulting strings in lexicographical order

  • Answered by AI
  • Q3. 

    Shortest Unique Prefix Problem

    You are given an array containing N words. Your task is to derive the shortest prefix for each word that uniquely identifies it amongst the other words. For instance, given t...

  • Ans. 

    Given an array of words, find the shortest unique prefix for each word.

    • Create a Trie data structure to efficiently store and search for prefixes.

    • Traverse the Trie to find the shortest unique prefix for each word.

    • Return the list of shortest unique prefixes for all words.

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

In this round interviewer gave me 2 coding questions and asked me to code on any editor of my choice. I opened VS code to code those problems.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in a given array.

    • Iterate through the array and keep track of the maximum sum subarray seen so far.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Handle cases where all elements are negative by returning the maximum element in the array.

    • Consider the sum of an empty subarray as 0.

  • Answered by AI
  • Q2. 

    LRU Cache Implementation

    Design and implement a data structure for the Least Recently Used (LRU) cache, which supports the following operations:

    1. get(key) - Return the value associated with the key if ...
  • Ans. 

    Implement a Least Recently Used (LRU) cache data structure with get and put operations.

    • Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and remove it when the cache reaches its capacity.

    • Update the position of an item in the cache whenever it is accessed or updated.

    • Ensure constant time complexity for both get and put operations by u...

  • Answered by AI
Round 4 - HR 

Round duration - 40 Minutes
Round difficulty - Easy

The interviewer was very friendly. He asked me about myself and previous interviews.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPATata 1mg interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Database Management, Operating System, Aptitude.Time required to prepare for the interview - 3.5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do at least 2-3 Development Projects as it creates a great impression. 
Tip 2 : Do it simply don't include complex terms to explain anything/concept. 
Tip 3 : Practice as many questions as you can.

Application resume tips for other job seekers

Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. React JS, coding round, DSA, poly phill, map , shallow copy deep copy, popular JS DSA questions
Round 3 - Assignment 

Basic React JS clock/ stopwatch

Interview Preparation Tips

Interview preparation tips for other job seekers - know how to create componenets, and Easy to early medium level DSA leetcode JS based.

I appeared for an interview in Dec 2021.

Round 1 - Coding Test 

(1 Question)

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.

  • Q1. 

    Longest Palindromic Subsequence Problem Statement

    Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.

    Explanation:

    • A subsequ...
  • Ans. 

    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...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    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.

    ...
  • Ans. 

    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...

  • Answered by AI
  • Q2. 

    Rotational Equivalence of Strings Problem Statement

    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...

  • Ans. 

    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...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

I was given one data structure question and was then asked about recursion.

  • Q1. 

    Next Greater Element Problem Statement

    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...

  • Ans. 

    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 ...

  • Answered by AI
Round 4 - Video Call 

(1 Question)

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.

  • Q1. Why do you want to pursue a career in software?
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPATata 1mg interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, Number Theory, LLD, PuzzlesTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Basic coding only not to worry much

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about ur self
  • Ans. 

    I am a passionate software developer with experience in Java, Python, and web development.

    • Experienced in Java, Python, and web development technologies

    • Strong problem-solving skills

    • Excellent team player with good communication skills

  • Answered by AI
  • Q2. What is ur projects
  • Ans. 

    I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.

    • Developed a web-based inventory management system using React and Node.js

    • Created a mobile app for tracking fitness goals using Flutter

    • Implemented RESTful APIs for communication between frontend and backend systems

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - all the best do well!
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Template and Reactive Forms in Angular
  • Ans. 

    Template and Reactive Forms in Angular are two ways to handle forms in Angular applications.

    • Template Forms are based on the traditional HTML forms and are easy to use for simple forms.

    • Reactive Forms are more flexible and powerful, allowing for complex form validation and dynamic form controls.

    • Template Forms use two-way data binding, while Reactive Forms use a more reactive approach with observables.

    • Reactive Forms are r...

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Majorily on SQL and Databases

Round 2 - Technical 

(2 Questions)

  • Q1. Align two images in a page with same width and same height
  • Ans. 

    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

  • Answered by AI
  • Q2. Array related question
Round 3 - HR 

(2 Questions)

  • Q1. Situation based question
  • Q2. Majorily focused on project

Skills evaluated in this interview

Tracxn Interview FAQs

How many rounds are there in Tracxn Senior Full Stack Developer interview?
Tracxn interview process usually has 1 rounds. The most common rounds in the Tracxn interview process are Technical.
How to prepare for Tracxn Senior Full Stack Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Tracxn. The most common topics and skills that interviewers at Tracxn expect are Full Stack, MongoDB, Javascript, MySQL and Python.
What are the top questions asked in Tracxn Senior Full Stack Developer interview?

Some of the top questions asked at the Tracxn Senior Full Stack Developer interview -

  1. How did you prepare the design doc for this feature? What was your Approa...read more
  2. How will you design a parking system? What api's will you create ? Their body a...read more
  3. What Features you have worked on? Explain 1 featu...read more

Tell us how to improve this page.

Overall Interview Experience Rating

3/5

based on 1 interview experience

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.7
 • 474 Interviews
Meesho Interview Questions
3.7
 • 369 Interviews
Udaan Interview Questions
3.9
 • 347 Interviews
BlackBuck Interview Questions
3.7
 • 194 Interviews
Tata 1mg Interview Questions
3.6
 • 188 Interviews
Digit Insurance Interview Questions
3.8
 • 158 Interviews
Paisabazaar.com Interview Questions
3.4
 • 156 Interviews
Urban Company Interview Questions
3.4
 • 143 Interviews
Ninjacart Interview Questions
3.9
 • 100 Interviews
Zetwerk Interview Questions
4.0
 • 100 Interviews
View all
Information Executive
254 salaries
unlock blur

₹1.5 L/yr - ₹4 L/yr

Research Analyst
127 salaries
unlock blur

₹2 L/yr - ₹6 L/yr

Business Development Manager
84 salaries
unlock blur

₹3.7 L/yr - ₹8 L/yr

Associate Vice President
75 salaries
unlock blur

₹13.6 L/yr - ₹25 L/yr

Senior Business Development Manager
72 salaries
unlock blur

₹4.9 L/yr - ₹9.6 L/yr

Explore more salaries
Compare Tracxn with

Udaan

3.9
Compare

Swiggy

3.7
Compare

BlackBuck

3.7
Compare

Ninjacart

3.8
Compare
write
Share an Interview