Premium Employer

i

This company page is being actively managed by Info Edge Team. If you also belong to the team, you can get access from here

Info Edge Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Info Edge Associate Vice President Interview Questions and Answers

Updated 10 Oct 2023

Info Edge Associate Vice President Interview Experiences

1 interview found

Interview experience
5
Excellent
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 tips
Round 2 - Technical 

(1 Question)

  • Q1. Management related questions
Round 3 - HR 

(1 Question)

  • Q1. General discussion

Interview questions from similar companies

Software Engineer Interview Questions & Answers

Amazon user image Rajesh Paramanandam

posted on 24 Feb 2017

I was interviewed in Oct 2016.

Interview Preparation Tips

Round: Test
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40

Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..

Tips: Beware filling ur resume.. they will ask every stuff that you have in resume

Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project

College Name: Sri ganesh college of engineering and technology

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. Boundary traversal of a tree
  • Ans. 

    Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.

    • The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.

    • For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.

    • For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.

    • For the ri...

  • Answered by AI
  • Q2. Find the nearest greater value of a given value in a BST
  • Ans. 

    Find the nearest greater value of a given value in a Binary Search Tree (BST).

    • Start from the root node and compare the given value with the current node's value.

    • If the given value is less than the current node's value, move to the left subtree.

    • If the given value is greater than the current node's value, move to the right subtree.

    • Keep track of the closest greater value encountered while traversing the tree.

    • Return the cl

  • Answered by AI
  • Q3. There is an infinite stair case and there are n rounds. in i'th round we can jump i steps at one or discard them. it is given that k'th step is broken , find the max height we can reach with out stepping o...
  • Ans. 

    Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.

    • We can start by jumping the maximum number of steps in each round until we reach the broken step.

    • After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.

    • We can continue this pattern until we reach the maximum height we can reach wit

  • Answered by AI
  • Q4. Height h was given and form a binary tree of height h and start combining bottom nodes to form a cone like structure

Interview Preparation Tips

Round: Test
Experience: there were 20 MCQ which were on ds , networks and basic coding followed by 2 coding questions.
1) print all the distinct substrings of a given string in lexicographical order
2) find the max i-j value in the given array of 0's and 1's such that there are equal number of zeros and ones, where i is the starting index and j is the ending index of the array.
Tips: make sure that you pass atleast half the test cases for both the question.
Duration: 90 minutes
Total Questions: 22

Round: Technical Interview
Experience: 1) i printed left view then leaves and right view using three level order traversals . he asked me to use one traversal only, then i told him the approach and wrote the working code.
2) told him the approach and coded it.
Tips: look at corner cases properly. the interviewers were friendly, so i felt relaxed.

Round: Technical Interview
Experience: 1) i told him a recursive O(2^n) solution, optimised it to O(n^2). he told me to optimise further. Then i finally came up with O(n) solution after 5 min and he was satisfied . i coded it. he was satisfied finally :D .
2) came up with the approach immediately and coded it. he was satisfied.
Tips: he was very particular about corner cases and he checked the code througly tested it on some cases to ensure it was working.

General Tips: be cool. interviewers were friendly. tell them what you are thinking and be clear with the question before answering to avoid wasteage of time.
Skill Tips: solve problems from codechef, spoj and codeforces. solve interview questions from geeksforgeeks and careercup.
Skills: the way you think, coding skills and knowledge on data structures.
Duration: 3
College Name: IIT Roorkee
Motivation: some good seniors got intern, so i was inspired.
Funny Moments: on the interview day a person came into the conference room to call me for interview, i didnt thought he was interviewer. he was very simple, but intelligent and at last i felt like asking him to ask me one more coding question as it was fun solving questions infront of him, but i didnt do that as i was frightened if i would not be able to answer it would be a negative remark :P .

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Data struct,algo,
  • Q2. High level data structs and algos

Interview Preparation Tips

Round: Problem Statement
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE

Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach

Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos

Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos

Interview Preparation Tips

Round: Test
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25

Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3

Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.

I was interviewed before May 2016.

Interview Questionnaire 

