First round interview asked to write program that took a file of text, and then counted and stored all words from file.
Software Development Programmer Interview Questions
33,200 software development programmer interview questions shared by candidates
Given any two nodes in a binary tree, develop program that determined their highest common ancestor.
I applied online and set me a 30 min on phone interview. There are two data structure questions and some other questions about course projects I have done.
Round 1. Tweaked version of this - https://www.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1 Given a tree, find bottom view - 1 / \ 3 2 / \ / \ 4 5 6 7 Expected output - 4 3 5 6 2 7 (Not 4 3 6 2 7)
How would you read data from a huge file?
Write 4 locker functions: acquire_read_lock, acquire_write_lock, release_read_lock, release_write_lock. Use Windows specific helper functions. 1 more brain teasing puzzle.
Implement a stack.
Print a matrix in spiral fashion...so Matrix input example (Arrows indicate how the spiral happens...start at first arrow go in circle and move to next arrow...etc.) ->1 1 1 1 1 1 -> 2 2 2 1 1 2 2 2 1 1 1 1 1 1 Output: 11111111111111222222
a) Develop a XML parser (rules: Node closures and single root node..i.e. root node cannot be duplicated in structure). b) Count occurrences of words in a string (with string too large to be processed in memory).
Duck in the pond. Start: Duck located in the center of circle (pond). Fox is on the beach and cannot swim. Duck cannot fly (by some reason), but once duck is on the beach, she will fly away. Duck speed - x Fox speed - 4x Can duck escape? Why?
Viewing 1981 - 1990 interview questions