Filter interviews by
Clear (1)
Setting a bit and using function pointers in software development.
To set a bit, use bitwise OR operator: num |= 1 << bitPosition
To create function pointers, declare a pointer variable and assign the address of the function to it
Example: int num = 0; num |= 1 << 2; // Sets the 3rd bit
Example: void (*funcPtr)() = &someFunction; // Function pointer to 'someFunction'
I applied via Recruitment Consulltant and was interviewed in Sep 2021. There were 5 interview rounds.
Top trending discussions
I was interviewed in Oct 2016.
My hobbies include hiking, playing guitar, and cooking.
Hiking: I enjoy exploring nature trails and challenging myself physically.
Playing guitar: I love learning new songs and improving my skills.
Cooking: I like experimenting with different recipes and creating delicious meals.
In 5 years, I see myself as a senior software developer leading a team and working on complex projects.
Leading a team of developers
Working on complex projects
Continuously learning and improving my skills
Contributing to the growth and success of the company
I want to join DELL because of their innovative technology solutions and strong reputation in the industry.
DELL is known for their cutting-edge technology solutions which align with my passion for software development.
I admire DELL's strong reputation in the industry and their commitment to customer satisfaction.
I believe joining DELL will provide me with opportunities for growth and career advancement.
I was interviewed in Jan 2017.
I was interviewed in Sep 2016.
I was interviewed before Nov 2020.
Round duration - 90 Minutes
Round difficulty - Medium
It was in the morning at our institute. There were technical and aptitude problems.
Develop a function to print star patterns based on the given number of rows 'N'. Each row in the pattern should follow the format demonstrated in the example.
The picture illustra...
Function to print star patterns based on the given number of rows 'N'.
Iterate through each row from 1 to N
For each row, print spaces (N-row) followed by stars (2*row-1)
Repeat until all rows are printed
Round duration - 30 Minutes
Round difficulty - Medium
It was actually a Techno HR round. I was asked some technical questions about OS, OOPS, COMPUTER NETWORKING, WEB DEVELOPMENT. He went through my whole resume, asked about all the projects and past working experiences. The interviewer was really good, we talked about so many other topics, from Women empowerment to Water Crises. I felt really confident while speaking because he made me so comfortable.
Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of ...
Selection Sort Algorithm sorts an array by repeatedly finding the minimum element and placing it at the beginning of the unsorted part.
Iterate through the array to find the minimum element and swap it with the first unsorted element.
Repeat this process for each element in the array until it is fully sorted.
Time complexity of Selection Sort is O(n^2) making it inefficient for large arrays.
Tip 1 : Study data structures thoroughly and practice coding regularly. Do practice it on Leetcode as it has a lot of test cases, I personally find it really helpful.
Tip 2 : Learn new skills and make projects with them to get the most out of them.
Tip 3 : Do study other basic and very important subjects like Oops, DBMS, OS.
Tip 1 : Do mention your achievements and other co curricular activities.
Tip 2 : Your projects are a big highlight, keep them crisp and be prepared to explain them thoroughly.
I was interviewed before May 2021.
Round duration - 24 hours
Round difficulty - Easy
It was a hackathon we were given a problem statement and we had to solve that within 2 days. There were team of 4 people.
The design process for building a chatbot involves defining user goals, choosing a platform, designing conversation flow, implementing natural language processing, and testing for accuracy.
Define user goals and objectives for the chatbot
Choose a platform or framework for building the chatbot (e.g. Dialogflow, Microsoft Bot Framework)
Design the conversation flow and user interactions
Implement natural language processing...
Round duration - 15 minutes
Round difficulty - Easy
HR round
Tip 1 : Do Quants everyday
Tip 2 : Work on your communication skills
Tip 3 : Competitive coding
Tip 1 : don’t brag
Tip 2 : wrote the skills you have
I was interviewed in Feb 2021.
Round duration - 120 minutes
Round difficulty - Easy
Round duration - 90 minutes
Round difficulty - Medium
The round contains mcqs on core java , javascript , oops and two coding questions of data structures.
The exam was at 7pm
Platform was good
Given a 2-dimensional array ARR
with 'N' rows and 'M' columns, and a set of queries in a 2-dimensional array Queries
of size 'K', each query contains four integers that denote the top-...
Given a 2D array and a set of queries, find the sum of elements within specified submatrices for each query.
Parse input to get array dimensions, elements, and queries
Iterate through queries and calculate sum of elements within specified submatrix
Output the sum for each query
You are given a string named str
and an integer D
. Your task is to perform both left (anticlockwise) and right (clockwise) rotations on the given string by D
units, start...
Implement functions to perform left and right rotations on a given string by a specified number of positions.
Implement a function leftRotate() to perform left rotation on the string by D units.
Implement a function rightRotate() to perform right rotation on the string by D units.
Return the modified string after each rotation.
Ensure to handle cases where D can be greater than the length of the string.
Tip 1 : Good knowledge of basics of data structure.
Tip 2 : Question need to be done with optimized time complexity until you won't be able to pass all test cases.
Tip 1 : Atleast one good project
Tip 2 : Specially mention Java and JavaScript
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
They asked to find the elements which are present more than once. I solved it using map in c++
My favorite algorithm is Dijkstra's algorithm for finding the shortest path in a graph.
Dijkstra's algorithm is a greedy algorithm that finds the shortest path between nodes in a graph.
It works by maintaining a priority queue of nodes to visit next, updating the shortest distance to each node as it explores the graph.
The algorithm is commonly used in routing and network optimization.
Example: Finding the shortest route b
Deadlocks occur when two or more processes are unable to proceed because each is waiting for the other to release a resource.
Resource deadlocks: Processes hold resources and wait for others to release resources. Example: Process A holds resource X and waits for resource Y, while Process B holds resource Y and waits for resource X.
Communication deadlocks: Processes wait for messages from each other indefinitely. Example...
Developed a web application for online shopping with user authentication and payment gateway integration.
Implemented user authentication using JWT tokens
Integrated Stripe API for payment processing
Designed responsive UI using React and Bootstrap
I was interviewed in Jun 2024.
Electrical engineering
Power system machine power electronics
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Development Engineer
207
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Specialist
201
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
82
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Area Sales Manager
67
salaries
| ₹0 L/yr - ₹0 L/yr |
Havells
SYSKA LED Lights
Wipro Consumer Care & Lighting
Crompton Greaves Consumer Electricals