Upload Button Icon Add office photos

Filter interviews by

Lundbeck Interview Questions and Answers

Updated 16 Jun 2024

Lundbeck Interview Experiences

3 interviews found

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

(2 Questions)

  • Q1. Tell about yourself
  • Q2. Product detailing

Interview Preparation Tips

Interview preparation tips for other job seekers - Previous experience and product detailing questions

Product Specialist Interview Questions asked at other Companies

Q1. How product specialist is different from product analyst?
View answer (1)

Sun Pharmaceutical Industries

Join us and thrive in a company culture that inspires and empowers.

Interview Questions & Answers

user image Anonymous

posted on 18 May 2022

Round 1 - One-on-one 

(1 Question)

  • Q1. General about previous experience and product details
Round 2 - HR 

(2 Questions)

  • Q1. Introduction product knowledge
  • Q2. Salary discussion

Interview Preparation Tips

Interview preparation tips for other job seekers - Nice company and good culture even covid situation they helped alot.
Lundbeck Interview Questions and Answers for Freshers
illustration image
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Sep 2022. There were 4 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 Resume tips
Round 2 - Aptitude Test 

MCQ test all questions

Round 3 - One-on-one 

(2 Questions)

  • Q1. Where you see you after 5 years
  • Q2. Regional manager
Round 4 - HR 

(2 Questions)

  • Q1. Salary negotiation
  • Q2. You intro and work experience

Interview Preparation Tips

Interview preparation tips for other job seekers - Totally scienc base

Product Specialist Interview Questions asked at other Companies

Q1. How product specialist is different from product analyst?
View answer (1)

Interview questions from similar companies

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .

  • Q1. 

    K Closest Points to Origin Problem Statement

    Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...

  • Ans. 

    Find the K closest points to the origin in a 2-D plane using Euclidean Distance.

    • Calculate the Euclidean Distance of each point from the origin

    • Sort the points based on their distances

    • Return the first K points as the closest neighbors

  • Answered by AI
  • Q2. 

    Power Set Generation

    Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

    A power set of a set 'ARR' i...

  • Ans. 

    Generate the power set of a sorted array of integers with individually sorted subsets.

    • Use recursion to generate all possible subsets by including or excluding each element in the array.

    • Sort each subset before adding it to the power set.

    • Handle base cases for empty array and single element array.

    • Ensure the subsets are unique by using a set data structure.

    • Time complexity can be exponential due to the nature of generating

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Hard

This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .

  • Q1. 

    Roman Numeral to Integer Conversion

    Convert a string representing a Roman numeral into its integer equivalent and return the result.

    Explanation:

    Roman numerals are represented by seven different symbol...

  • Ans. 

    Convert a Roman numeral string to its integer equivalent.

    • Create a mapping of Roman numeral symbols to their integer values.

    • Iterate through the input string and add the corresponding integer values.

    • Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.

  • Q1. 

    Arithmetic Expression Evaluation Problem Statement

    You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...

  • Ans. 

    Evaluate arithmetic expressions in infix notation with given operators and precedence rules.

    • Parse the infix expression to postfix using a stack.

    • Evaluate the postfix expression using a stack.

    • Handle operator precedence and parentheses while evaluating.

    • Ensure no division by zero cases and operands fit in 32-bit integer.

  • Answered by AI
  • Q2. 

    Remove Duplicates from Sorted Array Problem Statement

    You are given a sorted integer array ARR of size N. Your task is to remove the duplicates in such a way that each element appears only once. The outpu...

  • Ans. 

    Remove duplicates from a sorted array in-place with O(1) extra memory.

    • Use two pointers - one for iterating through the array and another for placing unique elements.

    • Compare current element with next element to identify duplicates and skip them.

    • Update array in-place by moving unique elements to the front.

    • Return the length of the array after removal of duplicates.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .

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

    Facebook stores likes and dislikes using a combination of databases and algorithms.

    • Likes and dislikes are stored in databases such as MySQL or Cassandra.

    • Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.

    • User interactions with posts, pages, and ads are tracked to determine likes and dislikes.

    • Likes and dislikes may also be used to personalize the user's feed and target ads mor

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

    Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.

    • Facebook uses a graph database to store connections between users, pages, groups, etc.

    • The graph search algorithm traverses the graph to find relevant connections based on user queries.

    • It takes into account factors like user relationships, interests, and interactions to provide personalized sea

  • Answered by AI
