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 Software Engineer 1 Interview Questions and Answers

Updated 10 Jul 2024

Tracxn Senior Software Engineer 1 Interview Experiences

1 interview found

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

I applied via Naukri.com and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Online coding test. It was not so difficult.

Round 2 - Technical 

(2 Questions)

  • Q1. There was one DSA question. Very professional interviewer.
  • Q2. Given a set of non negative integers, arrange them such that, they form largest number
  • Ans. 

    Arrange non-negative integers to form the largest number

    • Convert integers to strings for comparison

    • Sort strings in descending order based on custom comparator

    • Join sorted strings to form the largest number

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. The question was about Nodejs
  • Q2. The question was to build a linked list in Nodejs
Round 2 - Technical 

(2 Questions)

  • Q1. The first question was related to DSA
  • Q2. The question was related to SQL
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

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Referral and was interviewed in Aug 2024. There was 1 interview round.

Round 1 - Coding Test 

I was asked question on sliding window on finding the largest subarray with all distinct numbers. The interviewer was very helpful.

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

(4 Questions)

  • Q1. Explain Deadlock?
  • Q2. Explain Red Black Tree?
  • Q3. Find local minima in a 1-D array?
  • Q4. Find local minima in 2-D array?
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Round 1 - Aptitude Test 

Duration 1Hr
2 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Don't remember the questions
  • Q2. Don't remember the questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - easy interview. anyone can crack easily if you are clear with basic concepts.

I was interviewed 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
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.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.

Round 1 - Coding Test 

2 coding question one on maximum sum problem and other on tree traversal

Round 2 - Technical 

(1 Question)

  • Q1. Dbms oops dsa questions are there and one coding question which you have to pseudo code it and dry run it

I was interviewed 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

Tracxn Interview FAQs

How many rounds are there in Tracxn Senior Software Engineer 1 interview?
Tracxn interview process usually has 2 rounds. The most common rounds in the Tracxn interview process are Coding Test and Technical.
What are the top questions asked in Tracxn Senior Software Engineer 1 interview?

Some of the top questions asked at the Tracxn Senior Software Engineer 1 interview -

  1. Given a set of non negative integers, arrange them such that, they form largest...read more
  2. There was one DSA question. Very professional interview...read more

Tell us how to improve this page.

Tracxn Senior Software Engineer 1 Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zepto Interview Questions
3.5
 • 207 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Digit Insurance Interview Questions
4.0
 • 142 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
Urban Company Interview Questions
3.4
 • 134 Interviews
Ninjacart Interview Questions
4.0
 • 94 Interviews
View all

Tracxn Senior Software Engineer 1 Reviews and Ratings

based on 1 review

2.0/5

Rating in categories

2.0

Skill development

2.0

Work-life balance

4.0

Salary

4.0

Job security

2.0

Company culture

3.0

Promotions

2.0

Work satisfaction

Explore 1 Review and Rating
Information Executive
269 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Manager
132 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Research Analyst
120 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Vice President
84 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Business Development Manager
83 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Tracxn with

Sequoia Capital

3.4
Compare

Matrix Partners

2.8
Compare

Kalaari Capital

3.5
Compare

Nexus Venture Partners

3.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview