4 TradeIndia (Infocom Network Private Limited) Deputy Manager Interview Questions & Answers | Complete Prep Guide 2025

TradeIndia (Infocom Network Private Limited) Deputy Manager Interview Experiences

1 interview found

Deputy Manager Interview Questions & Answers

SUDHANSHU KUMAR

posted on 22 Nov 2024

Interview experience

Average

Difficulty level

Moderate

Process Duration

More than 8 weeks

Result

Selected

I applied via LinkedIn and was interviewed before Nov 2023. There were 2 interview rounds.

Round 1 - One-on-one

(2 Questions)

Q1. District Manager

Add your answer

Q2. Baranch manager

Add your answer

Round 2 - One-on-one

(2 Questions)

Q1. What is the exp

Ans.

The experience and qualifications you have for the Deputy Manager position.

Discuss your relevant work experience in management roles
Highlight any specific skills or certifications that make you a strong candidate
Mention any successful projects or initiatives you have led in the past

Answered by AI

Add your answer

Q2. What is job responsibility

Add your answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Good

Top trending discussions

View All

Interview Tips & Stories

5d (edited)

timepasstiwari

A Digital Markter

Got Rejected In an Interview, Just Because I Didn’t Answer a Personal Question

So, I got invited for this interview, and they told me to be there at 9 AM. Of course, I get there early, like 8:30, because I don't want to be late. But then I end up waiting for 1.5 hours... read more

Got a question about TradeIndia (Infocom Network Private Limited)?

Ask anonymously on communities.

Interview questions from similar companies

Branch Manager Interview Questions & Answers

Digit Insurance

posted on 17 Apr 2022

I applied via Approached by Company and was interviewed before Apr 2021. 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 Resume tips

Round 2 - One-on-one

(3 Questions)

Q1. How to create market in competitive market for your own?

Ans.

Creating a market in a competitive market requires identifying unique selling points, targeting specific customer segments, and building a strong brand image.

Identify unique selling points that differentiate your product/service from competitors
Target specific customer segments that are underserved by competitors
Build a strong brand image through effective marketing and advertising
Offer competitive pricing and promotio...

Answered by AI

Add your answer

Q2. How to go to next level

Add your answer

Q3. Gow can u build brand easly?

Ans.

Building a brand requires consistent messaging, quality products/services, and positive customer experiences.

Develop a clear brand identity and message
Ensure all marketing materials align with brand identity
Provide high-quality products/services
Offer exceptional customer service
Encourage positive customer reviews and referrals

Answered by AI

Add your answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Take experience

Start where opportunities comes don't sit back and wait for bigger opportunities.
Make it big

I think it's very important for new joiner

Branch Manager Interview Questions & Answers

Digit Insurance

Anonymous

posted on 23 Oct 2023

Interview experience

Good

Difficulty level

Process Duration

Result

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 Resume tips

Round 2 - One-on-one

(2 Questions)

Q1. Location and Business LOB

Add your answer

Q2. Line of business volume

Ans.

Line of business volume refers to the amount of business activity within a specific line of products or services.

Line of business volume can be measured by the number of transactions, revenue generated, or units sold within a particular product or service category.
Analyzing trends in line of business volume can help identify areas of growth or decline within the business.
For example, a branch manager may track the volu...

Answered by AI

Add your answer

Round 3 - One-on-one

(2 Questions)

Q1. With Zonal Head

Add your answer

Q2. Job description

Add your answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Need to be very aggressive in business sour

Branch Manager Interview Questions & Answers

BlackBuck

Anonymous

posted on 4 Mar 2024

Interview experience

Poor

Difficulty level

Moderate

Process Duration

2-4 weeks

Result

Selected

I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - One-on-one

(1 Question)

Q1. General question not related to kra

Add your answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Think twice

Branch Manager Interview Questions & Answers

Udaan

Anonymous

posted on 30 Mar 2024

Interview experience

Excellent

Difficulty level

Process Duration

Result

Round 1 - One-on-one

(1 Question)

Q1. Tell me about yourself

Add your answer

Deputy Manager Interview Questions & Answers

Digit Insurance

Hussain Namakwala

posted on 24 Dec 2024

Interview experience

Excellent

Difficulty level

Process Duration

Result

Round 1 - One-on-one

(1 Question)

Q1. Regarding company visssion and mission

Add your answer

Deputy Manager Interview Questions & Answers

Blinkit

Anonymous

posted on 28 Jan 2025

Interview experience

Excellent

Difficulty level

Hard

Process Duration

Less than 2 weeks

Result

Selected

I was interviewed in Jul 2024.

Round 1 - HR

(1 Question)

Q1. Tell me About yourself

Add your answer

Deputy Manager Interview Questions & Answers

Blinkit

Anonymous

posted on 27 Feb 2025

Interview experience

Good

Difficulty level

Process Duration

Result

Round 1 - One-on-one

(5 Questions)

Q1. What is your experience

Ans.

I have 5 years of experience in marketing, including developing marketing strategies, managing campaigns, and analyzing market trends.