Round 5 - Face to Face 

(2 Questions)

Round duration - 50 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.

  • Q1. What is Hadoop and why is it used?
  • Ans. 

    Hadoop is a framework for distributed storage and processing of large data sets.

    • Hadoop is used for storing and processing big data across a distributed network of computers.

    • It is based on the MapReduce programming model, which allows for parallel processing of data.

    • Hadoop consists of HDFS for storage and YARN for resource management.

    • It is used for tasks like data warehousing, log processing, recommendation systems, and...

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

    Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.

    • Facebook Chat uses websockets for real-time communication between the client and server.

    • Long polling is used to check for new messages when websockets are not supported.

    • Push technology is used to notify users of new messages even when the chat window is not open.

    • Messages are stored in a database an...

  • 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 - 5 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 Preparation Tips

Round: Test
Tips: Just try coding as much as you can in the four years of graduation.

Round: Interview
Experience: Three Coding Interview and a Behavioral Interview were conducted.
Tips: Try to get some prior knowledge about the company's infrastructure.w

General Tips: Practice as much problems as you can online or offline.
Skill Tips: Coding is the key for any software company.
Skills: Coding
College Name: IIT KHARAGPUR
Motivation: Its the best in business

Interview Questionnaire 

4 Questions

  • Q1. You are given a large array of n bits. Each bit is initially 0. You perform several operations of the type
  • Ans. 

    Solution to performing operations on a large array of bits.

    • Use bitwise operators to perform operations on individual bits

    • Use a loop to iterate through the array and perform the operations

    • Ensure that the array is large enough to accommodate all the bits

    • Consider using a data structure like a bitset for efficient bit manipulation

  • Answered by AI
  • Q2. Questions on Network programming
  • Q3. Questions on array,heap and binary trees
  • Q4. Round was both HR+Technical

Interview Preparation Tips

Round: Test
Experience: Questions can be found here:

-----/
Tips: Try to solve all 3.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: First discuss the solution and then paper-code it.
Tips: Try to code without mistakes.

Round: Technical Interview
Experience: First, I was asked to discuss my project based on networking and then I was given a question on network programming
Tips: Pay attention on discussion

Round: Technical Interview
Experience: Provide the optimised solution and code it without any mistakes.

Round: HR Interview
Experience: Why linkedin?
What changes will you make in 6 months?
Internship project: Discussion and lot of common questions on that.
Basic Questions of C++ and Java

Skills: Data Structure, Core courses understanding, Algorithms
College Name: IIT GUWHATI

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array in place.

    • Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

    • Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

    • Continue this process until all elements from ARR2 are merged into ARR1.

  • Answered by AI
  • Q2. 

    Word Distance Calculation

    Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...

  • Ans. 

    Find the smallest distance between two words in a document for multiple queries.

    • Iterate through the document array to find the indices of the two words in each query.

    • Calculate the absolute difference between the indices to get the distance.

    • If a word from the query is not present in the document, return the length of the document array.

    • Repeat the process for each query and output the smallest distance for each.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    The problem requires implementing a function to return the level order traversal of a binary tree.

    • Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

    • Use a queue data structure to perform level order traversal.

    • Process each level of the tree one by one, starting from the root node.

    • Print the node values at each level in the order they appear from left to ...

  • 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. 

    Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.

    • Use backtracking to generate all possible combinations.

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

    • Track the current combination and sum while backtracking.

    • Terminate recursion when the sum equals the target sum.

    • Avoid duplicates by skipping elements that have been used in previou

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 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

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo 10^9+7 to avoid overflow in calculations.

  • Answered by AI
  • Q2. 

    Optimal Strategy for a Coin Game

    You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line.

    Here are the rules of the game:

    1. Each coin has a value associated wit...
  • Ans. 

    The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.

    • Start by understanding the rules of the game and how players take turns to choose coins.

    • Consider the scenario where both players play optimally to maximize winnings.

    • Iterate through different strategies to determine the best approach for selecting coins.

    • Keep track of the total winnings accumulated by eac...

  • Answered by AI
  • Q3. 

    Generate All Parentheses Combinations

    Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered w...

  • Ans. 

    Generate all possible valid parentheses configurations using N pairs.

    • Use backtracking to generate all possible combinations of parentheses.

    • Keep track of the number of open and close parentheses used.

    • Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.

    • Base case: when the length of the generated string is 2*N, add it to the result array.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn 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 interviewRejected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: it was a basic test, CAT level questions and can be easily cleared
Tips: keep your cool, don't panic
Duration: 60 minutes
Total Questions: 60

College Name: IIT BOMBAY

Analyst Interview Questions & Answers

Ola Cabs user image Satyam Mudaliar

posted on 18 Sep 2015

Interview Preparation Tips

Round: Test
Experience: English was unpredictable.. Maths was easy but it will be good if you have practice, logical reasoning requires practice but are interesting
Tips: Leave english comprehensions for the end.. Do not waste too much time on one question even if it appears easy.. attempt the paper in the order of your comfort and mark every questions in case of NO negative marking
Duration: 60 minutes

Round: HR Interview
Tips: Smile!! And think before speaking anything, else you may contradict your own point.. Prepare "Tell me about yourself" well and guide your interview by focusing on your strongest point, you may face more questions on that point.. refer to 64 HR questions book

Round: Stress Interview
Tips: If they are giving you stress, that means they like you.. Relax!! Do not get nervous, thats what they want to check.. Think for the solution to the problem normally, you know you can crack it (Stress interview may be a part of HR, technical, case or any other interview.. you may have to make it out yourself)

Skill Tips: ""
Skills: Puzzles, Speaking skills, Aptitude, guesstimates, Case solving, presentation skills
College Name: IIT Bombay
Contribute & help others!
anonymous
You can choose to be anonymous

Lundbeck Interview FAQs

How many rounds are there in Lundbeck interview?
Lundbeck interview process usually has 2-3 rounds. The most common rounds in the Lundbeck interview process are HR, Resume Shortlist and One-on-one Round.
What are the top questions asked in Lundbeck interview?

Some of the top questions asked at the Lundbeck interview -

  1. Introduction product knowle...read more
  2. Regional mana...read more
  3. Product detail...read more

Recently Viewed

DESIGNATION

JOBS

Tuoren Medical Device India

No Jobs

INTERVIEWS

BCForward

No Interviews

PHOTOS

Tuoren Medical Device India

No Photos

SALARIES

HOYA Vision Care

No Salaries

COMPANY BENEFITS

HOYA Vision Care

No Benefits

JOBS

Bio-Rad Laboratories

No Jobs

SALARIES

Teleflex Medical

No Salaries

PHOTOS

Bio-Rad Laboratories

No Photos

SALARIES

Hermes I Tickets

No Salaries

Tell us how to improve this page.

Lundbeck Interview Process

based on 2 interviews

Interview experience

5
  
Excellent
View more

HCLTech

There's no stopping you

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 424 Interviews
BigBasket Interview Questions
3.9
 • 356 Interviews
Udaan Interview Questions
3.9
 • 333 Interviews
Lenskart Interview Questions
3.2
 • 303 Interviews
Ola Cabs Interview Questions
3.4
 • 137 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
Rebel Foods Interview Questions
3.7
 • 62 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
ByteDance Interview Questions
4.2
 • 35 Interviews
View all

Lundbeck Reviews and Ratings

based on 43 reviews

4.4/5

Rating in categories

4.0

Skill development

4.2

Work-life balance

3.8

Salary

3.5

Job security

4.2

Company culture

3.8

Promotions

4.0

Work satisfaction

Explore 43 Reviews and Ratings
Product Specialist
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Zonal Sales Manager
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Area Sales Manager
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Territory Business Executive
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Medical Representative
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Lundbeck with

Udaan

4.0
Compare

BigBasket

3.9
Compare

Swiggy

3.8
Compare

Lenskart

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