R1: There were 3 question, (2 Medium + 1 Hard) - Q1: Graph + BFS - Q2: https://leetcode.com/problems/mirror-reflection/description/ - Q3: DP R2: Design a resume parser and resume bank where user can search for keywords among the datastore of resumes. R3: Foundational CS concepts + Some discussion around Kafka & SQS + SAGA Patterns + previous projects
Complete the home task on the code they provide.
Build an API for managing a filmstore using Java or Kotlin.
- Conhece a empresa? - Cite um problema que se orgulhe de ter resolvido.
Vantagens e desvantagens de banco relacional vs não relacional
easy Tree questions, like building BST from sorted array this is the medium question, https://leetcode.com/problems/find-peak-element/description/
Describe your previous experience and projects you worked on.
Qué me motivaba a cambiar de trabajo y mi experiencia reciente y relevante.
Check if string contains the exact same number of repetitions of every character. I.e. "aabb" - true, "aabbc" - false. Then check if removing a single character from the string can make it valid, i.e. "aabbc" - true, "aaabbbcc" - false
Code base to modify. It had tests
Viewing 1991 - 2000 interview questions