Developed and implemented marketing strategies to increase brand awareness
Managed digital marketing campaigns across various platforms
Analyzed market trends and consumer behavior to optimize marketing efforts
Collaborated with cross-functional teams to execute marketing initiatives

Answered by AI

Add your answer

Q2. Why are yoh leaving the previous organization

Ans.

Seeking new challenges and growth opportunities

Looking for a new challenge to further develop my skills and experience
Interested in taking on more responsibilities and advancing my career
Seeking a more supportive and collaborative work environment
Want to explore new industry or sector for personal growth
Previous organization lacked opportunities for career advancement

Answered by AI

Add your answer

Q3. Salary negotiations

Add your answer

Q4. Dress code & formal code

Add your answer

Q5. Joining date & relieving date

Add your answer

Software Developer Interview Questions & Answers

Myntra

Anonymous

posted on 27 Dec 2021

I was interviewed before Dec 2020.

Round 1 - Coding Test

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

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 did not know 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

Q1.

Binary Tree to Doubly Linked List

Transform a given Binary Tree into a Doubly Linked List.

Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

Input:

The fi...

Ans.

Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.

Answered by AI

Add your answer

Q2.

Unique Element in Array

Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

Ans.

Find the unique element in an array where every other element appears thrice.

Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.

Answered by AI

Add your answer

Round 2 - Video Call

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

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.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Q1.

Binary Tree Traversals Problem Statement

Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

Ans.

Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.

Answered by AI

Add your answer

Q2.

Delete N Nodes After M Nodes in a Linked List

Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...

Ans.

Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.

Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...

Answered by AI

Add your answer

Round 3 - Video Call

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked to put everything on the blackboard and write down the code of each and everything.

Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.

Q1.

Maximum Frequency Number Problem Statement

Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

If multip...

Ans.

Program to find the number with maximum frequency in an array of integers.

Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.

Answered by AI

Add your answer

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Myntra

Thommandru Vishnu

posted on 10 Mar 2015

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.

Answered by AI

Add your answer

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

Answered by AI

Add your answer

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

Answered by AI

Add your answer

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

Answered by AI

Add your answer

Q5. Inorder Travesal of a tree without recursion(write the code)

Ans.

Inorder traversal of a tree without recursion

Create an empty stack and initialize current node as root
Push the current node to stack and set current = current.left until current is NULL
If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right
Repeat step 2 and 3 until stack is empty

Answered by AI

Add your answer

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.

Answered by AI

Add your answer

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)

Answered by AI

Add your answer

Q8. Given a situation and asks you which search algorithm suits the best in that situation

Add your answer

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

Answered by AI

Add your answer

Interview Preparation Tips

Round: Resume Shortlist
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

How many rounds are there in TradeIndia (Infocom Network Private Limited) Deputy Manager interview?

TradeIndia (Infocom Network Private Limited) interview process usually has 2 rounds. The most common rounds in the TradeIndia (Infocom Network Private Limited) interview process are One-on-one Round.

What are the top questions asked in TradeIndia (Infocom Network Private Limited) Deputy Manager interview?

Some of the top questions asked at the TradeIndia (Infocom Network Private Limited) Deputy Manager interview -

What is the ...read more
District Mana...read more
Baranch mana...read more

Tell us how to improve this page.

TradeIndia (Infocom Network Private Limited) Interviews By Designations

Interview Questions for Popular Designations

TradeIndia (Infocom Network Private Limited) Deputy Manager Interview Process

based on 2 interviews

Interview experience

Good

BigBasket

We don't just offer jobs; we offer peace of mind.

Swiggy Interview Questions

3.8

• 428 Interviews

Udaan Interview Questions

3.9

• 334 Interviews

Meesho Interview Questions

3.7

• 328 Interviews

Myntra Interview Questions

4.0

• 215 Interviews

Blinkit Interview Questions

3.7

• 181 Interviews

BlackBuck Interview Questions

3.8

• 176 Interviews

Spinny Interview Questions

3.7

• 170 Interviews

FirstCry Interview Questions

3.6

• 169 Interviews

Tata 1mg Interview Questions

3.6

• 146 Interviews

Digit Insurance Interview Questions

4.0

• 142 Interviews

View all

Parul Institute of Management and Research, Vadodara Placement Questions

1 Interview

View all

TradeIndia (Infocom Network Private Limited) Deputy Manager Salary

based on 94 salaries

₹3.8 L/yr - ₹6.6 L/yr

50% less than the average Deputy Manager Salary in India

View more details

TradeIndia (Infocom Network Private Limited) Salaries in India

Relationship Manager 462 salaries	₹0 L/yr - ₹0 L/yr
Assistant Manager 275 salaries	₹0 L/yr - ₹0 L/yr
Senior Executive 176 salaries	₹0 L/yr - ₹0 L/yr
Senior Territory Manager 143 salaries	₹0 L/yr - ₹0 L/yr
District Manager 104 salaries	₹0 L/yr - ₹0 L/yr