Upload Button Icon Add office photos

Filter interviews by

Seniority Interview Questions and Answers

Updated 3 Jul 2024

Seniority Interview Experiences

Popular Designations

3 interviews found

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

Write copy for social media post with ideations and caption.

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about yourself.
  • Ans. 

    Experienced social media manager with a passion for creating engaging content and growing online communities.

    • Managed social media accounts for multiple companies, increasing followers and engagement

    • Created and implemented social media strategies to drive traffic and conversions

    • Strong understanding of analytics and data-driven decision making

    • Skilled in content creation, community management, and influencer partnerships

  • Answered by AI
  • Q2. Your work and profile.

Social Media Manager Interview Questions asked at other Companies

Q1. what do you understand by social Media marketing? What is paid marketing? how many channels can we use for marketing? what are PPC SEO and affiliate marketing? how can social media help businesses as revfin grow?
View answer (1)

E-Commerce Executive Interview Questions & Answers

user image Gaurav Kulkarni

posted on 29 Dec 2022

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

I applied via Naukri.com and was interviewed before Dec 2021. There were 2 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 - One-on-one 

(3 Questions)

  • Q1. Magento and ecommerce
  • Q2. Catalogs product uploading
  • Q3. Back end and database manegement

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing.. depend upon your JD
If this is related with e-commerce then will ask the question about mage to functional

E-Commerce Executive Interview Questions asked at other Companies

Q1. If you gave 40 shipments for delivery, then 30% were delivered, then what is the% delivery.
View answer (5)

Interview Questionnaire 

1 Question

  • Q1. I was asked about the core concepts of JS and also about the methodology for reCt as well.
  • Ans. So first of all clear all the basic concepts of JS and should have knowledge about react working.
  • Answered Anonymously

Senior Software Engineer Interview Questions asked at other Companies

Q1. Tell me about yourself. What technology are you using? What is a Collection? What are the different types of collection there? What is the difference between ArrayList and LinkedList What are the basic building blocks of Stream operators, s... read more
View answer (2)

Interview questions from similar companies

Software Engineer Interview Questions & Answers

Medlife user image nerella saikrishna

posted on 9 Jan 2016

Interview Questionnaire 

