Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by TradeIndia (Infocom Network Private Limited) Team. If you also belong to the team, you can get access from here

Filter interviews by

TradeIndia (Infocom Network Private Limited) Content Writer Interview Questions, Process, and Tips

Updated 24 May 2024

TradeIndia (Infocom Network Private Limited) Content Writer Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Apr 2024. There were 4 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. Tell me about yourself?
  • Q2. What do you know about the company?
Round 2 - One-on-one 

(2 Questions)

  • Q1. Difference between article and blog?
  • Q2. What is seo and which tools you use?
  • Ans. 

    SEO stands for Search Engine Optimization, which is the practice of increasing the quantity and quality of traffic to your website through organic search engine results.

    • SEO involves optimizing your website content, meta tags, and backlinks to improve its visibility on search engines like Google.

    • Some commonly used SEO tools include Google Analytics, SEMrush, Ahrefs, Moz, and Screaming Frog.

    • Keyword research, on-page opti...

  • Answered by AI
Round 3 - Assignment 

An article writing round of 1000 words

Round 4 - One-on-one 

(4 Questions)

  • Q1. What is seo, it's full form?
  • Ans. 

    SEO stands for Search Engine Optimization. It is the process of optimizing a website to improve its visibility on search engines.

    • SEO helps websites rank higher on search engine results pages (SERPs)

    • It involves optimizing content, meta tags, and backlinks

    • Keywords play a crucial role in SEO

    • Examples: Google, Bing, Yahoo

  • Answered by AI
  • Q2. What is keywords?
  • Ans. 

    Keywords are specific words or phrases that describe the content of a webpage and help search engines understand the topic of the page.

    • Keywords are used in SEO to improve a website's search engine ranking.

    • They should be relevant to the content on the page and used naturally.

    • Examples of keywords include 'content writer', 'SEO tips', 'digital marketing'.

  • Answered by AI
  • Q3. What is keyword prominence?
  • Ans. 

    Keyword prominence refers to the importance or visibility of a keyword within a piece of content.

    • Keyword prominence is the frequency and placement of a keyword within a text.

    • It helps search engines understand the relevance of the content to the keyword.

    • For example, if a keyword appears in the title, headings, and first paragraph of a blog post, it has high prominence.

    • Optimizing keyword prominence can improve SEO and he

  • Answered by AI
  • Q4. What is keyword frequency?
  • Ans. 

    Keyword frequency refers to the number of times a specific keyword appears in a piece of content.

    • Keyword frequency is important for SEO as search engines use it to determine the relevance of a webpage to a user's search query.

    • It is recommended to use keywords naturally and not stuff them excessively in content.

    • Tools like Google Analytics can help track keyword frequency and performance.

    • For example, if the keyword 'cont...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Please don't go for an interview here. The HR never call you back. I have constantly contact her to know about the status and she took one week after each round. Very rude hr behaviour

Skills evaluated in this interview

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Nov 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 - HR 

(2 Questions)

  • Q1. Tell me about yourself?
  • Q2. Why content writing?
Round 3 - Assignment 

To write sample content for products.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident.
Speak truth.
Write well during test
Smile.
Round 1 - Assignment 

Design features and types of apparel product styles

Round 2 - Technical 

(1 Question)

  • Q1. Related to fashion industry and current affair related to fashion

Interview Preparation Tips

Interview preparation tips for other job seekers - Be bold and confident while answering the questions
Round 1 - Assignment 

Rated to apparels

Round 2 - Technical 

(1 Question)

  • Q1. Current affairs related to fashion

Interview Preparation Tips

Interview preparation tips for other job seekers - Be bold and confident while answering the questions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Oct 2023. 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 - Aptitude Test 

Aptitude test is very nice 🙂

Round 3 - One-on-one 

(3 Questions)

  • Q1. One on one round
  • Q2. What is content writer?
  • Ans. 

    A content writer is a professional who creates written content for websites, blogs, social media, and other digital platforms.

    • Researching and writing engaging content for various platforms

    • Optimizing content for SEO to improve visibility

    • Collaborating with designers and marketers to create cohesive messaging

    • Editing and proofreading content for accuracy and consistency

  • Answered by AI
  • Q3. What is content for a writer?

Interview Preparation Tips