4 Questions

  • Q1. Tell us about yourself
  • Ans. 

    I am a passionate software engineer with experience in developing web applications and a strong background in computer science.

    • Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React

    • Strong background in computer science with knowledge of data structures and algorithms

    • Proficient in programming languages such as Java, Python, and C++

    • Familiar with Agile development methodolog

  • Answered by AI
  • Q2. Why Flipkart
  • Ans. 

    Flipkart is a leading e-commerce platform in India with a strong focus on technology and innovation.

    • Flipkart offers a challenging and dynamic work environment for software engineers.

    • The company has a strong reputation for investing in technology and innovation.

    • Flipkart has a large user base and offers opportunities to work on a variety of projects.

    • The company has a strong focus on customer satisfaction and user experie...

  • Answered by AI
  • Q3. Are you comfortable to reallocate
  • Ans. 

    Yes, I am comfortable with reallocating as needed.

    • I am flexible and adaptable to changing circumstances.

    • I have experience working in dynamic environments where priorities can shift.

    • I am willing to take on new challenges and responsibilities as required.

  • Answered by AI
  • Q4. Why should we hire you
  • Ans. 

    I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software.

    • Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and C++

    • Strong problem-solving skills demonstrated through successful completion of complex projects

    • Proven track record of delivering high-quality software on time a...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 2 problem statements to be coded using any language
Tips: Focussed on string manipulations and enormous data size handling
Duration: 1 hour 30 minutes
Total Questions: 2

Skills: C/C++
College Name: Guru Premsukh Memorial College of Engineering

Interview Questionnaire 

