Upload Button Icon Add office photos

Yahoo

Compare button icon Compare button icon Compare

Filter interviews by

Yahoo Senior Marketing Analyst Interview Questions and Answers

Updated 1 Mar 2024

Yahoo Senior Marketing Analyst Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. What is your background
Round 2 - One-on-one 

(2 Questions)

  • Q1. Past experience
  • Q2. How do you solve specific marketing problems
  • Ans. 

    I solve specific marketing problems by conducting thorough research, analyzing data, identifying key insights, and developing strategic solutions.

    • Conducting market research to understand target audience and competition

    • Analyzing data from various sources to identify trends and patterns

    • Developing marketing strategies based on insights and objectives

    • Testing and optimizing campaigns to achieve desired results

  • Answered by AI
Round 3 - Aptitude Test 

SQL, Data analytics of a dataset

Round 4 - One-on-one 

(1 Question)

  • Q1. Director on behavior

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Screening 

(1 Question)

  • Q1. Find the possible ways to get the target score
  • Ans. 

    There are multiple ways to achieve the target score in a game or competition.

    • Incrementing by 1 point each time until reaching the target score

    • Combining different point values to reach the target score

    • Using bonus points or multipliers to reach the target score

  • Answered by AI

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Hard

Online coding round , 2-3 questions. Level - med-hard

  • Q1. 

    Fibonacci Number Verification

    Identify if the provided integer 'N' is a Fibonacci number.

    A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...

  • Ans. 

    Check if a given number is a Fibonacci number or not.

    • Iterate through the Fibonacci sequence until you find a number greater than or equal to the given number.

    • Check if the given number matches the Fibonacci number found in the sequence.

    • If the given number matches, output 'YES'; otherwise, output 'NO'.

  • Answered by AI
  • Q2. 

    Break The Board Problem Statement

    Your task is to break a board of given dimensions 'L' by 'W' into 'L' * 'W' smaller squares, ensuring the total cost of breaking is minimized.

    Input:

    The first line con...
  • Ans. 

    Minimize cost of breaking a board into smaller squares by optimizing horizontal and vertical cuts.

    • Iterate through all possible horizontal and vertical cuts to find the minimum cost

    • Use dynamic programming to store and reuse subproblem solutions

    • Calculate the cost of breaking the board into smaller squares based on the given dimensions and cut costs

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

2 interviewers , coding problem, no compilation.

  • Q1. 

    Minimum Number Of People To Teach

    Ninja has started a social networking site called Ninjas Space. The platform consists of ‘N’ users and supports ‘M’ different languages. Users communicate if they know at...

  • Ans. 

    Determine the minimum number of users to teach a common language so all friends can communicate on a social networking site.

    • Create a graph where users are nodes and friendships are edges.

    • Find connected components in the graph.

    • For each connected component, determine the minimum number of users to teach a common language.

    • Return the sum of minimum users needed for all connected components.

  • Answered by AI
Round 3 - Face to Face 

Round duration - 40 minutes
Round difficulty - Medium

CS fundamentals. Tough round. 40 mins interview. 1 interviewer from USA

Round 4 - Face to Face 

(1 Question)

Round duration - 40 minutes
Round difficulty - Hard

System Design Problem

  • Q1. Design a Facebook-like application.
  • Ans. 

    Design a Facebook-like application for social networking.

    • User profiles with personal information and photos

    • News feed displaying posts from friends

    • Ability to like, comment, and share posts

    • Friend requests and messaging functionality

    • Groups and events for community engagement

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Delhi Technological University. I applied for the job as SDE - 1 in BangaloreEligibility criteriaComputer related BranchTwitter interview preparation:Topics to prepare for the interview - DBMS, Data Structures and Algorithms , OOP, Maths puzzles, Aptitude , CN, OSTime required to prepare for the interview - 9 MonthsInterview preparation tips for other job seekers

Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Company Website and was interviewed in Nov 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Leetcode similar coding tests

Round 2 - One-on-one 

(2 Questions)

  • Q1. How do you test the feasibility of an idea?
  • Q2. Explain the process of calling an API

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice leetcode and review basic SWE interview questions
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

DSA round was there it was good

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Why you want to join facebook?
  • Ans. 

    I want to join Facebook because of its innovative technology, global impact, and opportunities for growth.

    • Innovative technology: Facebook is known for its cutting-edge technology and constant innovation.

    • Global impact: Working at Facebook would allow me to contribute to a platform that connects billions of people worldwide.

    • Opportunities for growth: Facebook offers a dynamic and fast-paced work environment with ample opp...

  • Answered by AI
  • Q2. Whats the best feature you like in Facebook?
  • Ans. 

    I appreciate the personalized news feed feature on Facebook.

    • Personalized news feed shows content based on user interests

    • Helps users stay updated on relevant information

    • Allows users to engage with content they are interested in

  • Answered by AI

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Hard

This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were preety hard according to me . One has to have a fair share of knowledge in Data Structures and Algorithms to pass this round .

  • Q1. 

    Longest Increasing Path in a 2D Matrix Problem Statement

    Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...

  • Ans. 

    The task is to find the length of the longest increasing path in a 2D matrix, where you can move in four directions: left, right, up, or down from each cell.

    • Traverse the matrix and for each cell, find the longest increasing path starting from that cell

    • Use dynamic programming to store the length of the longest increasing path for each cell

    • Recursively explore all four directions from each cell, checking if the next cell ...

  • Answered by AI
  • Q2. 

    Saving Money Problem Statement

    Ninja is adventurous and loves traveling while being mindful of his expenses. Given a set of 'N' stations connected by 'M' trains, each train starting from station 'A' and r...

  • Ans. 

    The task is to find the cheapest price from the given source to destination with up to K stops.

    • Read the number of test cases

    • For each test case, read the number of stations and trains

    • Read the details of each train (source, destination, ticket price)

    • Read the source station, destination station, and maximum number of stops

    • Implement a graph data structure to represent the stations and trains

    • Use a modified version of Dijkst...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the