Interview preparation tips for other job seekers - Please research on all questions and all the best

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.

  • Q1. 

    Rabbit Jumping Problem

    Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...

  • Ans. 

    Calculate uneaten carrots by rabbits with specific jumping factors.

    • Iterate through each carrot and check if any rabbit jumps on it.

    • Use the jumping factors to determine which carrots are eaten.

    • Subtract the eaten carrots from the total to get the uneaten count.

  • Answered by AI
  • Q2. 

    Flip Bits Problem Explanation

    Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...

  • Ans. 

    Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.

    • Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

    • Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.

    • Update the maximum count of 1s if the current count after flipping is greater.

    • Return the maximum count of 1s obtained by flipping a sub-array

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting

  • Q1. 

    Sum of Maximum and Minimum Elements Problem Statement

    Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.

    Follow Up:

    Can you achie...

  • Ans. 

    Find sum of maximum and minimum elements in an array with least number of comparisons.

    • Iterate through the array and compare each element with current maximum and minimum to update them.

    • Initialize max as smallest possible value and min as largest possible value.

    • Return the sum of max and min after iterating through the array.

  • Answered by AI
  • Q2. 

    Invert a Binary Tree Problem Statement

    Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:

    • The given leaf node becomes the root after the inversion. • F...
  • Ans. 

    Invert a binary tree based on a given leaf node as the root.

    • Start by finding the leaf node in the binary tree.

    • Move the left child of the leaf node to the right side of the leaf node.

    • Make the parent of the leaf node the left child of the leaf node.

    • Repeat the process for each test case.

    • Return the inverted binary tree in level order format.

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Questions based on programming, DBMS and puzzles were asked in this round.

  • Q1. 

    Rearrange Array to Form Largest Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

    ...

  • Ans. 

    Rearrange the array elements to form the largest possible number by concatenating them.

    • Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.

    • Use a custom comparator function while sorting the array elements.

    • Convert the sorted array elements to a single string to get the largest possible number.

  • Answered by AI
  • Q2. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

    • They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.

    • Examples of indexes include ...

  • Answered by AI
  • Q3. What are the advantages of B+ Trees in database management systems?
  • Ans. 

    B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.

    • B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.

    • B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).

    • B+ Trees are optimized ...

  • Answered by AI
Round 4 - Video Call 

Round duration - 45 minutes
Round difficulty - Medium

Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .

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 interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Myntra user image 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • 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

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

Interview Questionnaire 

12 Questions

  • Q1. What is the difference between get and post?
  • Ans. 

    GET is used to retrieve data from a server, while POST is used to send data to a server.

    • GET requests are idempotent, meaning they can be repeated without changing the result

    • POST requests are not idempotent and can have side effects on the server

    • GET requests can be cached by the browser, while POST requests cannot

    • GET requests have limitations on the amount of data that can be sent, while POST requests have no limitation...

  • Answered by AI
  • Q2. What is session in php?
  • Ans. 

    Session in PHP is a way to store and retrieve data for a user across multiple requests.

    • Sessions are used to maintain user-specific data on the server side.

    • A session is created for each user and is identified by a unique session ID.

    • Session data can be stored in server files or in a database.

    • Session variables can be accessed and modified throughout the user's session.

    • Sessions can be used to implement features like user a

  • Answered by AI
  • Q3. Where does session id is stored in php? How server identifies request has come from which client and many other related questions?
  • Ans. 

    Session ID is stored in PHP as a cookie or a query parameter.

    • Session ID can be stored as a cookie in the client's browser.

    • Session ID can also be stored as a query parameter in the URL.

    • The server identifies the client by retrieving the session ID from the cookie or query parameter.

    • The session ID is then used to retrieve the corresponding session data stored on the server.

    • The server can also use other methods like IP add

  • Answered by AI
  • Q4. Cookie in php? Size of the cookie, expiry etc?
  • Ans. 

    A cookie in PHP is a small piece of data stored on the client's computer. It has a size limit and an expiry date.

    • A cookie is used to store information on the client's computer for future use.

    • In PHP, cookies are set using the setcookie() function.

    • The size of a cookie is limited to 4KB.

    • Cookies can have an expiry date, after which they are no longer valid.

    • The expiry date can be set using the 'expires' parameter in the set...

  • Answered by AI
  • Q5. Memcache?
  • Q6. Myisam and Innnodb?
  • Q7. Triggers in mysql?
  • Ans. 

    Triggers in MySQL are database objects that are automatically executed in response to specified events.

    • Triggers are used to enforce business rules, maintain data integrity, and automate tasks.

    • They can be defined to execute before or after an INSERT, UPDATE, or DELETE operation.

    • Triggers can be written in SQL or in a programming language like PL/SQL.

    • Examples of trigger events include inserting a new record, updating a re...

  • Answered by AI
  • Q8. Overriding and Overloading?
  • Q9. Static class and static variable?
  • Q10. Singleton pattern and factory pattern?
  • Q11. Can constructor be declared as private?
  • Ans. 

    Yes, a constructor can be declared as private.

    • Declaring a constructor as private restricts its accessibility to only the class itself.

    • This can be useful in scenarios where you want to control the creation of objects of that class.

    • Private constructors are commonly used in singleton design pattern implementations.

    • Example: private constructor in a singleton class:

    • class Singleton { private Singleton() {} }

  • Answered by AI
  • Q12. Indexing in mysql?
  • Ans. 

    Indexing in MySQL improves the performance of database queries by creating a data structure that allows for faster data retrieval.

    • Indexes are created on one or more columns of a table.

    • They help in speeding up the search, sorting, and joining of data.

    • Indexes can be created using the CREATE INDEX statement.

    • Common types of indexes include B-tree, hash, and full-text indexes.

    • Indexes should be used judiciously as they consu...

  • Answered by AI

Interview Preparation Tips

Skills: PHP, Algorithm
College Name: NA

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(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 STR1 and STR2, 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.

  • Answered by AI
Round 2 - Face to Face 

(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

  • Answered by AI
Round 3 - Face to Face 

(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

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is 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

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

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra 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 : 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.

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

Interview Questionnaire 

10 Questions

  • Q1. Change Binary tree so that parent node is the sum of root nodes
  • Ans. 

    Change binary tree to make parent node the sum of root nodes

    • Traverse the tree in post-order

    • For each node, update its value to the sum of its children

    • Return the updated root node

  • Answered by AI
  • Q2. Reverse a linkedlist ?
  • Ans. 

    Reverse a linkedlist by changing the direction of pointers.

    • Iterate through the linkedlist and change the direction of pointers.

    • Keep track of previous, current and next nodes.

    • Set the next pointer of current node to previous node.

    • Move to next node and repeat until end of list is reached.

  • Answered by AI
  • Q3. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)
  • Ans. 

    Rearrange an array of positive and negative numbers with positive numbers on the left and negative numbers on the right.

    • Create two empty arrays, one for positive numbers and one for negative numbers

    • Loop through the original array and add positive numbers to the positive array and negative numbers to the negative array

    • Concatenate the positive and negative arrays to create the rearranged array

  • Answered by AI
  • Q4. Singleton pattern, observer pattern?
  • Q5. String pool and how garbage collection functionality works?
  • Ans. 

    String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.

    • String pool is a cache of string literals in memory

    • Strings are immutable and can be shared among multiple objects

    • Garbage collection removes unused objects to free up memory

    • String objects that are no longer referenced are eligible for garbage collection

  • Answered by AI
  • Q6. HashMap , how can you synchronize ?
  • Q7. Process vs Thread differences and synchronization,deadlock examples?
  • Ans. 

    Process vs Thread differences and synchronization, deadlock examples

    • Process is an instance of a program while thread is a subset of a process

    • Processes are independent while threads share the same memory space

    • Synchronization is used to coordinate access to shared resources

    • Deadlock occurs when two or more threads are blocked waiting for each other to release resources

    • Examples of synchronization include mutex, semaphore, ...

  • Answered by AI
  • Q8. Database: Design with one-one mapping, one-many mapping…some basic questions, I don’t remember all
  • Q9. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?
  • Q10. CTO round

Interview Preparation Tips

Round: HR Interview
Experience: This was CTO round, if you make this round…you are doing pretty good. 
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.

General Tips: Process:5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR
I got almost the same package that I am currently getting (Myntra gave stock options, which I don’t have in my current company) but I am looking for a change so accepted the offer.
Skills: Algorithm, data structure, database
College Name: na

Skills evaluated in this interview

TradeIndia (Infocom Network Private Limited) Interview FAQs

How many rounds are there in TradeIndia (Infocom Network Private Limited) Content Writer interview?
TradeIndia (Infocom Network Private Limited) interview process usually has 4 rounds. The most common rounds in the TradeIndia (Infocom Network Private Limited) interview process are One-on-one Round, HR and Assignment.
How to prepare for TradeIndia (Infocom Network Private Limited) Content Writer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at TradeIndia (Infocom Network Private Limited). The most common topics and skills that interviewers at TradeIndia (Infocom Network Private Limited) expect are Article Writing, Content Writing, SEO Writing, Blog Writing and Web Content Writing.
What are the top questions asked in TradeIndia (Infocom Network Private Limited) Content Writer interview?

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

  1. What is seo and which tools you u...read more
  2. What is seo, it's full fo...read more
  3. What is keyword prominen...read more

Tell us how to improve this page.

TradeIndia (Infocom Network Private Limited) Content Writer Interview Process

based on 1 interview

Interview experience

1
  
Bad
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
Myntra Interview Questions
4.0
 • 214 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
14% less than the average Content Writer Salary in India
View more details

TradeIndia (Infocom Network Private Limited) Content Writer Reviews and Ratings

based on 6 reviews

2.3/5

Rating in categories

2.3

Skill development

2.7

Work-life balance

2.5

Salary

2.2

Job security

2.4

Company culture

2.4

Promotions

2.1

Work satisfaction

Explore 6 Reviews and Ratings
Relationship Manager
420 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
276 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
176 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Territory Manager
142 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

District Manager
103 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare TradeIndia (Infocom Network Private Limited) with

Udaan

4.0
Compare

Swiggy

3.8
Compare

BlackBuck

3.8
Compare

Blinkit

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