Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Synopsys (Colombo, ) nel mese di giu 2021
Colloquio
There were two interviews. Both of them based on data structures and algorithms. BST, Linked Lists, Arrays, Hash sets. The first interview lasted for about 1 hour. The first interview was conducted by a senior engineer. The second interview was conducted by two senior engineers. That interview lasted for almost 2 hours. Both interviews were conducted online due to the pandemic.
Domande di colloquio [1]
Domanda 1
Tree Travasal.
Linked Lists.
Arrays.
Pointers in C++
Hash sets.
Hash maps.
Big O
Ho sostenuto un colloquio presso Synopsys (Bengaluru)
Colloquio
One telephonic phone interview, followed by two technical and one manergial plus one HR round. Technical rounds were mostly easy. More focus was on overall knowledge and design. Most of the people working were veterans, and had indepth knowledge of their expertise area.
Domande di colloquio [1]
Domanda 1
What was the most challenging problem you solved on your current job
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 4 giorni. Ho sostenuto un colloquio presso Synopsys (Noida) nel mese di apr 2024
Colloquio
There were 4 interview rounds, and based on the teams work mostly questions were asked around C++ and OOPS.
They focused on trees and linked list in problem solving DSA.
Domande di colloquio [6]
Domanda 1
Merge 2 sorted linked lists into a single sorted linked list in place.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Synopsys nel mese di ott 2023
Colloquio
five virtual technical rounds on zoom call. one face to face HR round. Process took almost a month time. good experience. smooth process. revolved around C++ and DSA questions mainly.
Domande di colloquio [1]
Domanda 1
I was interviewed for a C++ role. Many ques regarding the same were asked example virtual functions, pointers, dynamic memory allocation etc. For DSA, medium level leetcode questions. Focused more on Binary Search Trees and little bit on Graph traversals also.
