Filter interviews by
To calculate the earliest activity date for the user, find the minimum date across all three columns.
Identify the three columns containing dates for various activities
Use a function to find the minimum date across all three columns
Consider handling null or missing values appropriately
I applied via Naukri.com and was interviewed in May 2023. There were 3 interview rounds.
Design a poster and then adapt into different sizes for Google ads and FB Ads.
Amazon MX Player interview questions for popular designations
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
I have extensive experience in handling litigation cases, including drafting legal documents, conducting research, and representing clients in court.
Managed a caseload of over 50 litigation matters at a time
Drafted pleadings, motions, and briefs for various court proceedings
Conducted legal research to support arguments and strategies
Negotiated settlements and represented clients in court hearings and trials
Worked close...
I applied via Job Portal and was interviewed in Feb 2022. There were 2 interview rounds.
1 hour test round, with topics like DSA, Computer Architectutre, DBMS, OS, TOC. C++ Compe Coding interview questions, past year work experience and projects.
I applied via Recruitment Consultant and was interviewed in Jan 2021. There were 3 interview rounds.
My favourite product is the iPhone.
Sleek design and user-friendly interface
High-quality camera and advanced features
Seamless integration with other Apple products
Regular software updates and strong security measures
Build a search algorithm for a social media app
Identify relevant search criteria such as keywords, hashtags, user profiles, and location
Rank search results based on relevance and popularity
Implement filters to refine search results
Consider user behavior and search history to personalize results
Optimize search speed and efficiency
Top trending discussions
I am a Senior Associate in the field of finance, specializing in investment management.
I have expertise in analyzing financial data and making investment recommendations.
I work closely with clients to understand their financial goals and risk tolerance.
I monitor market trends and economic indicators to make informed investment decisions.
I have experience in portfolio management and asset allocation.
I may hold certifica...
My ambition is to become a respected leader in my field, making a positive impact through innovative solutions and mentorship.
To continuously learn and grow in my role
To lead and inspire a team towards success
To contribute to the advancement of the organization and industry
To mentor and guide junior colleagues in their professional development
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
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.
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.
posted on 21 Mar 2021
based on 5 interviews
Interview experience
based on 55 reviews
Rating in categories
Graphic Designer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Disney+ Hotstar
SonyLIV
ZEE5
ALTBalaji