ByteDance (Singapore) - NLP Engineer | Round-1 | Reverse Linked List, Merge k sorted linked list
2582

This round was primarily based on Coding and there were a total of two questions:

  1. Reverse a linked-list (be sure to ask follow-up questions to get calrity especially in the easy questions like these) | link: https://leetcode.com/problems/reverse-linked-list/
  2. Given k-sorted linked lists, merge them into a single linked list keeping the sorting intact. | | link: https://leetcode.com/problems/merge-k-sorted-lists/

There were quite a number of questions one can ansk in these questions to get the clarity as to what exactly are they looking for.

Solved both in about 30mins on a shared code-pad.

Then there were questions on ML basics and some indepth like:

  1. How Decision tree works.
  2. Whats' overfitting, how to take care of that.
  3. Bias and Variance.
  4. Different word-embedding technologies.
  5. L1 vs L2 regularizations.

Then the interviewer discussed about the work they are doing and the challenges one tries to solve day in and day out.

Comments (7)