Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2022. There were 2 interview rounds.
Packing efficiency refers to the amount of space occupied by atoms/molecules in a crystal lattice. Deficiency defect is a type of crystal defect.
Packing efficiency is the ratio of the volume occupied by atoms/molecules to the total volume of the unit cell.
It can be calculated using the formula: Packing efficiency = (Volume of atoms/molecules in unit cell) / (Total volume of unit cell)
Deficiency defect is a type of poin...
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Packing efficiency is the ratio of the volume occupied by particles to the total volume of the container. Limiting reagent is the reactant that gets consumed first and limits the amount of product formed. Aspirin can be prepared from phenol by acetylation using acetic anhydride and a catalyst.
Packing efficiency is important in determining the density of a material.
Limiting reagent can be identified by calculating the a...
Sandmeyer's reaction is a chemical reaction used to convert an aryl diazonium salt to a halide, hydroxide, or cyano compound.
Involves the replacement of the diazonium group (-N2+) with a halogen, hydroxyl, or cyano group.
The reaction is carried out in the presence of a copper(I) salt and an acid.
The reaction can be used to synthesize a variety of compounds such as chlorobenzene, bromobenzene, iodobenzene, phenol, and b...
Top trending discussions
The person can escape the island by creating a firebreak or finding a body of water.
Create a firebreak by clearing a path of grass around oneself to prevent the fire from spreading.
Look for a body of water such as a lake, river, or ocean to escape the fire.
If no water source is available, try to find a sheltered area with less dry grass to wait for the fire to pass.
Use any available tools or materials to help create a
I did my internship at XYZ Corporation.
Interned at XYZ Corporation
Worked in the marketing department
Assisted in creating social media campaigns
Conducted market research
Attended meetings with clients
I learned to take responsibility for my actions and to use my mistakes as opportunities for growth.
I learned to admit my mistakes and apologize when necessary
I learned to reflect on my mistakes and identify areas for improvement
I learned to seek feedback from others and use it to make positive changes
I learned to not be afraid of failure and to view it as a learning experience
For example, when I made a mistake at work ...
I have the skills, experience, and passion to contribute to the success of your company.
I have a proven track record of achieving targets and exceeding expectations.
I possess strong communication and interpersonal skills, which enable me to work effectively with colleagues and clients.
I am a quick learner and adaptable to new environments and technologies.
I am passionate about the industry and eager to contribute to th...
I am not currently planning on getting married.
I am currently focused on my career and personal growth.
Marriage is not a priority for me at this time.
I believe in taking the time to find the right person and building a strong foundation before getting married.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 2 reviews
Rating in categories
TCS
Accenture
Wipro
Cognizant