AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Filter interviews by
TradeIndia (Infocom Network Private Limited) Sales Team Leader Interview Questions and Answers
TradeIndia (Infocom Network Private Limited) Sales Team Leader Interview Experiences
1 interview found
Anonymous
Selected
I applied via Walk-in and was interviewed in Aug 2024. There were 3 interview rounds.
(2 Questions)
- Q1. Discussed abot exp
- Q2. Reson for change
(2 Questions)
- Q1. About your self and work exp
- Q2. Reason for gange
- Ans.
The reason for change could be due to evolving market trends, new technologies, or the need for improved efficiency.
Market trends may shift, requiring adjustments in sales strategies
New technologies may offer opportunities for increased productivity
Improving efficiency can lead to better results and higher sales performance
(1 Question)
- Q1. Strength and Weekness
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
I applied via Recruitment Consulltant and was interviewed before Dec 2021. There were 3 interview rounds.
(1 Question)
- Q1. Dipended of hr team & put on related questions of profile
(2 Questions)
- Q1. How to manage my team??
- Q2. How will be grouth my company??
Interview Preparation Tips
- Only sales
Selected
I appeared for an interview in May 2025, where I was asked the following questions.
- Q1. What is the GPS
- Ans.
GPS stands for Global Positioning System, a satellite-based navigation system for determining precise locations.
GPS uses a network of satellites orbiting Earth to provide location data.
It enables navigation for various applications, including driving, aviation, and marine.
GPS technology is used in smartphones for mapping and location services.
It can also be utilized in logistics for tracking shipments and fleet managem...
- Q2. What is the Fastrack
- Ans.
Fastrack is a brand known for trendy watches, accessories, and eyewear, targeting the youth market with stylish and affordable products.
Fastrack was launched in 1998 as a sub-brand of Titan Company Limited.
It focuses on the youth demographic, offering products that reflect contemporary trends.
The brand is known for its innovative marketing strategies, including collaborations with popular youth icons.
Fastrack's product...
- Q3. How to track the GPS
- Ans.
GPS tracking involves using satellite signals to determine the location of a device in real-time.
Use GPS-enabled devices like smartphones or dedicated GPS units to receive satellite signals.
Install GPS tracking software or apps that can log and display location data, such as Google Maps or dedicated fleet tracking solutions.
Utilize APIs like Google Maps API for integrating GPS tracking into applications.
Employ geofenci...
- Q4. What is the blackbuck
- Ans.
The blackbuck is a species of antelope native to the Indian subcontinent, known for its striking appearance and swift agility.
Scientific name: Antilope cervicapra.
Males have long, spiral horns that can reach up to 3 feet in length.
They are primarily found in grasslands and open forests.
Blackbucks are known for their incredible speed, reaching up to 50 km/h.
They are social animals, often seen in herds led by a dominant ...
(1 Question)
- Q1. About self nd Experience other company
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. Ask experience for sale
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
- Q1.
Rotate Matrix Right K Times
You are given a matrix
MATof size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma... - Ans.
Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.
Iterate 'K' times to perform right rotation on the matrix
Shift each column to the right by one position in each rotation
Handle wrapping around the matrix when shifting columns
Return the matrix elements row-wise after 'K' rotations
- Q2.
Word Search Problem Statement
Given a two-dimensional grid of size
N x Mconsisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.The 'WORD' can b...
- Ans.
Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.
Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.
Use recursion to explore all possible paths from a starting cell to form the word.
Keep track of visited cells to avoid revisiting the same cell in the same path.
Return the count of how man...
(3 Questions)
Round duration - 75 minutes
Round difficulty - Medium
Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.
- Q1.
Problem Statement: Largest Island
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...
- Ans.
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the...
- Q2.
Pythagorean Triplet Problem
Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.
Expl...
- Ans.
Check if there exists a Pythagorean triplet in a given array of integers.
Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number.
- Q3.
Top View of Binary Tree Problem Statement
Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...
- Ans.
Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.
Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.
Return the values of the topmost nodes in the map as the top view of the Binary Tree.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.
- Q1.
Fixing a Swapped Binary Search Tree
Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.
Input:
The first... - Ans.
Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.
Identify the two nodes that are swapped by mistake in the BST.
Swap the values of the two identified nodes to restore the BST.
Perform an in-order traversal of the BST to verify the correct restoration.
Ensure no extra space other than the recursion stack is used for the solution.
- Q2.
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named
Stackwhich supports the following operations, each in O(1... - Ans.
Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.
Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.
Use a Singly Linked List to store the elements of the stack.
Ensure that each operation runs in constant time O(1).
Handle edge cases like empty stack appropriately.
Test the implementation with sample queri...
Interview Preparation Tips
Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.
Tip 1 : Try not to mention those things about which you are not comfortable.
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.
Skills evaluated in this interview
TradeIndia (Infocom Network Private Limited) HR Interview Questions
I appeared for an interview before Sep 2020.
(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.
- 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.
(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 ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Interview Preparation Tips
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Skills evaluated in this interview
Interview Questionnaire
10 Questions
- Q1. What do you do when your schedule is interrupted? How you handle it?
- Ans.
I prioritize tasks, communicate effectively, and adapt my plans to manage interruptions while maintaining productivity.
Assess the interruption: Determine its urgency and importance. For example, if a team member needs immediate help, I prioritize that.
Reorganize my tasks: I create a new plan that accommodates the interruption while ensuring critical deadlines are met.
Communicate with stakeholders: I inform my team or m...
- Q2. PreOrder traversal without recursion?
- Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
- Ans.
Yes
Create an empty binary search tree (BST)
Loop over the unsorted array
For each element, insert it into the BST using the appropriate insertion logic
Repeat until all elements are inserted
The resulting BST will be built from the unsorted array
- Q4. Find 2 elements in array whose sum is equal to given number?
- Ans.
The question asks to find two elements in an array whose sum is equal to a given number.
Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.
Use a hash set to store the elements as you iterate through the array for efficient lookup.
Return the pair of elements if found, otherwise return a message indicating no such pair exists.
- Q5. How many types of trigger?
- Ans.
There are two types of triggers: DML triggers and DDL triggers.
DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.
DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.
Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt...
- Q6. Can trigger be used with select statement?
- Ans.
Yes, triggers can be used with select statements in SQL.
Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.
While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.
Using triggers with select statements allows you to perform additional actions or validations before or af...
- Q7. Indexing in mysql? How many types of indexing in mysql?
- Ans.
Indexing in MySQL improves query performance. There are several types of indexing in MySQL.
Indexes are used to quickly locate data without scanning the entire table.
Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.
B-tree indexes are the most common and suitable for most use cases.
Hash indexes are used for exact match lookups.
Full-text indexes are used for searching text-based data efficie...
- Q8. Engines in mysql?
- Ans.
Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.
MySQL supports multiple storage engines, each with its own strengths and features.
Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.
InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.
MyISAM is known for its simplicity and speed but lacks transaction suppo...
- Q9. Singlton pattern?
- Ans.
The Singleton pattern ensures a class has only one instance and provides a global point of access to it.
Restricts instantiation of a class to a single object.
Useful for managing shared resources, like database connections.
Implemented using private constructors and static methods.
Example in Java: public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if...
- Q10. Can a constructor be private?
- Ans.
Yes, a constructor can be private.
A private constructor can only be accessed within the class itself.
It is often used in singleton design pattern to restrict object creation.
Private constructors are also useful for utility classes that only contain static methods.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.
- Q1.
Longest Common Subsequence Problem Statement
Given two strings
STR1andSTR2, determine the length of their longest common subsequence.A subsequence is a sequence that can be derived from another sequen...
- Ans.
The task is to find the length of the longest common subsequence between two given strings.
Implement a function to find the longest common subsequence between two strings.
Use dynamic programming to solve this problem efficiently.
Iterate through the strings and build a matrix to store the lengths of common subsequences.
Return the length of the longest common subsequence found.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper.
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.
- Q1.
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
- Ans.
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Create a new linked list to store the sum, updating the value and carry as needed
Handle cases where one linked list is longer than the other by adding remaining digits with carry
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.
- Q1.
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
- Ans.
BFS traversal in a disconnected graph starting from vertex 0.
Use a queue to keep track of nodes to visit next in BFS traversal
Start traversal from vertex 0 and explore its neighbors first
Continue exploring neighbors level by level until all nodes are visited
Ensure to print connected nodes in numerical sort order
- Q2.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
DFS traversal to find connected components in an undirected and disconnected graph.
Perform DFS traversal on each vertex to find connected components
Maintain a visited array to keep track of visited vertices
Print the vertices of each connected component in ascending order
- Q3.
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
- Ans.
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Update the distances of neighboring nodes based on the current node's distance and edge weight...
Interview Preparation Tips
Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Thommandru Vishnu
Interview Questionnaire
9 Questions
- Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
- Ans.
Print only the leaf nodes of a doubly linked tree.
Traverse the tree and check if a node has no children and both left and right pointers are null.
If yes, then it is a leaf node and print it.
If no, then continue traversing the tree.
Use recursion to traverse the tree in a depth-first manner.
- Q2. LRU page Replacement Algorithm for large data
- Ans.
LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.
LRU stands for Least Recently Used
It is a cache eviction algorithm
It is used to manage memory in operating systems
It works by keeping track of the pages that are used recently and the ones that are not
When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time ...
- Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
- Ans.
Reverse m nodes and leave n nodes in a linked list till the end.
Traverse the linked list till m nodes and reverse them
Traverse n nodes and continue reversing m nodes
Repeat the above step till the end of the linked list
Handle edge cases like m or n being greater than the length of the linked list
- Q4. Inorder Traversal of a tree
- Ans.
Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Repeat until all nodes have been visited
- Q5. Inorder Travesal of a tree without recursion(write the code)
- Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
- Ans.
Find the triplicate number in an array of duplicates.
Iterate through the array and keep track of the frequency of each number.
Return the number that appears three times.
If no number appears three times, return null.
- Q7. Explain all the serach algorithm you know with space and Time complexities
- Ans.
Explanation of search algorithms with their space and time complexities.
Linear Search - O(n) time complexity, O(1) space complexity
Binary Search - O(log n) time complexity, O(1) space complexity
Jump Search - O(√n) time complexity, O(1) space complexity
Interpolation Search - O(log log n) time complexity, O(1) space complexity
Exponential Search - O(log n) time complexity, O(1) space complexity
Fibonacci Search - O(log n) ...
- Q8. Given a situation and asks you which search algorithm suits the best in that situation
- Ans.
Choosing the right search algorithm depends on data structure, size, and specific requirements like speed or memory usage.
Binary Search: Efficient for sorted arrays, O(log n) time complexity. Example: Finding a number in a sorted list.
Linear Search: Simple and works on unsorted arrays, O(n) time complexity. Example: Searching for a name in an unsorted list.
Depth-First Search (DFS): Suitable for tree/graph traversal, ex...
- Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
- Ans.
Find the most repeated number in an array of length n with numbers 1-n.
Create a dictionary to store the count of each number in the array
Iterate through the array and update the count in the dictionary
Find the key with the highest count in the dictionary
Interview Preparation Tips
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist
Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7
Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules
Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)
General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE
Skills evaluated in this interview
TradeIndia (Infocom Network Private Limited) Interview FAQs
Tell us how to improve this page.
TradeIndia (Infocom Network Private Limited) Interviews By Designations
- TradeIndia (Infocom Network Private Limited) Relationship Manager Interview Questions
- TradeIndia (Infocom Network Private Limited) Assistant Manager Interview Questions
- TradeIndia (Infocom Network Private Limited) Software Developer Interview Questions
- TradeIndia (Infocom Network Private Limited) Branch Manager Interview Questions
- TradeIndia (Infocom Network Private Limited) Digital Marketing Consultant Interview Questions
- TradeIndia (Infocom Network Private Limited) Senior Sales Executive Interview Questions
- TradeIndia (Infocom Network Private Limited) Senior Business Development Executive Interview Questions
- TradeIndia (Infocom Network Private Limited) Accountant Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Interview Questions from Similar Companies
TradeIndia (Infocom Network Private Limited) Sales Team Leader Reviews and Ratings
based on 1 review
Rating in categories
|
Relationship Manager
432
salaries
|  ₹2.8 L/yr - ₹5.2 L/yr |
|
Assistant Manager
266
salaries
| ₹2.2 L/yr - ₹6 L/yr |
|
Senior Executive
187
salaries
| ₹2 L/yr - ₹4.2 L/yr |
|
Deputy Manager
111
salaries
| ₹3.8 L/yr - ₹6.6 L/yr |
|
Senior Territory Manager
103
salaries
| ₹4.1 L/yr - ₹8.5 L/yr |
Udaan
Swiggy
Oyo Rooms
Blinkit
- Home >
- Interviews >
- TradeIndia (Infocom Network Private Limited) Interview Questions
