Upload Button Icon Add office photos
Engaged Employer

i

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

Freecharge Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Freecharge Business Development Executive Interview Questions and Answers

Updated 1 Oct 2020

Freecharge Business Development Executive Interview Experiences

1 interview found

Interview Questionnaire 

4 Questions

  • Q1. Why do you want to join the " E-Commerce" Company?
  • Q2. What is your family background?
  • Q3. What is your salary exceptation?
  • Q4. When would you join when gets selected?

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Introduction abt yourself
  • Ans. 

    Experienced business development executive with a proven track record of driving revenue growth and building strong client relationships.

    • Over 5 years of experience in business development roles

    • Successfully increased sales by 30% in previous position

    • Skilled in identifying new business opportunities and negotiating contracts

    • Strong communication and interpersonal skills

    • Bachelor's degree in Business Administration

  • Answered by AI
  • Q2. Demo how to convince a customer to buy the product
  • Ans. 

    To convince a customer to buy the product, highlight the benefits, address their needs, provide social proof, and offer a special promotion.

    • Highlight the key benefits of the product that meet the customer's needs

    • Address any concerns or objections the customer may have

    • Provide social proof such as testimonials or case studies to build credibility

    • Offer a special promotion or discount to incentivize the purchase

  • Answered by AI
Round 2 - HR 

(1 Question)

  • Q1. Brief abt the company

Interview Preparation Tips

Round: Technical Interview
Experience: Finally, I got the offer from PayU. I was very Happy. Thanks AmbitionBox for helping me in my preparation

Skills: Algorithm, data structures
College Name: Na

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

  • Q1. 

    Zigzag Traversal of Binary Tree

    Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.

    Note:

    In zigzag order, level 1 is printed from left to right...
  • Ans. 

    Implement a function to print the zigzag traversal of a binary tree.

    • Traverse the tree level by level, alternating the direction of traversal for each level.

    • Use a queue to keep track of nodes at each level.

    • Print the nodes in zigzag order as per the given pattern.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
  • Ans. 

    DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.

    • Used DBMS to store and manage project data efficiently

    • Optimized queries for better performance

    • Designed database schema to handle data effectively

    • Resolved concurrency issues by implementing proper locking mechanisms

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPayU interview preparation:Topics to prepare for the interview - Array ,DP ,Graph ,Recursion, Tree ,Queue,BSTTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 1 good projects
Tip 2 : Practice Atleast 300 Questions
Tip 3 : Should be able to explain your project

Application resume tips for other job seekers

Tip 1 : Always be true with the resume
Tip 2 : Do not put false things on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Assignment 

Data Structures Algorithms

Round 2 - Coding Test 

Data Structures and Algorithm

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared for DSA

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 Minutes
Round difficulty - Medium

The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.

  • Q1. 

    Flip Equivalent Binary Tree Problem

    Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...

  • Ans. 

    The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.

    • Perform a depth-first search (DFS) on both trees simultaneously

    • At each node, check if the values are equal and the left and right subtrees are either both null or both not null

    • If the above conditions are met, recursively check the flip equivalence of the left and right subtrees

    • If any of the condition...

  • Answered by AI
  • Q2. 

    Split Array Into Increasing Subsequences Problem Statement

    You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if it is possible to split this array i...

  • Ans. 

    The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.

    • Check if the array can be split into increasing subsequences by iterating through the array.

    • Keep track of the current subsequence and its length while iterating.

    • If the difference between the current element and the previous element is not 1, start a new subsequence.

    • If the length of any subseque...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.

  • Q1. 

    Ninja and Alternating Largest Problem Statement

    Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.

    Example:

    Input:
    ...
  • Ans. 

    The task is to rearrange the given array such that every second element is greater than its left and right element.

    • Iterate through the array and check if every second element is greater than its left and right element

    • If not, swap the current element with its adjacent element to satisfy the condition

    • Continue this process until the entire array satisfies the condition

    • Return 1 if the array satisfies the condition, else re

  • Answered by AI
Round 3 - Video Call 

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Round 4 - HR 

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am

Interview Preparation Tips

Eligibility criteriaNo criteria But only 8+ plus CGPA were eventually shortlisted on basis of resumeAcko interview preparation:Topics to prepare for the interview - DSA, DBMS, Puzzles, OS, System DesignTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Never never try to cheat in online interview the interviewer will definitely get to know.
Tip 2 : Psuedo code presentation matters a lot so name Your variable properly and with proper indentation.
Tip 3 : Keep on trying even if You feel that's not the right answer so at least put that idea forward.
Tip 4 : Do Leetcode medium questions as much as possible As they are mostly asked in Interviews.

Application resume tips for other job seekers

Tip 1 : Avoid unnecessary details on Resume
Tip 2 : Make It look clean and also keep it of one page

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Jun 2023.

Round 1 - One-on-one 

(2 Questions)

  • Q1. DSA Round & Introduction Round
  • Q2. DP Question related to subsequence
Round 2 - Technical 

(2 Questions)

  • Q1. Design Parking Lot
  • Ans. 

    Design a parking lot system with multiple levels and spots for cars.

    • Create a class for ParkingLot with attributes like levels, spots per level, etc.

    • Implement methods for parking a car, removing a car, checking availability, etc.

    • Consider implementing a ticketing system for tracking parked cars.

    • Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.

  • Answered by AI
  • Q2. Sort Numbers with large file
  • Ans. 

    Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.

    • Break the large file into smaller chunks that can fit into memory

    • Sort each chunk individually using a sorting algorithm like merge sort

    • Merge the sorted chunks back together to get the final sorted result

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

  • Q1. 

    Sort 0 and 1 Problem Statement

    Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...

  • Ans. 

    Sort an array of 0s and 1s in linear time without using additional arrays.

    • Iterate through the array and maintain two pointers, one for 0s and one for 1s.

    • Swap elements at the two pointers based on the current element being 0 or 1.

    • Continue this process until the entire array is sorted in place.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

  • Q1. 

    Valid Perfect Square Check

    An integer N is provided, and the task is to determine if N is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.

    ...

  • Ans. 

    Implement a function to check if a given integer is a perfect square.

    • Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.

    • Iterate through possible square roots of the input integer and check if the square of the root equals the input.

    • Return true if a perfect square is found, false otherwise.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.

    Example:

    Input:
    ARR = [5, 3, 8,...
  • Ans. 

    Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.

    • Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.

    • Time complexity of Merge Sort is O(n log n) in the worst case scenario.

    • It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.

    • Ex...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...

  • Ans. 

    The task is to print the bottom view of a binary tree from left to right.

    • Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

    • Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.

    • After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

  • Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
  • Ans. 

    Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.

    • Adjust item sizes and spacing based on screen magnification level

    • Use nested RecyclerViews or custom layouts to display multiple lists

    • Implement custom item decorators to manage spacing between RecyclerViews

    • Consider using a GridLayoutManager with custom span sizes for each RecyclerView

  • Answered by AI
  • Q2. How would you implement various activities related to cart functionality in an e-commerce application?
  • Ans. 

    Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.

    • Create a data structure to store cart items, quantities, and prices.

    • Implement add to cart, remove from cart, and update quantity functionalities.

    • Handle discounts, promotions, and coupon codes.

    • Calculate total price, including taxes and shipping costs.

    • Implement c...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Interview Preparation Tips

Eligibility criteriaCGPA - 7 & above, Active backlogs - NoneMobiKwik interview preparation:Topics to prepare for the interview - Basic DSA, Arrays, String, Trees, Problem SolvingTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions

Application resume tips for other job seekers

Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Jan 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

The first round was an assessment round comprised of MCQ questions of DSA, RDBMS, MySQL questions and 2 coding questions to be written in java only

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) to explore all possible paths from the source cell to the destination cell.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse through the matrix.

    • Return the shortest path length found or -1 if no valid path exists.

  • Answered by AI
  • Q2. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in an array of distinct integers.

    • Sort the array and return the element at index K-1.

    • Use a min-heap to find the K-th smallest element efficiently.

    • Implement quickselect algorithm for optimal performance.

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The basic data structure round duration 1 hour, in this Interviewer, was very friendly and asked some casual questions. After that, he asked me to code.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array of integers.

    • Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

    • At each index, decide whether to include the current element in the subarray or start a new subarray.

    • Update the maximum sum if a new maximum is found.

    • Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

    • Example: For array [-5, -1, -8, -9]

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

