i
Naukri
Filter interviews by
Clear (1)
I applied via Campus Placement
Easy to medium kind of test.
Was given a general topic and active participation throughout is a must.
I applied via Campus Placement and was interviewed before Feb 2023. There were 4 interview rounds.
Basic arithmetic test
Gd on current affair
I applied via Campus Placement and was interviewed in Dec 2017. There were 3 interview rounds.
My hometown is known for its historic landmarks, delicious cuisine, and vibrant arts scene.
Historic landmarks such as the Old Town Square and the Cathedral of St. Peter
Delicious cuisine including traditional dishes like dumplings and goulash
Vibrant arts scene with numerous galleries, theaters, and music venues
Sales is a dynamic field that allows me to utilize my skills in building relationships, solving problems, and driving business growth.
I am passionate about building relationships and connecting with people.
Sales provides an opportunity to solve problems and meet customer needs.
I enjoy the challenge of driving business growth and achieving targets.
Sales allows me to constantly learn and adapt in a fast-paced environment...
Passion for building relationships and driving business growth
Passion for sales and building strong relationships with clients
Opportunity to drive business growth and achieve targets
Excitement for working in a dynamic and challenging corporate environment
I am a results-driven sales professional with over 10 years of experience in corporate sales, consistently exceeding targets and building strong client relationships.
Over 10 years of experience in corporate sales
Consistently exceed sales targets
Strong client relationship building skills
India has a rapidly growing internet penetration rate, with over 624 million internet users as of 2020.
India has the second-largest internet user base in the world.
Internet penetration in India has been increasing steadily over the years.
As of 2020, India had over 624 million internet users, accounting for around 45% of the country's population.
The availability of affordable smartphones and low-cost data plans has cont...
China has a high internet penetration rate, with a large percentage of its population having access to the internet.
China has the largest number of internet users in the world.
As of 2021, China had an internet penetration rate of over 70%.
Internet usage is widespread in urban areas, but rural areas still have lower penetration rates.
China has a highly developed e-commerce market, driven by its internet penetration.
Popu...
Quadrangle is a geometric shape with four sides and four angles.
Quadrangle is also known as a quadrilateral.
It can have different types such as square, rectangle, parallelogram, trapezoid, etc.
Each side of a quadrangle can have different lengths and each angle can have different measures.
Examples of quadrangles include a square, a rectangle, a diamond, a kite, etc.
The Chief Minister of Maharashtra is Uddhav Thackeray.
Uddhav Thackeray is the current Chief Minister of Maharashtra.
He is the leader of the Shiv Sena party.
He assumed office on November 28, 2019.
Prior to becoming the Chief Minister, he served as the leader of the opposition in the Maharashtra Legislative Assembly.
The cyclone that hit Mumbai caused widespread destruction and disruption.
The cyclone, named Cyclone Nisarga, made landfall near Alibag in Maharashtra on June 3, 2020.
It brought heavy rainfall, strong winds, and storm surges, leading to flooding in low-lying areas.
Several trees were uprooted, power lines were damaged, and buildings suffered structural damage.
The cyclone caused the cancellation of flights, trains, and di...
Top trending discussions
posted on 29 May 2023
I applied via Campus Placement and was interviewed in Nov 2022. There were 5 interview rounds.
The aptitude test is medium tough. If you have already given competitive exams like CAT, CMAT, XAT, etc. then it should not be difficult for you. Remember that time management is of utmost importance.
The group discussion is where I would suggest you try to take the lead by starting first as it may create a positive impact. Also, try to speak points relevant to the topic and keep it short to give others a chance to speak too. Group discussion is not all about you speaking most of the time but also giving others a chance to others to listen to them. Also, do not try to cheat or indulge in malpractice by taking the help of the internet or keeping a tab open and speaking by reading from it as it is easy to understand that what you're saying is not your own words but from somewhere else.
BCG matrix is a strategic tool used to analyze a company's product portfolio and make decisions about resource allocation.
BCG stands for Boston Consulting Group, the consulting firm that developed the matrix.
The matrix categorizes a company's products into four categories: stars, cash cows, question marks, and dogs.
Stars are high-growth, high-market-share products that require heavy investment to maintain their positio...
Investments have been made in various areas including technology, infrastructure, and marketing.
Investments have been made in technology to improve our products and services.
Infrastructure investments have been made to expand our reach and improve logistics.
Marketing investments have been made to increase brand awareness and customer acquisition.
Specific examples include investing in a new CRM system, expanding our war...
posted on 27 Oct 2020
I applied via Campus Placement and was interviewed before Oct 2019. There were 4 interview rounds.
posted on 9 Feb 2024
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Topic- future of automobile sector
I was interviewed before Sep 2020.
Round duration - 180 minutes
Round difficulty - Medium
The online test consisted of 2 coding questions, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section had a time constraint.
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.
...Merge two sorted linked lists into a single sorted linked list without using additional space beyond constant space complexity.
Create a dummy node to start the merged list
Iterate through both linked lists and compare nodes to merge them in sorted order
Update the next pointers accordingly
Handle cases where one list is empty or both lists are empty
Return the head of the merged linked list
Consider a 2-dimensional grid 'GRID' with 'N' rows and 'M' columns in Ninjaland. Each cell in the grid has an associated cost. The goal is to determine the minimum path ...
The Minimum Path Sum Problem involves finding the minimum sum of costs along a path from the top-left to the bottom-right of a grid.
Use dynamic programming to calculate the minimum path sum by considering the costs of moving down or right at each cell.
Initialize a 2D array to store the minimum path sum values for each cell in the grid.
Iterate through the grid to calculate the minimum path sum for each cell based on the...
Round duration - 60 minutes
Round difficulty - Medium
My interview was at 9:00 am. The interview was conducted on Amazon Chime and my webcam was on. The interviewer also asked me to write the code on a document which can be edited by both me and the interviewer. The difficulty of the questions was of medium level. I was asked 3 coding questions along with 2 questions related to OOPS at the end. The interview ended with the discussion of one of my projects. The interviewer was good and also gave me hints wherever required.
You are given a string S
. Your task is to partition S
such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...
Given a string, partition it into palindromes and return all possible configurations.
Use backtracking to generate all possible palindrome partitions
Check if each substring is a palindrome before adding it to the partition
Return all valid partitions as an array of strings
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S
without any separators. During this pro...
Find the missing number in a string of consecutive nonnegative integers.
Iterate through the string and check for missing numbers by comparing adjacent integers
If a missing number is found, return it as the output
Handle cases where there are multiple missing numbers or the string is invalid by returning -1
ACID properties in DBMS ensure data integrity and consistency.
Atomicity: All operations in a transaction are treated as a single unit of work, either all succeed or all fail.
Consistency: Database remains in a consistent state before and after the transaction.
Isolation: Transactions are isolated from each other until they are completed.
Durability: Once a transaction is committed, the changes made by it are permanent and...
Tip 1 : You must have a grip over Data Structures and algorithms. Your concepts must be crystal clear. Pick one coding platform and try to practice at least 7-10 coding questions everyday. I completed around 200+ questions on Leetcode, 200+ questions on Geek For Geeks and around 30-40 questions on InterviewBit.
Tip 2 : After attempting any coding problem, analyze its time and space complexity. See, if you can further optimize your solution. You can always check the editorials and compare your solution with it.
Tip 3 : Apart from coding questions keep studying concepts of Operating Systems, databases and object oriented programming. You can always refer to Geeks For Geeks articles for it. Also, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.
Tip 1 : You do not need to have a long list of projects on your resume. One good project with proper knowledge of it will do good. Similarly, do not list down several number of skills. Few skills but roper knowledge of them are enough.
Tip 2 : Do not fake anything on your resume. The interviewer gets to know about it by asking questions. If you aren't able to answer, it leaves a negative impact.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
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.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
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.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
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.
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...
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.
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
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
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.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
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.
The first line ...
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
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.
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.
I was interviewed in Oct 2020.
Round duration - 120 minutes
Round difficulty - Medium
Evening test around 5
Platform :- SHL
Environment was amazing
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.
Check if the second tree is a subtree of the first tree by comparing their structures and node values.
Use a recursive approach to traverse both trees and check for equality.
Handle cases where one tree is null or the values do not match.
Return true if S is a subtree of T, false otherwise.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted N*N matrix, find the position of a target integer X.
Iterate over each row and column to find the target integer X
Utilize the sorted nature of the matrix to optimize the search process
Return the position of X if found, else return -1 -1
Round duration - 60 minutes
Round difficulty - Medium
1 Hour
Afternoon
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
Given a Binary Search Tree (BST) and an integer 'S', your task is to find all pairs of nodes within the BST that total to 'S' and return these pairs. If no such p...
Find pairs of nodes in a BST that sum up to a given value 'S'.
Traverse the BST in-order to get a sorted list of nodes.
Use two pointers approach to find pairs with sum 'S'.
Keep track of visited nodes to avoid using the same node twice in a pair.
Round duration - 60 minutes
Round difficulty - Medium
Online Round held on Chime
You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.
The first line of input contains an integer ‘T’ denoti...
Determine if a given binary tree is a binary heap tree or not based on certain properties.
Check if the binary tree is a complete binary tree where every level, except the last level, is completely filled and the last level is as far left as possible.
Ensure that every parent node is greater than all its children nodes, forming a max-heap.
If any node does not have a left or right child, it should be represented as -1 in
Given two strings S
and T
with lengths N
and M
respectively, your task is to find the "Edit Distance" between these strings.
The Edit Distance is defined as the minimum nu...
The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the edit distances between substrings of the two input strings.
Fill up the array based on the minimum of three possible operations: insert, delete, or replace.
The final answer will be the value at...
Tip 1 : 1 Programming Language
Tip 2 : Practice Data Structures with atleast 300 ques.
Tip 3 : CS Fundamental
Tip 1 : 1 Pager
Tip 2 : Add top 3 projects in Resume.
based on 2 interviews
Interview experience
based on 12 reviews
Rating in categories
Assistant Manager
129
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
101
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive Corporate Sales
96
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
79
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager Corporate Sales
78
salaries
| ₹0 L/yr - ₹0 L/yr |
Info Edge
Quikr
Foundit
Times Business Solutions