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 Data Entry jobs Interview Questions and Answers

Updated 24 May 2022

Tracxn Data Entry jobs Interview Experiences

1 interview found

I applied via Company Website and was interviewed in Apr 2022. There were 2 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 - Coding Test 

Fionacci series
#include
#include
int main()
{
int n1=0,n2=1,n3,i,number;
printf("Enter the number of elements:");
scanf("%d",&number);
printf("\n%d %d",n1,n2);//printing 0 and 1
for(i=2;i {
n3=n1+n2;
printf(" %d",n3);
n1=n2;
n2=n3;
}
return 0;
}
Output:


Enter the number of elements:15
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
Fibonacci Series using recursion in C
Let's see the fibonacci series program in c using recursion.

Interview Preparation Tips

Topics to prepare for Tracxn Data Entry jobs interview:
  • C
Interview preparation tips for other job seekers - I'm interested in this job. I'm giving best performance in this job. Believe in myself.

Top trending discussions

View All
Indian Startups
2w
a senior executive
One of the best sources for Startup investment: DAHEJ(DOWRY)
You won't believe my senior has a good corporate job with over 10 years of experience. But suddenly resigned just a few days after his wedding. We all thought maybe he got married and wants to spend his time with his wife, and decided to go to his place to give him a proper farewell. All of us got shocked after knowing that he left because his father-in-law gifted him a fat cash amount and a car in the name of "blessings." He’s using the money to fund his startup and the car for "business movement." I mean seriously? People are now using dowry as startup capital and walking around acting like CEOs, playing boss with someone else’s money. Bas, shaadi karo aur apne sapne chalu karo, courtesy sasural. I don't know feeling inspired? Or disgusted?
Got a question about Tracxn?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview in Oct 2022.

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

(1 Question)

  • Q1. Some rules are there
Round 3 - One-on-one 

(5 Questions)

  • Q1. I want questions what is the question of the interview
  • Q2. Don't have the question and give the this job data entry form filling
  • Q3. Interview is the very important form filling data entry writing on the
  • Q4. Assignment is the interview the first assignment I am doing
  • Q5. I am doing good best job a good day
Round 4 - Assignment 

Assignment round of the assignment data entry form filling writing of the which of using will

Interview Preparation Tips

Interview preparation tips for other job seekers - I want at home work no experience required please request for u keep work at home sharing I am doing the first job give the alternative nature after that 10th no going another job this job is first for my

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,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
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 applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

4 Questions

  • Q1. Y r u choosing this job only??
  • Q2. What's your dream?
  • Ans. 

    My dream is to create innovative software solutions that positively impact people's lives and drive technological advancement.

    • Building User-Centric Applications: I aspire to develop applications that prioritize user experience, like a health tracking app that motivates users to lead healthier lives.

    • Contributing to Open Source: I dream of contributing to open-source projects, collaborating with developers worldwide to c...

  • Answered by AI
  • Q3. My dream is to got a job
  • Q4. How much salary will you expected??

Interview Preparation Tips

Interview preparation tips for other job seekers - My advice is to be positive at any situation and be active .
Don't get feared .
Your dressing is shown ur attitude.
Give respect to the others don't forget these things.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Instahyre and was interviewed in Nov 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Easy to medium questions, Questions on DSA and Node.js.

Round 2 - Technical 

(2 Questions)

  • Q1. Valid parenthesis
  • Q2. Three sum problem
  • Ans. 

    The three sum problem involves finding unique triplets in an array that sum to zero.

    • Sort the array to simplify finding triplets.

    • Use a loop to fix one element and apply two-pointer technique for the rest.

    • Skip duplicates to ensure unique triplets.

    • Example: For array [-1, 0, 1, 2, -1, -4], the triplets are [-1, -1, 2], [-1, 0, 1].

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Zetwerk Software Developer interview:
  • js
  • node.js
  • dsa
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(4 Questions)

  • Q1. Explain Deadlock?
  • Ans. 

    Deadlock is a situation in computing where two or more processes cannot proceed because each is waiting for the other to release resources.

    • Occurs in multi-threaded environments when processes hold resources and wait for others.

    • Example: Process A holds Resource 1 and waits for Resource 2, while Process B holds Resource 2 and waits for Resource 1.

    • Can lead to system inefficiency and unresponsiveness.

    • Deadlock detection and...

  • Answered by AI
  • Q2. Explain Red Black Tree?
  • Ans. 

    A Red-Black Tree is a balanced binary search tree with specific properties to ensure efficient operations.

    • Each node is colored either red or black.

    • The root node is always black.

    • Red nodes cannot have red children (no two reds in a row).

    • Every path from a node to its descendant leaves must have the same number of black nodes.

    • This structure ensures O(log n) time complexity for insertion, deletion, and search operations.

    • Exa...

  • Answered by AI
  • Q3. Find local minima in a 1-D array?
  • Q4. Find local minima in 2-D array?
  • Ans. 

    Local minima in a 2-D array are elements smaller than their neighbors. We can find them using various algorithms.

    • A local minimum is defined as an element that is less than its adjacent elements.

    • For example, in the array [[9, 8, 7], [6, 5, 4], [3, 2, 1]], the element 1 is a local minimum.

    • To find local minima, iterate through each element and compare it with its neighbors (up, down, left, right).

    • Consider edge cases where...

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

  • Q1. 

    Implement indexOf Function

    You are provided with two strings A and B. Your task is to find the index of the first occurrence of A within B. If A is not found in B, return -1.

    Example:

    Input:
    A = "bc", ...
  • Ans. 

    Implement a function to find the index of the first occurrence of one string within another string.

    • Iterate through the second string and check if a substring of the same length as the first string matches the first string.

    • Return the index of the first occurrence of the first string within the second string, or -1 if not found.

    • Handle edge cases like empty strings or when the first string is longer than the second string...

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Implement binary search to find the target integer in the rotated array.

    • Handle the rotation by checking which side of the array is sorted before performing binary search.

    • Return the index of the target integer if found, else return -1.

    • Time complexity of O(logN) is required for each query.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

  • Q1. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    Calculate the number of distinct subsequences in a string with possible duplicates.

    • Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

    • Consider the cases where the current character is included or excluded in the subsequence.

    • Handle duplicates by considering the previous occurrence of the character.

    • Return the count of distinct subsequences modulo 10^9 + 7.

  • Answered by AI
Round 3 - HR 

Round duration - 60 minutes
Round difficulty - Easy

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAUrban Clap interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Operating System, DBMS, Greedy Algorithms, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects

Application resume tips for other job seekers

Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

Sorting of an array and aptitude

Round 2 - Technical 

(1 Question)

  • Q1. BFS graph traversal
Round 3 - Technical 

(1 Question)

  • Q1. Binary tree question
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in May 2024. There were 3 interview rounds.

Round 1 - Technical 

(4 Questions)

  • Q1. What is event loop, how it works.
  • Ans. 

    Event loop is a mechanism in programming that allows for asynchronous execution of code by continuously checking for and handling events.

    • Event loop is commonly used in JavaScript to handle asynchronous operations like setTimeout, setInterval, and AJAX requests.

    • It works by continuously checking the event queue for any pending events, executing them one by one, and then moving on to the next event.

    • Event loop helps in pre...

  • Answered by AI
  • Q2. Micro task queue and macro task queue.
  • Q3. Is node.js single threaded or multi-threaded, also discuss threadpool and it's usages.
  • Q4. Tell the order of output, among process, promise, setTimeout, fs, setInterval.
  • Ans. 

    The order of output is fs, process, setTimeout, setInterval, promise.

    • fs module is synchronous and will output first

    • process is next in line

    • setTimeout will be executed after process

    • setInterval will be executed after setTimeout

    • promise will be executed last

  • Answered by AI
Round 2 - Technical 

(4 Questions)

  • Q1. JavaScript usages compiler or interpreter.
  • Ans. 

    JavaScript is an interpreted language.

    • JavaScript is an interpreted language, meaning it is executed line by line at runtime.

    • There is no separate compilation step in JavaScript like in languages that use compilers.

    • Examples of interpreted languages include Python, Ruby, and PHP.

  • Answered by AI
  • Q2. Tell the output among various for loops using var, let and bind.
  • Ans. 

    Output comparison of for loops using var, let, and bind in JavaScript.

    • Using var: variable is function-scoped, may lead to unexpected behavior in loops.

    • Using let: variable is block-scoped, recommended for loop iterations.

    • Using bind: creates a new function with a specified 'this' value and initial arguments.

  • Answered by AI
  • Q3. A medium level dsa question on array, solved it using pre-sum.
  • Q4. Situation based question, on how to pick a suitable database.
  • Ans. 

    Choosing a database involves evaluating data structure, scalability, consistency, and specific use cases.

    • Understand data structure: Use SQL for structured data (e.g., PostgreSQL) and NoSQL for unstructured data (e.g., MongoDB).

    • Consider scalability: Choose databases like Cassandra for horizontal scaling in large applications.

    • Evaluate consistency needs: Use strong consistency databases like MySQL for critical transaction...

  • Answered by AI
Round 3 - Technical 

(4 Questions)

  • Q1. What do you do on daily basis, and how to decide a tech-stack on high level.
  • Ans. 

    I work on coding, debugging, testing, and collaborating with team members. Tech stack decisions are based on project requirements, scalability, performance, and team expertise.

    • Daily tasks include coding, debugging, testing, and collaborating with team members

    • Tech stack decisions are based on project requirements, scalability, performance, and team expertise

    • Consider factors like language compatibility, libraries/framewo...

  • Answered by AI
  • Q2. Design an online scalable, real-time document sharing application like google docs.
  • Ans. 

    Design a scalable, real-time document sharing app like Google Docs.

    • Use websockets for real-time collaboration

    • Implement version control to track changes

    • Utilize a distributed database for scalability

    • Include user authentication and access control

    • Support offline editing with automatic sync

  • Answered by AI
  • Q3. How to handle images also in the future.
  • Ans. 

    Utilize cloud storage for scalability, implement image compression techniques, and regularly update image processing libraries.

    • Utilize cloud storage for scalability

    • Implement image compression techniques

    • Regularly update image processing libraries

  • Answered by AI
  • Q4. Any other way to solve the problem, of high I/O on same document to overcome throughput and conflicts.
  • Ans. 

    Implement strategies like versioning, sharding, and caching to manage high I/O and reduce conflicts on the same document.

    • Use versioning to track changes and allow concurrent edits without conflicts. For example, implement optimistic locking.

    • Implement sharding to distribute the load across multiple servers, reducing the I/O on a single document.

    • Utilize caching mechanisms to store frequently accessed data in memory, mini...

  • Answered by AI

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

  • Ans. 

    Determine the minimum number of conference rooms required for scheduling meetings.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of rooms needed based on overlapping times.

    • Use a priority queue to efficiently allocate rooms.

    • Example: For meetings (1pm-4pm), (3pm-5pm), (4pm-6pm), 2 rooms are required.

    • Ensure linear time complexity by optimizing the room allocation process.

  • Answered by AI
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

Tracxn Interview FAQs

How many rounds are there in Tracxn Data Entry jobs interview?
Tracxn interview process usually has 2 rounds. The most common rounds in the Tracxn interview process are Resume Shortlist and Coding Test.

Tell us how to improve this page.

Interview Questions from Similar Companies

Swiggy Interview Questions
3.7
 • 474 Interviews
Meesho Interview Questions
3.7
 • 368 Interviews
Udaan Interview Questions
3.9
 • 347 Interviews
BlackBuck Interview Questions
3.7
 • 194 Interviews
Tata 1mg Interview Questions
3.6
 • 186 Interviews
Digit Insurance Interview Questions
3.8
 • 158 Interviews
Paisabazaar.com Interview Questions
3.4
 • 154 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

Tracxn Data Entry jobs Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Information Executive
140 salaries
unlock blur

₹2 L/yr - ₹3.6 L/yr

Research Analyst
127 salaries
unlock blur

₹2 L/yr - ₹6 L/yr

Senior Business Development Manager
88 salaries
unlock blur

₹4.5 L/yr - ₹9.5 L/yr

Business Development Manager
86 salaries
unlock blur

₹3.7 L/yr - ₹8 L/yr

Associate Vice President
76 salaries
unlock blur

₹13.2 L/yr - ₹22 L/yr

Explore more salaries
Compare Tracxn with

Udaan

3.9
Compare

Swiggy

3.7
Compare

BlackBuck

3.7
Compare

Ninjacart

3.9
Compare
write
Share an Interview