Technicall interview by Turing

Result
Rejected
Posted
5 Nov 2023
298 reads

Summary

I recently had a technical interview with Turing, where I was asked to solve a LeetCode problem and answer several Java technical questions, ultimately resulting in a harsh rejection.

How it went

I recently attended a technical interview with Turing. The first part of the interview involved solving a LeetCode question. I managed to solve it without any issues.

Following that, I faced a round of Java technical questions. These included topics like immutability and multithreading. Unfortunately, the interviewer was extremely critical of my answers. After a couple of questions about the Collections API, the interviewer told me I was "too stupid" to answer correctly, advised me to prepare better, and then abruptly closed the Zoom session.

Questions asked (3)

  1. 01

    Longest Consecutive Sequence

    Data Structures & Algorithms · Medium

    Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time.

    Open the problem
  2. 02

    How to make a Java class immutable

    Other

    Explain how to make a Java class immutable. The interviewer seemed to expect a specific approach involving extending a class, rather than just using the final keyword.

  3. 03

    Java Threads: Explanation and Interaction

    Other

    Explain how threads work in Java, their operational mechanisms, and how they interact. This included discussing the differences between .run() / .sleep() vs .wait(), the usage of notify(), and the synchronized keyword.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Turing recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!