Filter interviews by
I applied via Recruitment Consultant and was interviewed in Dec 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in May 2022. There was 1 interview round.
I am a highly motivated and experienced professional with a strong background in the field.
I have a Bachelor's degree in Business Administration
I have over 5 years of experience in sales and marketing
I am skilled in developing and implementing effective strategies
I have a proven track record of exceeding sales targets
I am a team player and have excellent communication skills
The last movie I watched was 'Inception'.
The movie is directed by Christopher Nolan.
It is a science fiction action film.
The plot revolves around a thief who steals corporate secrets through dream-sharing technology.
The film stars Leonardo DiCaprio, Joseph Gordon-Levitt, and Ellen Page.
It received critical acclaim for its unique concept and visual effects.
I applied via Campus Placement and was interviewed before Apr 2022. There were 2 interview rounds.
Retargeting is a marketing strategy that targets users who have previously interacted with a brand or website.
Retargeting uses cookies to track user behavior and display targeted ads to them.
It helps to increase brand awareness and conversions by reminding users of products or services they showed interest in.
Retargeting can be done on various platforms such as social media, search engines, and display networks.
Example...
The ability to reach and engage with a large audience in real-time through various digital channels.
The constantly evolving nature of digital marketing keeps me on my toes and allows for continuous learning and growth.
The data-driven approach in digital marketing enables precise targeting and measurement of campaign effectiveness.
The creativity involved in crafting compelling content and campaigns to capture audience a...
Targeting is the process of identifying and selecting a specific audience or group of individuals for a particular product or service.
Targeting involves analyzing data to determine the characteristics of the desired audience
It helps in creating personalized marketing messages and campaigns
Examples of targeting include demographic targeting, geographic targeting, and behavioral targeting
Targeting can also be used in adv...
Retargeting is when ads follow you after visiting a website or searching for a product.
After searching for a product on Amazon, ads for that product appear on other websites
Ads for a hotel you looked at on Booking.com follow you on social media
After browsing a clothing website, ads for that brand appear on your Instagram feed
SEO stands for Search Engine Optimization. It is the process of optimizing a website to rank higher in search engine results pages.
SEO involves optimizing website content, structure, and HTML code
Keyword research and analysis is a crucial part of SEO
Link building and social media marketing can also improve SEO
Search engines use complex algorithms to determine website rankings
SEO is an ongoing process that requires cons
I applied via Campus Placement and was interviewed before Sep 2022. There were 3 interview rounds.
posted on 10 Mar 2024
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
posted on 19 Feb 2024
I applied via Campus Placement and was interviewed in Aug 2023. There were 4 interview rounds.
It will be around 3 hours and 2 questions of leetcode hard difficulty will be asked in the interview and 1 question is of codeforces 2400+ difficulty question.
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
Understand the problem statement and expected output
Review the code for syntax errors, logical errors, and potential bugs
Use debugging tools like breakpoints, print statements, and IDE debuggers
Test the code with different inputs and edge cases to identify the bug
Make necessary corrections and re
Given a Binary Tree of distinct integers and two integers, target
and K
, return a list of values of all nodes located at a distance K
from the target no...
Find nodes at distance K from target node in a Binary Tree.
Use BFS to traverse the tree and keep track of the distance of each node from the target node.
Maintain a set to keep track of visited nodes to avoid revisiting them.
Return the values of nodes at distance K from the target node.
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input beg...
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Return the length of the longest subarray found.
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
posted on 27 Oct 2021
I appeared for an interview in Feb 2021.
Round duration - 90 Minutes
Round difficulty - Hard
The test was at 6 pm with cam on and in fullscreen mode.
You are given three strings 'A', 'B', and 'C'. Determine if 'C' is formed by interleaving 'A' and 'B'.
String 'C' is an interleaving of 'A' and 'B' if the lengt...
The problem involves determining if a string 'C' is formed by interleaving two given strings 'A' and 'B'.
Check if the length of 'C' is equal to the sum of the lengths of 'A' and 'B'.
Verify if all characters of 'A' and 'B' exist in 'C' while maintaining their order.
Return 'True' if 'C' is an interleaving of 'A' and 'B', otherwise return 'False'.
Given two lists representing the inorder and postorder traversal of a binary tree of integer type with 'N' nodes, construct the binary tree and r...
Construct a binary tree from inorder and postorder traversal lists and return its root.
Create a map to store the indices of elements in the inorder traversal list for quick access during tree construction.
Use the postorder list to determine the root of the tree and recursively build left and right subtrees.
Construct the tree by recursively dividing the inorder list based on the root index in postorder list.
Return the r...
Round duration - 45 Minutes
Round difficulty - Easy
At 10:00 AM. Interviewer was very friendly and young but his cam was off.
Kevin has sketched a series of integers, forming a diagram that represents a binary tree. Challenged by a friend, Kevin needs to find all paths from the root to the leaf where th...
Round duration - 45 Minutes
Round difficulty - Easy
It was held at 4 p.m. The interviewer was senior compared to the one in the previous round. Also, his cam was also on, but he wasn't speaking much and neither giving any expressions.
Given a set of boxes represented by an array gainPower
, where each box has a certain power value, along with an initial power value 'power', your task is to maximize the t...
Maximize total score by selecting boxes optimally based on power values and operations.
Iterate through the boxes and perform operations based on power values and current score
Keep track of power, score, and selected boxes to maximize total score
Example: For input [3, 50, [20, 30, 40]], select boxes with power 20 and 30 to get a score of 2
Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.
Tip 1 : Keep it crisp and to the point. Make bullet points.
Tip 2 : Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3 : Only put the things you are confident about.
Tip 4 : Don't put things irrelevant to the job, it only dilutes the main content.
posted on 28 Aug 2023
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Held on interview bit. 3 ques were asked. Questions were from range query and DP.
Associate Manager
238
salaries
| ₹6 L/yr - ₹16 L/yr |
Business Manager
149
salaries
| ₹6.8 L/yr - ₹18 L/yr |
Senior Associate
137
salaries
| ₹7.8 L/yr - ₹26 L/yr |
Analyst
117
salaries
| ₹3 L/yr - ₹8.2 L/yr |
Associate
110
salaries
| ₹3.2 L/yr - ₹12.3 L/yr |
R.R. Donnelley
Epsilon
Smollan Group
ChannelPlay