approach the time complexity and proper code covering all cases.

  • Q1. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    The task is to print every path of a binary tree with the sum of nodes in the path as 'K'.

    • Traverse the binary tree and keep track of the current path and its sum

    • At each node, check if the sum of the current path equals 'K'

    • If yes, add the current path to the result

    • Continue traversing the left and right subtrees recursively

    • Remove the current node from the path before backtracking

  • Answered by AI
  • Q2. 

    Combination Sum Problem Statement

    Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...

  • Ans. 

    The task is to find all unique combinations in an array whose sum is equal to a given target sum.

    • Use backtracking to generate all possible combinations

    • Sort the array in non-decreasing order to ensure elements in each combination are in non-decreasing order

    • Start with an empty combination and iterate through the array, adding each element to the combination and recursively calling the function with the remaining sum

    • If th...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed
the approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was
related to OS and was a bit theoretical .

  • Q1. 

    Merging Accounts Problem

    Given a list ACCOUNTS where each element consists of a list of strings, with the first element being the name of the account holder, and the subsequent elements being the email ad...

  • Ans. 

    The task is to merge accounts belonging to the same person based on common emails and return the merged accounts.

    • Iterate through each account and create a mapping of emails to account holders

    • Iterate through the mapping and merge accounts with common emails

    • Sort the merged accounts and return the result

  • Answered by AI
  • Q2. 

    Binary Tree Construction from Preorder and Inorder Traversal

    The goal is to construct a binary tree from given preorder and inorder traversal lists of the tree nodes.

    Example:

    Input:
    preorder = [1, 2, ...
  • Ans. 

    The task is to construct a binary tree using the given inorder and preorder traversals.

    • Use the preorder traversal to determine the root of the binary tree

    • Use the inorder traversal to determine the left and right subtrees of the root

    • Recursively construct the left and right subtrees

    • Return the root node of the constructed binary tree

  • Answered by AI
  • Q3. Can you explain the concept of demand paging?
  • Ans. 

    Demand paging is a memory management technique where pages are loaded into memory only when needed.

    • Demand paging allows for efficient memory utilization by loading pages into memory on demand.

    • It reduces the amount of initial memory required to start a process.

    • When a page is needed but not in memory, a page fault occurs and the required page is loaded from disk.

    • Demand paging allows for larger virtual memory space than p...

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to
asnwers all the questions with some help from the interviewer.

General Tip : While preparing for Facebook Interviews , make sure you read and understand some of the most important features that Facebook incorporates like Graph Search , Adding a friend , Removing a friend , Storing Likes/Dislikes and so on. 
All these features are important to learn because at their core they are nothing but Data Structures used and implemented very elegantly . So before your next Facebook interview , do read these topics and be confident about your LLD as well as HLD skills.

  • Q1. How does Facebook store likes and dislikes?
  • Ans. 

    Facebook stores likes/dislikes using a combination of databases and caching systems.

    • Likes/dislikes are stored in a distributed database system like Cassandra or HBase.

    • Each like/dislike is associated with a user and the content being liked/disliked.

    • The database is sharded to handle the large volume of likes/dislikes.

    • Caching systems like Memcached or Redis are used to improve read performance.

    • Likes/dislikes can be stored...

  • Answered by AI
  • Q2. How does Facebook implement graph search?
  • Ans. 

    Facebook implements graph search by indexing user connections and content to enable efficient search queries.

    • Facebook indexes user connections and content to build a graph database.

    • The graph database is used to store and retrieve information about users, their relationships, and their content.

    • Graph search queries are executed by traversing the graph database to find relevant connections and content.

    • Facebook uses variou...

  • Answered by AI
  • Q3. How does Facebook Chat work?
  • Ans. 

    Facebook Chat is a real-time messaging system that allows users to send and receive instant messages.

    • Facebook Chat uses a client-server architecture.

    • It utilizes long polling or WebSockets for real-time communication.

    • Messages are stored in a message queue for delivery.

    • Chat messages are encrypted for security.

    • Facebook Chat supports features like read receipts, typing indicators, and group chats.

  • Answered by AI

Interview Preparation Tips

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

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

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Few aptitude questions were asked in the interview

Round 2 - Coding Test 

Reverse string without doing anything to special characters

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

Yahoo Interview FAQs

How many rounds are there in Yahoo Senior Marketing Analyst interview?
Yahoo interview process usually has 4 rounds. The most common rounds in the Yahoo interview process are One-on-one Round, HR and Aptitude Test.
What are the top questions asked in Yahoo Senior Marketing Analyst interview?

Some of the top questions asked at the Yahoo Senior Marketing Analyst interview -

  1. how do you solve specific marketing probl...read more
  2. Director on behav...read more

Tell us how to improve this page.

Yahoo Senior Marketing Analyst Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Google Interview Questions
4.4
 • 824 Interviews
Swiggy Interview Questions
3.8
 • 426 Interviews
Udaan Interview Questions
3.9
 • 334 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
View all
AD Operations Specialist
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Lead
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Manager
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Yahoo with

Google

4.4
Compare

Facebook

4.3
Compare

Microsoft Corporation

4.0
Compare

Amazon

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