Skip to contentSkip to footer

Programador De Net C Interview Questions

Salaries
Interviews

3,524 programador de net c interview questions shared by candidates

during the first interview asked about OOP in C++, memory management in C++, standrards overview (11/14 at the moment). At first interview I've found, explained and fixed a problem in existing code (problem related to OOP and memory management), the seconds one task was about implementation of own smart pointer and right memory allocation/deallocation in different situations. At next interviews I got a set of short algoritmic questions, like a summ of binary trees, deep copy of randomly linked list, etc. duration of tech interviews was ~45min
avatar

C++ Developer

Interviewed at Luxoft

3.7★
Aug 12, 2024

during the first interview asked about OOP in C++, memory management in C++, standrards overview (11/14 at the moment). At first interview I've found, explained and fixed a problem in existing code (problem related to OOP and memory management), the seconds one task was about implementation of own smart pointer and right memory allocation/deallocation in different situations. At next interviews I got a set of short algoritmic questions, like a summ of binary trees, deep copy of randomly linked list, etc. duration of tech interviews was ~45min

1) https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/global-maximum/?utm_source=header&utm_medium=search&utm_campaign=he-search 2) Connected sum problem on Graphs: Given a number of nodes and a list of connected pairs, determine the weights of each isolated set of nodes assuming each node weights 1 unit. Then for each weight calculated, sum the ceiling of its square root and return the final sum. Eg: Graph_nodes = 10 Graph_from=[1,1,2,3,7] Graph_to=[2,3,4,5,8] like: 1>2, 1>3, 2>4, 2>5, 7>8, .. 6,9,10 are isolated
avatar

C++ Developer

Interviewed at KLA

4★
May 11, 2021

1) https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/global-maximum/?utm_source=header&utm_medium=search&utm_campaign=he-search 2) Connected sum problem on Graphs: Given a number of nodes and a list of connected pairs, determine the weights of each isolated set of nodes assuming each node weights 1 unit. Then for each weight calculated, sum the ceiling of its square root and return the final sum. Eg: Graph_nodes = 10 Graph_from=[1,1,2,3,7] Graph_to=[2,3,4,5,8] like: 1>2, 1>3, 2>4, 2>5, 7>8, .. 6,9,10 are isolated

Viewing 2631 - 2640 interview questions

Glassdoor has 3,524 interview questions and reports from Programador de net c interviews. Prepare for your interview. Get hired. Love your job.