13 Questions

  • Q1. Given a string of parenthesis, write a function if it is balanced
  • Ans. 

    Function to check if a string of parenthesis is balanced

    • Use a stack to keep track of opening parenthesis

    • If a closing parenthesis is encountered, pop from stack and check if it matches

    • If stack is empty and a closing parenthesis is encountered, return False

    • If all parenthesis are matched and stack is empty, return True

  • Answered by AI
  • Q2. Given two linked lists each of which represent a number, write a function that returns a linked list that represents the sum
  • Q3. Find the number of occurrences of words in a paragraph
  • Ans. 

    Count the occurrences of words in a paragraph.

    • Split the paragraph into words using whitespace as a delimiter.

    • Create a dictionary to store the count of each word.

    • Iterate through the words and increment the count in the dictionary.

    • Return the dictionary with the word counts.

  • Answered by AI
  • Q4. Find common elements out of two sorted array?
  • Ans. 

    Find common elements out of two sorted array

    • Use two pointers to traverse both arrays simultaneously

    • Compare elements at each pointer and move the pointer of the smaller element

    • If elements are equal, add to common elements list and move both pointers

    • Stop when either pointer reaches end of array

  • Answered by AI
  • Q5. Convert BST to a Doubly linked list?
  • Ans. 

    Convert a Binary Search Tree to a Doubly Linked List.

    • Create a DLL node class with left, right, and data fields.

    • Traverse the BST in-order and add each node to the DLL.

    • Adjust the left and right pointers of each node to create the DLL.

    • Return the head of the DLL.

  • Answered by AI
  • Q6. Given a binary tree in which the node structure has an additional field called “next” which of pointer to tree node type, fill up this field of each node to point to the next node at the same level (NULL i...
  • Ans. 

    The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.

    • Use a level order traversal to process the tree nodes.

    • Maintain a queue to store the nodes at each level.

    • For each node, set its 'next' field to the next node in the queue.

    • If a node is the last node at its level, set its 'next' field to NULL.

  • Answered by AI
  • Q7. Given a parentheses string, determine if it is a valid / legitimate parentheses string. For strings consisting of single parentheses type and those consisting of multiple types
  • Q8. You have a dictionary of words. Given a word, print all anagram are in dictionary . State the data structure to be used to solve this problem
  • Ans. 

    To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.

    • Create a hash table to store the anagrams

    • Iterate through each word in the dictionary

    • Sort the characters of the word and use it as a key in the hash table

    • If the key already exists, add the word to the list of values for that key

    • Print the list of values for the

  • Answered by AI
  • Q9. You have given 10 files and you have given a string suggest data structure which ll facilitate efficient search of string in the file if string appears more than ones in that case u have to print line numb...
  • Ans. 

    Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.

    • Use a hash table to store the file name and line number of each occurrence of the string.

    • Iterate through each file and for each line, check if the string is present and update the hash table accordingly.

    • Print the hash table entries for the string.

  • Answered by AI
  • Q10. Write a program to print a tree in vertical order asked more than one approach to do this problem and modified problem many times
  • Q11. Discussion on my current work, difficulties and challenges faced at work, difficult people I have had to work with, instances when I went out of my way to propose creative solutions to existing problems a...
  • Q12. Why do you think amazon is the right place for you?
  • Ans. 

    Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.

    • Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.

    • The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.

    • Amazon offers numerous opportunities for growth and career advancement, allowing me to con...

  • Answered by AI
  • Q13. You have given an binary matrix which is sorted row wise and column wise write a program to search a row in the matrix having maximum number of zeroes

Interview Preparation Tips

General Tips: My process started off at one their hiring drives. It was ahiring drivein world trade center in Bangalore. It was a tiresome process that comprised a written round followed by 4rounds of interview.
Skills: Algorithm, data structure
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Data structures, thoroughly

I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. DS Algo Questions on Trees. Leadership Principles

Interview Preparation Tips

Interview preparation tips for other job seekers - Read up on DS Algo and white paper coding and Leadership Principles
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Aug 2022. There were 5 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 

There were 2 questions to test our basic coding knowledge.

Round 3 - One-on-one 

(1 Question)

  • Q1. Some basic introduction followed by sort 2 arrays into a single array.
Round 4 - One-on-one 

(1 Question)

  • Q1. Applications of various data structures.
  • Ans. 

    Data structures are used in various applications like search algorithms, storage systems, and graph algorithms.

    • Search algorithms like binary search use arrays and trees for efficient searching.

    • Storage systems use data structures like hash tables and linked lists for organizing and accessing data.

    • Graph algorithms like Dijkstra's algorithm use graphs and trees for solving complex problems.

  • Answered by AI
Round 5 - HR 

(1 Question)

  • Q1. Some basic hr questions like tell me about yourself, what do you know about magicbricks,where do you see yourself in 5 years etc

Skills evaluated in this interview

Info Edge Interview FAQs

How many rounds are there in Info Edge Associate Vice President interview?
Info Edge interview process usually has 3 rounds. The most common rounds in the Info Edge interview process are Resume Shortlist, Technical and HR.
How to prepare for Info Edge Associate Vice President 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 Info Edge. The most common topics and skills that interviewers at Info Edge expect are Customer Service, Client Onboarding, Employer Branding, Key Account Management and Service Delivery.
What are the top questions asked in Info Edge Associate Vice President interview?

Some of the top questions asked at the Info Edge Associate Vice President interview -

  1. Management related questi...read more
  2. General discuss...read more

Tell us how to improve this page.

Info Edge Associate Vice President Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Join Info Edge India’s first internet classifieds company.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
PolicyBazaar Interview Questions
3.6
 • 348 Interviews
JustDial Interview Questions
3.5
 • 328 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Lenskart Interview Questions
3.2
 • 304 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
View all
Info Edge Associate Vice President Salary
based on 34 salaries
₹20 L/yr - ₹63 L/yr
44% more than the average Associate Vice President Salary in India
View more details

Info Edge Associate Vice President Reviews and Ratings

based on 4 reviews

4.9/5

Rating in categories

4.2

Skill development

4.6

Work-life balance

4.3

Salary

4.6

Job security

4.4

Company culture

3.9

Promotions

4.5

Work satisfaction

Explore 4 Reviews and Ratings
Senior Executive
745 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Senior Executive
665 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
601 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
448 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
352 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Info Edge with

TCS

3.7
Compare

JustDial

3.5
Compare

Indiamart Intermesh

3.6
Compare

PolicyBazaar

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