BuyHatke visited our campus for internship and full time. I took part in the internship drive and I am sharing my experience here. Around 200 students shortlisted for an online round on the basis of their Resume.
Interview Consist of 3 rounds.
Round 1: Online Coding round
1. All distinct triplets whose sum equal to 0 – https://www.geeksforgeeks.org/find-triplets-array-whose-sum-equal-zero/
2. Zigzag string Conversion – https://www.geeksforgeeks.org/print-concatenation-of-zig-zag-string-form-in-n-rows/
3. Mark all Hamiltonian Cycle
4. Find a first non-repeating character in a stream of characters – https://www.geeksforgeeks.org/find-first-non-repeating-character-stream-characters/
(In 4th question if first non-repeating character if not found print ‘#’)
Students solved 3 questions completely are moving to the next round.
I managed to solve all four questions.
25 students selected for the next Technical round (including me).
Round 2: Technical Interview round
They have 5 Panel who taking Interviews on Skype.
He starts with Coding Questions.
Question on arrays
1. Finding a peek element in the array – Return any Element greater than it’s adjacents.
I was given a binary search solution and he was satisfied. Complexity (Log n)
Question on Bit manipulation
2. Given a number and integer K. Return a number after offsetting all the bits after K in the binary representation of the given number But without any kind of loop or recursion.
He was trying to ask me to do using Bit manipulation only.
Eg. num-15 K=2
1111 after offsetting all the bits after K position – 0011
My solution: Num & (pow(2,K)-1). complexity- O( Logn) because pow function use faster exponentiation method
The interviewer asked me in O( 1) time.
Question on graph
3. Given a Directed positive weighted graph with source and destination node. Return the minimum
weight to reach the destination node. But its compulsory to take one or more paths in between
to reach the destination node. (In the least Complexity).
I suggested a Floyd warshall algorithm for a graph.
Now we have all pair shortest path for a graph. Now we have to find that non-destination node which is at the least distance to destination and source, return addition of both distances. Complexity- O(N^3)
He was not satisfied with the time complexity.
He gave me a Hint: This problem, you need to run four times Dijkstra Algorithm.
But I was unable to answer it.
As a result, I was rejected and I was not happy But When I get to know that all 25 students are rejected, Then I feel a little bit better (Just Kidding ). Although I get rejected but learn a lot.
I would like to thanks Geeksforgeeks and I practiced from here from the last 1 year. Initially, I practiced topic wise, later when I was confident enough I started practicing company-wise. Also, I made it a habit to read at least one interview experience from gfg daily.
- BuyHatke interview experience (On-campus for 6 months internship)
- BuyHatke Interview Experience | FTE - Campus Placement
- BuyHatke Interview Experience | On-Campus For Internship
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- UHG Interview Experience | OnCampus- 2019
- InfoEdge Interview Experience | OnCampus-2019
- AppDynamics Interview Experience | On Campus (Virtual) July 2020
- Morgan Stanley Interview Experience | On Campus (Virtual) July 2020
- Qualcomm Interview Experience (July 2020 - Virtual)
- Deutsche Bank Interview Experience for Graduate Analyst (On-Campus FTE July 2020 )
- Morgan Stanley Interview (On campus Virtual) July 2020
- Robert Bosch Interview Experience | Set 5 (July 2017 On-Campus)
- TCS Interview Experience | On July 10th
- Walmart Labs Interview Experience | July 2019
- SAP Labs Interview Experience | On campus-2019 july
- Citrix Interview Experience (On-Campus) | July 2019
- Zilingo Interview Experience - July 2019, Bangalore
- Livspace Interview Experience | SDE-1 Bangalore | July 2019 [Offer]
- Persistent System Interview experience ( On Campus Drive July-August 2019)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.