Different Sorting Algorithms and Big O of each
Software Development Interview Questions
36,976 software development interview questions shared by candidates
Graph Coloring problem: given a connected graph, color each node in the graph such that no two adjacent nodes have the same color.
implement atoi
Determine whether a given binary tree is fully populated, where "fully populated" means that every internal node has exactly two children, and all terminal nodes are at the same depth.
Write a function that checks if a number's divisors sum up to that number, i.e. whether it's a perfect number or not.
Consider two arrays of integers, v1 and v2, with allocate memory of (n+m)*sizeof(int) and m*sizeof(int), respectively; In array v1, you have the first n positions filled with integers, sorted in ascendent order. In array v2, you have all m positions filled with integers, also sorted in ascendent order. Write/implement a function that return a vector of size (n+m)*sizeof(int) that have all the elements of v1 and v2, sorted in an ascendent order
given binary tree inorder & preorder traversal, return postorder traversal
Find a convergence point if any in given two linked lists.
Discuss 5 critical points for the usage and functionality of a ceiling fan.
Write a program in java that determines whether a string is a palindrome.
Viewing 601 - 610 interview questions