Advance data structure round duration 1 hour, in this Interviewer asked some basic questions on oops, puzzles and asked me to code them later.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI
  • Q2. 

    Trapping Rain Water

    You are provided with an array ARR of integers representing an elevation map, where ARR[i] denotes the elevation of the ith bar. Determine the maximum amount of rainwater that can be t...

  • Ans. 

    Given an array representing an elevation map, find the maximum amount of rainwater that can be trapped between the bars.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the trapped water by finding the minimum of the maximum heights on the left and right minus the current bar height.

    • Sum up the trapped water for all bars to get the total trapped rainwater.

    • Example: Fo...

  • Answered by AI
Round 4 - Telephonic Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

Vice President interview round duration 30mins, in this round VP’s of different domains taking interview to the selected candidates.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

    • Keep track of the maximum profit that can be obtained by performing two transactions.

    • Consider all possible combinations of buying and selling stocks to maxim...

  • Answered by AI
Round 5 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

This round lasted for 30mins basic HR questions were asked

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPAMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, OOPS, System Design, Algorithms, Dynamic Programming, Operating systems, DevelopmentTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare DSA well.
Tip 2 : Always remember and go through your all projects.
Tip 3 : Practice as many DSA questions as you can.

Application resume tips for other job seekers

Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Mar 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.

    Input:

    The first...
  • Ans. 

    Find the length of the longest substring with at most K distinct characters in a given string.

    • Use a sliding window approach to keep track of the characters and their counts within the window.

    • Maintain a hashmap to store the characters and their frequencies.

    • Update the window size and characters count as you iterate through the string.

    • Return the maximum window size encountered for each test case.

  • Answered by AI
  • Q2. 

    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. 

    Find the number with the maximum frequency in an array of integers.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Find the number with the maximum frequency and return it.

    • If multiple elements have the same maximum frequency, return the one that appears first.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...

  • Ans. 

    Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.

    • Check if the x-coordinate is even or odd by using bitwise AND operation with 1.

    • Return 1 if x-coordinate is even, else return 0.

    • Handle multiple test cases by iterating through each input.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I was asked a coding question then, a system design question and some basic operating systems and oops questions

  • Q1. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store seen elements.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.

    • Develop a web crawler to discover and retrieve web pages.

    • Implement an indexing system to store and organize the content of web pages.

    • Design a ranking algorithm to determine the relevance of search results.

    • Include features like autocomplete, spell check, and personalized search results.

    • Optimize for speed and scalabil...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

HighRadius Interview Questions
2.9
 • 185 Interviews
Razorpay Interview Questions
3.6
 • 154 Interviews
Rupeek Interview Questions
3.7
 • 61 Interviews
PayU Payments Interview Questions
3.5
 • 54 Interviews
BankBazaar Interview Questions
3.4
 • 52 Interviews
ACKO Interview Questions
3.7
 • 49 Interviews
Mobikwik Interview Questions
3.6
 • 48 Interviews
Jupiter Money Interview Questions
3.3
 • 30 Interviews
View all
Freecharge Business Development Executive Salary
based on 4 salaries
₹3.2 L/yr - ₹4.5 L/yr
7% less than the average Business Development Executive Salary in India
View more details

Freecharge Business Development Executive Reviews and Ratings

based on 2 reviews

4.6/5

Rating in categories

3.6

Skill development

2.6

Work-life balance

4.2

Salary

3.4

Job security

3.0

Company culture

4.2

Promotions

4.0

Work satisfaction

Explore 2 Reviews and Ratings
Software Development Engineer
127 salaries
unlock blur

₹4.7 L/yr - ₹18.2 L/yr

Lead Software Engineer
76 salaries
unlock blur

₹14.8 L/yr - ₹35 L/yr

Senior Software Engineer
66 salaries
unlock blur

₹11.5 L/yr - ₹26 L/yr

Software Developer
63 salaries
unlock blur

₹6.2 L/yr - ₹15.2 L/yr

Associate Product Manager
56 salaries
unlock blur

₹10 L/yr - ₹22.6 L/yr

Explore more salaries
Compare Freecharge with

Paytm

3.3
Compare

Mobikwik

3.6
Compare

HighRadius

2.8
Compare

AGS Transact Technologies

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