I have been in so many interviews and was asked so many interesting questions that I have decided to collect those questions, I started this habit because I think every C# .Net Developer needs to know the answers to those questions, so whenever you have an interview or whenever you need to refresh your memory please stop by and answer these questions :).. I have answered all those questions previously however I will not include any answers to these questions nor will I mention companies’ names.
Warm-ups:
- What are the qualities of good code?
- How do you explain a complex technical term to a non-technical person? For example excel sheets?
- What's a recursive function?
- What is a bitwise operator?
- What was the first OOL?
- Is-a versus has-a relationships (with examples)
- Composition vs. aggregation relationships
- What is a Method Signature?
- What is strong-typing versus weak-typing? Which is preferred? Why?
General OOP Questions:
- What is an Object?
- What is a Class?
- Why OOP?
- What is a delegate?
- Overloading Vs Overriding with examples?
- What are the three most important features of OOP with examples?
- Describe the difference between Interface-oriented, Object-oriented and Aspect-oriented programming.
- Describe what an Interface is and how it’s different from a Class. Also Interface Vs Abstract Class?
- C# oop Vs. vb.net oop
- What is strong-typing versus weak-typing? Which is preferred? Why?
- Linked list, Hash table, Stack, Queue, Binary tree, Binary search tree: Explain?
- What's the difference between a linked list and an array?
- How would you describe encapsulation?
Algorithims:
- Write a function to find the middle node of a single link list
- What is the Big O notation?
- What is the best and worst performance time for a hash tree and binary search tree?
- What is the best and worst time for the operation 'equals' (Strings)
- Order the functions in order of their asymptotic performance
* 2^n, * n^Googol ( 10^100), * n!, * n^n - Implement an algorithm to sort a linked list. Why did you pick the method you did? Now do it in O(n) time.
- Write a code to delete any node in a link list. With all test cases and boundary conditionsThe Traditional Method
- Write a function to reverse a string
- Write function to compute Nth fibonacci number
- Print out the grade-school multiplication table up to 12x12
- Write a function that sums up integers from a text file, one int per line
- Write function to print the odd numbers from 1 to 99
- Find the largest int value in an int array
- Format an RGB value (three 1-byte numbers) as a 6-digit hexadecimal string
- Write a function that inserts an integer into a linked list in ascending order.
- Implement a linked list. Why did you pick the method you did?
- Describe advantages and disadvantages of the various stock sorting algorithms.
- Implement an algorithm to reverse a linked list. Now do it without recursion.
- Implement an algorithm to insert a node into a circular linked list without traversing it.
- Implement an algorithm to sort an array. Why did you pick the method you did?
- Write routines to read and write a bounded buffer.
- Write routines to manage a heap using an existing array.
- How would you find a cycle in a linked list?
- Describe the algorithm for a depth-first graph traversal
- How would you find the nth to last element in a linked list?
- Given two binary trees, find whether or not they are similar.
- You have a tree (not Binary) and you want to print the values of all the nodes in this tree level by level.
- Reverse a linked list iteratively, do it first with single pointers and then do it again with double pointers. Now do it again recursively but not tail-recursive, and then do it again tail-recursively. What do you do if it has a loop?
- How would you write qsort?
- Describe Sorting algorithms and their complexity - Quick sort, Insertion Sort, Merge Sort, Heap Sort, Bubble Sort, and Selection Sort
If you had a million integers how would you sort them and how much memeory would that consume? - Tree search algorithms. Write BFS and DFS code, explain run time and space requirements. Modify the code to handle trees with weighted edges and loops with BFS and DFS, make the code print out path to goal state.
- Remove the Duplicates from an Array.
- Reverse a string preserving the words in the string
Eg.Input = “Heros Happen Here”.Output = “Here Happen Heros”. - Find the deepest level in a tree and return its depth. Hints and assumptions: its a binary tree.
- An array of n number of elements for example from 0 --> n write a function that returns true if each element from 1-->n exists in the array once.
eg: {3,4,2,1} returns true{3,2,3,2} return false; - Implement a Queue Using 2 Stacks in order of Constant time..
Hint: you only need to implement the Enqueue and the DeQueue functionsAssumtion a stack class already exists the stack class has push, pop and isEmpty methods and i will use them here
