Filter interviews by
I applied via Company Website and was interviewed before Aug 2020. There were 3 interview rounds.
My best part in physics is quantum mechanics.
Quantum mechanics deals with the behavior of particles at the atomic and subatomic level.
It explains phenomena such as wave-particle duality, superposition, and entanglement.
Applications of quantum mechanics include quantum computing, cryptography, and quantum teleportation.
Famous experiments in quantum mechanics include the double-slit experiment and the Schrödinger's cat t
Top trending discussions
I appeared for an interview in Dec 2017.
I applied via Walk-in and was interviewed before Nov 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Sep 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
posted on 24 Mar 2021
I applied via Naukri.com and was interviewed before May 2021. There were 5 interview rounds.
I appeared for an interview before Dec 2020.
Round duration - 120 Minutes
Round difficulty - Medium
Ninja, a new member of the FBI, has acquired some 'SECRET_INFORMATION' that he needs to share with his team. To ensure security against hackers, Ninja dec...
The task is to encode and decode 'SECRET_INFORMATION' for security purposes and determine if the transmission was successful.
Read the number of test cases 'T'
For each test case, encode the 'SECRET_INFORMATION' and then decode it
Compare the decoded string with the original 'SECRET_INFORMATION'
Print 'Transmission successful' if they match, else print 'Transmission failed'
Round duration - 60 Minutes
Round difficulty - Medium
Given an array Arr
consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...
Find the equilibrium index of an array where sum of elements on left equals sum on right.
Iterate through the array and calculate prefix sum and suffix sum at each index.
Compare prefix sum and suffix sum to find equilibrium index.
Return the left-most equilibrium index or -1 if none found.
Round duration - 50 Minutes
Round difficulty - Easy
Tip 1 : Focus more on SQL
Tip 2 : Keep up with ongoing projects in the company
Tip 1 : Be honest about what you add.
Tip 2 : Don't forget to mention extra curriculars.
TCS
Accenture
Wipro
Cognizant