12 Questions

  • Q1. Insert a node in a Linked List, if a pointer to a node(it's not a head pointer) of Linked List is given.
  • Q2. What is the Time Complexity of Binary Search and it's derivation
  • Ans. 

    Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.

    • Binary Search is a search algorithm that works on sorted arrays.

    • It starts by comparing the target value to the middle element of the array.

    • If the target value is smaller, the search continues on the lower half of the array.

    • If the target value is larger, the search continues on the upper half of the array.

    • T...

  • Answered by AI
  • Q3. Write code for QuickSort
  • Ans. 

    QuickSort is a sorting algorithm that uses divide and conquer approach.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot

    • Recursively apply the above steps to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q4. Write code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
  • Ans. 

    Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming

    • Recursion: Define a function that calls itself with the previous two numbers in the series as arguments

    • Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration

    • Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series

  • Answered by AI
  • Q5. How to implement an operation with Stacks which will be similar to Queue
  • Ans. 

    Implementing a Queue using Stacks

    • Use two stacks to implement a queue

    • Push elements onto the first stack

    • When dequeuing, pop all elements from the first stack and push onto the second stack

    • Pop the top element from the second stack to dequeue

    • If the second stack is empty, pop all elements from the first stack and push onto the second stack

  • Answered by AI
  • Q6. Write code for MergeSort
  • Ans. 

    MergeSort is a divide and conquer algorithm that sorts an array of strings.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q7. 2 types of detective ball puzzles
  • Q8. 25 Horses, 5 Tracks, 3 Fastest Puzzle
  • Q9. How the letters of a text are determined(Basically about OCR)
  • Q10. Write code for Insertion Sort and Selection Sort and find their time complexities and also the cases where their usage is efficient
  • Q11. Explain about Counting Sort
  • Ans. 

    Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.

    • Count the occurrences of each element in the array

    • Calculate the cumulative sum of the counts

    • Place each element in the sorted array based on its count and cumulative sum

    • Time complexity is O(n+k) where n is the number of elements and k is the range of input

    • Example: Sort an array of strings based on their

  • Answered by AI
  • Q12. When we type a part of a word in chrome, how is it able to show all the types of words, which are consisted of that part
  • Ans. 

    Chrome uses an algorithm to predict and suggest words based on user input.

    • Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.

    • The algorithm also takes into account the frequency and recency of the user's input.

    • Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.

    • The suggestions are di...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: First Question, at the start I was not able to answer and he gave me an hint(He asked me the insertion in an array). So, I got the idea for the insertion in Linked List and was able to answer it.
Remaining questions, I was able to answer confidently.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I was able to answer all the questions confidently, since I know the answers for them, But the last question was out of my scope and I explained based on my intuition and knowledge.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I have given the answers for 1&2 questions with clear explanation. And the third question is again out of my scope and I explained this also based intuition.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

General Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skill Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skills: Logical Puzzles, Algorithms And DataStructures
College Name: IIT Madras
Motivation: 1. Primary Reason: Passionate about Programming and Problem solving.
2. The profile is software Engineer.
3. You can see your idea, having an impact on the society which is possible with this type of company.
4. And a good package.
Funny Moments: Nothing Really...

Skills evaluated in this interview

I appeared for an interview in Dec 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It has 3 Coding Questions of medium-hard level and the time limit was 1 hour only. I don’t exactly remember the questions but I was able to do only two of them completely.

  • Q1. 

    Biggest Number Formation Problem

    Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.

    Input:

    Integer T denoting the nu...
  • Ans. 

    Construct the largest number by concatenating positive integers in the array exactly once.

    • Sort the array of integers in a way that the concatenation of the numbers forms the largest possible number.

    • Use a custom comparator function to sort the numbers based on their concatenated values.

    • Join the sorted array elements to form the final largest number.

  • Answered by AI
  • Q2. 

    Number of Longest Increasing Subsequence Problem Statement

    Given an integer array ARR of length N, determine the count of longest increasing subsequences present in the array.

    Explanation:

    The Longest I...

  • Ans. 

    Count the number of longest increasing subsequences in an integer array.

    • Identify the longest increasing subsequences in the array

    • Count the number of such subsequences

    • Consider the constraints while implementing the solution

    • Examples: For input [50, 3, 90, 60, 80], the output is 2

  • Answered by AI
Round 2 - Telephonic Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

First, the interviewer introduced himself and then asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 3 coding questions on their personal live code environment.

He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.

  • Q1. 

    Cache Operations Problem

    You are provided with a cache that can hold a maximum of 'N' elements. Initially, this cache is empty. There are two main operations you can perform on this cache:

    Explanation:

      ...
  • Ans. 

    Implement a cache with insert, update, and retrieve operations, returning results of retrieve operations in order.

    • Create a cache data structure with specified size 'N'.

    • Implement insert and update operations based on the given criteria.

    • For retrieve operation, return the value associated with the 'U_ID' if present, else return -1.

    • Handle cases where the cache is full and least frequently used items need to be removed.

    • Retu...

  • Answered by AI
  • Q2. 

    Possible Words from a Phone Number: Problem Statement

    Given a string S composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...

  • Ans. 

    Given a phone number, generate all possible words by mapping digits to letters on a T9 keypad.

    • Create a mapping of digits to letters on a T9 keypad

    • Use recursion to generate all possible combinations of letters for the given phone number

    • Sort the resulting strings in lexicographical order

  • Answered by AI
  • Q3. 

    Shortest Unique Prefix Problem

    You are given an array containing N words. Your task is to derive the shortest prefix for each word that uniquely identifies it amongst the other words. For instance, given t...

  • Ans. 

    Given an array of words, find the shortest unique prefix for each word.

    • Create a Trie data structure to efficiently store and search for prefixes.

    • Traverse the Trie to find the shortest unique prefix for each word.

    • Return the list of shortest unique prefixes for all words.

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

In this round interviewer gave me 2 coding questions and asked me to code on any editor of my choice. I opened VS code to code those problems.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in a given array.

    • Iterate through the array and keep track of the maximum sum subarray seen so far.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Handle cases where all elements are negative by returning the maximum element in the array.

    • Consider the sum of an empty subarray as 0.

  • Answered by AI
  • Q2. 

    LRU Cache Implementation

    Design and implement a data structure for the Least Recently Used (LRU) cache, which supports the following operations:

    1. get(key) - Return the value associated with the key if ...
  • Ans. 

    Implement a Least Recently Used (LRU) cache data structure with get and put operations.

    • Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and remove it when the cache reaches its capacity.

    • Update the position of an item in the cache whenever it is accessed or updated.

    • Ensure constant time complexity for both get and put operations by u...

  • Answered by AI
Round 4 - HR 

Round duration - 40 Minutes
Round difficulty - Easy

The interviewer was very friendly. He asked me about myself and previous interviews.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPATata 1mg interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Database Management, Operating System, Aptitude.Time required to prepare for the interview - 3.5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do at least 2-3 Development Projects as it creates a great impression. 
Tip 2 : Do it simply don't include complex terms to explain anything/concept. 
Tip 3 : Practice as many 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 Dec 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

There were a total of 3 coding questions to be solved, and the time limit was 90 minutes. The candidate was free to use language of their choice.

  • Q1. 

    Longest Palindromic Subsequence Problem Statement

    Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.

    Explanation:

    • A subsequ...
  • Ans. 

    The task is to find the length of the longest palindromic subsequence in a given string.

    • A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters.

    • A string is said to be palindrome if the reverse of the string is the same as the actual string.

    • Find the longest palindromic subsequence by considering all possible subs...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

The first round of interview lasted for around 45 minutes. I was asked two DSA questions, and was supposed to code them while my screen was shared. I wrote code for both the questions with little help from the interviewer. Finally, I was asked couple of questions based on my resume.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    The task is to merge two sorted linked lists into a single sorted linked list.

    • Create a new linked list to store the merged list

    • Compare the values of the nodes from both lists and add the smaller value to the new list

    • Move the pointer of the list with the smaller value to the next node

    • Repeat the comparison and addition until one of the lists is empty

    • Add the remaining nodes from the non-empty list to the new list

    • Return th

  • Answered by AI
  • Q2. 

    Rotational Equivalence of Strings Problem Statement

    Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...

  • Ans. 

    The task is to check if one string can be converted into another string by cyclically rotating it to the right any number of times.

    • Iterate through each character of the first string and check if it matches the corresponding character in the second string after a certain number of cyclic rotations.

    • If all characters match for any number of cyclic rotations, then the first string can be converted into the second string.

    • Us...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

I was given one data structure question and was then asked about recursion.

  • Q1. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of the elements

    • For each element, pop elements from the stack until a greater element is found or the stack is empty

    • If a greater element is found, it is the next greater element for the current element

    • If the stack becomes empty, there is no greater element to the right

    • Store the ...

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Easy

This was the hiring manager round. No data structures question were asked in this round. There was discussion around the projects that I had done and my resume. As I am from EEE branch, I was asked why I want to get into software. The interview happened around 8 PM. I was asked to create a schema for one of my projects.

  • Q1. Why do you want to pursue a career in software?
  • Ans. 

    I want to get into software because of my passion for problem-solving and the opportunity to create innovative solutions.

    • Passion for problem-solving

    • Opportunity to create innovative solutions

    • Interest in technology and its impact on society

    • Career growth and job stability

    • Flexibility and remote work options

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPATata 1mg interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, Number Theory, LLD, PuzzlesTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practice regularly, meaning once you have covered all the topics, revisit them every week, and solve 3-5 questions.
Tip 2 : Use the Feynman technique. Explain your approach towards solving the problem to someone, or better yet, note it down so that when you revisit that question, the explanation is handy. 
Tip 3 : Do 1 project, preferably a full-stack one including a database. This would provide some material for discussion, and be through with each aspect of the project.

Application resume tips for other job seekers

Tip 1 : Keep the resume to one page and put info that is directly related to the role applied. 
Tip 2 : In the projects section, keep a maximum of 3 projects, but ensure that at least one of them is hosted/live that can be shown to the interviewer.

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 Referral and was interviewed before Sep 2022. There were 3 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 - Technical 

(1 Question)

  • Q1. React JS, coding round, DSA, poly phill, map , shallow copy deep copy, popular JS DSA questions
Round 3 - Assignment 

Basic React JS clock/ stopwatch

Interview Preparation Tips

Interview preparation tips for other job seekers - know how to create componenets, and Easy to early medium level DSA leetcode JS based.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

2 coding question one on maximum sum problem and other on tree traversal

Round 3 - Technical 

(1 Question)

  • Q1. Dbms oops dsa questions are there and one coding question which you have to pseudo code it and dry run it
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. SQL, Case study, and puzzles.

Interview Preparation Tips

Interview preparation tips for other job seekers - SQL, case study, and Puzzles. That's what I was asked.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Majorily on SQL and Databases

Round 2 - Technical 

(2 Questions)

  • Q1. Align two images in a page with same width and same height
  • Ans. 

    Use CSS to align two images with same width and height on a page

    • Set both images to have the same width and height using CSS

    • Use flexbox or grid layout to align the images horizontally or vertically

    • Adjust margins or padding to fine-tune the alignment

  • Answered by AI
  • Q2. Array related question
Round 3 - HR 

(2 Questions)

  • Q1. Situation based question
  • Q2. Majorily focused on project

Skills evaluated in this interview

Seniority Interview FAQs

How many rounds are there in Seniority interview?
Seniority interview process usually has 2 rounds. The most common rounds in the Seniority interview process are One-on-one Round, Resume Shortlist and Assignment.
How to prepare for Seniority 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 Seniority. The most common topics and skills that interviewers at Seniority expect are AWS, Design Patterns, Product Management, React.Js and Bootstrap.
What are the top questions asked in Seniority interview?

Some of the top questions asked at the Seniority interview -

  1. I was asked about the core concepts of JS and also about the methodology for re...read more
  2. Back end and database manegem...read more
  3. Magento and ecomme...read more

Tell us how to improve this page.

Seniority Interview Process

based on 2 interviews

Interview experience

3.5
  
Good
View more

Interview Questions from Similar Companies

Apollo Hospitals Interview Questions
4.1
 • 342 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Max Healthcare Interview Questions
4.1
 • 135 Interviews
Fortis Healthcare Interview Questions
4.0
 • 127 Interviews
PharmEasy Interview Questions
3.7
 • 80 Interviews
Netmeds.com Interview Questions
3.6
 • 42 Interviews
Portea Medical Interview Questions
3.8
 • 28 Interviews
Medlife Interview Questions
3.7
 • 27 Interviews
HealthKart Interview Questions
4.0
 • 25 Interviews
View all

Seniority Reviews and Ratings

based on 30 reviews

3.8/5

Rating in categories

3.3

Skill development

3.8

Work-life balance

3.5

Salary

2.7

Job security

3.4

Company culture

3.1

Promotions

3.3

Work satisfaction

Explore 30 Reviews and Ratings
Product Manager
8 salaries
unlock blur

₹10 L/yr - ₹26 L/yr

Assistant Manager
6 salaries
unlock blur

₹4.2 L/yr - ₹8.6 L/yr

Asst.Marketing Manager
6 salaries
unlock blur

₹5 L/yr - ₹5.6 L/yr

Quality Analyst
5 salaries
unlock blur

₹4 L/yr - ₹6.8 L/yr

MIS Specialist
5 salaries
unlock blur

₹5 L/yr - ₹6.1 L/yr

Explore more salaries
Compare Seniority with

HealthKart

4.0
Compare

Tata 1mg

3.6
Compare

PharmEasy

3.7
Compare

Netmeds.com

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