Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2024. There was 1 interview round.
I am a detail-oriented and experienced Purchase Executive with a strong background in procurement and supply chain management.
Over 5 years of experience in purchasing and procurement
Skilled in negotiating contracts and managing vendor relationships
Proficient in analyzing market trends and optimizing purchasing strategies
Strong communication and organizational skills
Previous experience in sourcing raw materials for manu
During my work experience, I have achieved significant cost savings through strategic vendor negotiations and implemented efficient procurement processes.
Negotiated favorable contracts with suppliers resulting in 15% cost savings
Implemented inventory management system reducing excess stock by 20%
Streamlined procurement process leading to 30% faster order processing
Received recognition for outstanding performance in red
I am currently managing a variety of high-class items including luxury cars, designer clothing, fine jewelry, high-end electronics, and gourmet food items.
Luxury cars
Designer clothing
Fine jewelry
High-end electronics
Gourmet food items
Top trending discussions
posted on 17 Feb 2025
I appeared for an interview in Jan 2025.
I applied via Company Website
Related to aadhaar work
Ask to aadhaar related question
I applied via Referral and was interviewed in Nov 2023. There were 4 interview rounds.
Easy MCQ based on job type
My current CTC is confidential and I prefer not to disclose it.
I am not comfortable sharing my current compensation details.
I believe my value is based on my skills and experience, not my current salary.
I am open to discussing salary expectations for this role.
I expect a competitive salary based on my experience, skills, and the responsibilities of the Senior Executive role.
I have extensive experience in leading teams and driving business growth, which warrants a higher salary.
I have a proven track record of successfully implementing strategic initiatives and achieving targets.
I have strong negotiation and communication skills, which are valuable in senior executive roles.
I ...
posted on 21 Feb 2022
I applied via Campus Placement and was interviewed before Feb 2021. There were 2 interview rounds.
I appeared for an interview before Mar 2021.
Round duration - 30 minutes
Round difficulty - Medium
This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.
Round duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate all valid configurations and print them out.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Detect if a given linked list is circular by checking if it forms a closed loop.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, the linked list is circular.
If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Junior Engineer
6
salaries
| ₹3 L/yr - ₹9.6 L/yr |
Electrical Technician
5
salaries
| ₹3 L/yr - ₹7.2 L/yr |
Service Engineer
5
salaries
| ₹6.5 L/yr - ₹12 L/yr |
Instrument Engineer
4
salaries
| ₹9.5 L/yr - ₹16 L/yr |
Senior Executive - Finance
4
salaries
| ₹8 L/yr - ₹12 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions