Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2024. There was 1 interview round.
Top trending discussions
I applied via Campus Placement
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 appeared for an interview 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.
I applied via Referral and was interviewed in Oct 2019. There was 1 interview round.
I have 5 years of experience managing warehouse operations, including inventory control, shipping/receiving, and staff supervision.
Implemented efficient inventory management system to reduce errors and improve accuracy
Led team in achieving 99% on-time shipping rate by optimizing workflow processes
Trained staff on safety protocols and equipment operation to ensure compliance with OSHA regulations
I applied via Naukri.com and was interviewed before Aug 2019. There were 3 interview rounds.
I applied via Job Portal and was interviewed in May 2019. There were 3 interview rounds.
Digital marketing is the practice of promoting products or services using digital channels and technologies.
Digital marketing involves various strategies such as search engine optimization (SEO), social media marketing, email marketing, and content marketing.
It aims to reach and engage with a target audience through online platforms like websites, social media platforms, search engines, and mobile apps.
Digital marketin...
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.
Examples of search engines include Google, Bing, and Yahoo.
SEO helps businesses increase their online visibi...
Inorganic results are paid ads in search engines while organic results are the natural listings.
Inorganic results are paid advertisements that appear at the top or bottom of search engine results pages (SERPs).
Organic results are the natural listings that appear in SERPs based on relevance to the search query.
Inorganic results are marked as 'Ad' while organic results are not.
Examples of inorganic results include Google...
I applied via Walk-in and was interviewed before Apr 2021. There were 2 interview rounds.
Tough Cat questions
I appeared for an interview before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.
If there is a loop, the two pointers will eventually meet at some point within the loop.
To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Round duration - 30 minutes
Round difficulty - Easy
This round was mostly focused on my resume and projects.
Round duration - 30 minutes
Round difficulty - Easy
It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience.
Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.
Application resume tips for other job seekersKeep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.
Final outcome of the interviewSelectedbased on 4 interviews
Interview experience
based on 21 reviews
Rating in categories
Technical Support Executive
7
salaries
| ₹0.9 L/yr - ₹2.2 L/yr |
Telecaller
6
salaries
| ₹0.9 L/yr - ₹2 L/yr |
Team Lead
5
salaries
| ₹2 L/yr - ₹3.8 L/yr |
Network Engineer
4
salaries
| ₹2.9 L/yr - ₹3.7 L/yr |
Senior Manager
4
salaries
| ₹10 L/yr - ₹17 L/yr |
Amazon
Flipkart
Mahindra & Mahindra
Asian Paints