Software Engineer Interview Coding Questions
Software Engineer Interview Questions: Here are a few interview questions a software developer is usually asked by an interviewer. The motive of asking these questions is to analyze not only his technical skills but also to check other important skills needed for a developer. In this post, we’ll go over the 6 most common types of interview questions for onsite interviews so that you’ll never go into a coding interview unprepared. Whiteboard Interview Questions. Despite the onslaught of other forms of interviewing, whiteboard interviews still reign when it comes to testing software engineers.
Common software engineering interview questions can vary greatly depending on the type of work a person is looking for within the information technology (IT) industry. Software engineering can cover a wide range of positions, and these different positions will likely have different interview questions. Someone interested in programming or writing code, for example, should expect questions about syntax and programming in various languages, while someone looking to work in software testing will often be asked about documentation and testing procedures. There are also software engineering interview questions that will typically be based on a person’s previous experience and certification in working with different software.
Software engineering interview questions are those questions that will typically be asked of someone interested in employment as a software engineer. A software engineer can do many different things in different companies and aspects of the IT industry, and so the questions someone should expect can also vary quite widely. In general, an applicant should expect software engineering interview questions specific to the job he or she is interested in and with regard to his or her previous experience.
General
Find the most frequent integer in an array
Find pairs in an integer array whose sum is equal to 10 (bonus: do it in linear time)
Given 2 integer arrays, determine of the 2nd array is a rotated version of the 1st array. Ex. Original Array A={1,2,3,5,6,7,8} Rotated Array B={5,6,7,8,1,2,3}
Write fibbonaci iteratively and recursively (bonus: use dynamic programming)
Find the only element in an array that only occurs once.
Find the common elements of 2 int arrays
Implement binary search of a sorted array of integers
Implement binary search in a rotated array (ex. {5,6,7,8,1,2,3})
Use dynamic programming to find the first X prime numbers
Write a function that prints out the binary form of an int
Implement parseInt
Implement squareroot function
Implement an exponent function (bonus: now try in log(n) time)
Write a multiply function that multiples 2 integers without using *
HARD: Given a function rand5() that returns a random int between 0 and 5, implement rand7()
HARD: Given a 2D array of 1s and 0s, count the number of 'islands of 1s' (e.g. groups of connecting 1s)
Strings
Find the first non-repeated character in a String
Reverse a String iteratively and recursively
Determine if 2 Strings are anagrams
Check if String is a palindrome
Check if a String is composed of all unique characters
Determine if a String is an int or a double
HARD: Find the shortest palindrome in a String
HARD: Print all permutations of a String
HARD: Given a single-line text String and a maximum width value, write the function 'String justify(String text, int maxWidth)' that formats the input text using full-justification, i.e., extra spaces on each line are equally distributed between the words; the first word on each line is flushed left and the last word on each line is flushed right
Trees
Implement a BST with insert and delete functions
Print a tree using BFS and DFS
Write a function that determines if a tree is a BST
Find the smallest element in a BST
Find the 2nd largest number in a BST
Given a binary tree which is a sum tree (child nodes add to parent), write an algorithm to determine whether the tree is a valid sum tree
Find the distance between 2 nodes in a BST and a normal binary tree
Print the coordinates of every node in a binary tree, where root is 0,0
Clever license plate frames. Glass Diamond Car License Plate Frame – 2 Pack Handmade Sparkly Bling Chrome Rhinestone Stainless Steel Metal Frames For Women & Men Cars Plates. AA SS16 Glitter Crystal (Glass Diamond. Find and save ideas about Funny license plate frames on Pinterest. Shop Clever License Plate Frames from CafePress. Find great designs on durable and weather resistant License Plate Frames to make your car stand out! Free Returns 100%.
Print a tree by levels
Given a binary tree which is a sum tree, write an algorithm to determine whether the tree is a valid sum tree
Given a tree, verify that it contains a subtree.
HARD: Find the max distance between 2 nodes in a BST.
HARD: Construct a BST given the pre-order and in-order traversal Strings
Stacks, Queues, and Heaps
Implement a stack with push and pop functions
Implement a queue with queue and dequeue functions
Find the minimum element in a stack in O(1) time
Write a function that sorts a stack (bonus: sort the stack in place without extra memory)
Implement a binary min heap. Turn it into a binary max heap
HARD: Implement a queue using 2 stacks
Linked Lists
Implement a linked list (with insert and delete functions)
Find the Nth element in a linked list
Remove the Nth element of a linked list
Check if a linked list has cycles
Given a circular linked list, find the node at the beginning of the loop. Example: A-->B-->C --> D-->E -->C, C is the node that begins the loop
Check whether a link list is a palindrome
Reverse a linked list iteratively and recursively
Sorting
Software Technical Interview Questions
Implement bubble sort
Implement selection sort
Implement insertion sort
Implement merge sort
Implement quick sort