Technical phone interview consisted Questions on C++-related topics like inline, reference, etc, OS, STL
C Software Developer Interview Questions
1,022 c software developer interview questions shared by candidates
Signal & Slots, its internal working and different types of connection? and what is event loop? can we connect signal to signal? return type of Connect statement? different type of connect statements? where to use queued connection? Design Signal and slot?
C++11 standards? what is new features and Lambda function where/when/why needed? How to connect signal to Lambda function?
Add/Subtract/Multiply/Swap two no without using +/-/*/third var? These are common question you can prepare for all any of them will be asked
Implement a Read-Write lock
Typical leetcode medium and one hard question
First round: Hackerrank Test. Question: Given a string which contains only A and B, remove all the occurrences of AB and BB until the string doesn't contain any of these 2 substrings. Return the length of the original string after removing all the occurrences of the above substring. eg: "ABAABBA" answer: 1 2nd Round: One-on-One Interview(Online) Questions: What is a dangling pointer? In what scenario does a pointer become dangling? What was your role in your previous company? What features did you work on for the project in previous company? What were some mistakes you made and how did you correct them? 2 predict the output questions: int a=1; print("%d\n",(a++)*(++a)); char *p = 'a'; delete a; 2 coding questions: Print a singly linked list in reverse order(A:Recursion) How to detect a loop in a linked list(A: Hare and Tortoise Algo) (Avoid using extra space) What are some projects you did and explain the one you liked. After receiving the offer: HR Assesment: Cognitive Analysis and Psychological analysis test(30 mins non-proctored simple test)
Discussed regarding ASP.NET MVC and Windows applications experience
Simple coding test
Shortest path in graph: /// /// graph is a function that accepts the node name, and int*. It returns the /// neighbors of the node and the length of the neighbors in the int* /// /// Name of start node /// Name of goal node /// /// The shortest path with format start->...->goal char *shortestPath(Inner *(*graph)(const char *, int *), const char *start, const char *goal) { // int neighborsLength; // Inner *neighbors = graph(start, &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl; // neighbors = graph(neighbors[0].name.c_str(), &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl;
Viewing 671 - 680 interview questions