Find Kth smallest element in a BST.
Software Engineer Applications Interview Questions
419,284 software engineer applications interview questions shared by candidates
Generate a new array from an array of numbers. Start from the beginning. Put the number of some number first, and then that number. For example, from array 1, 1, 2, 3, 3, 1 You should get 2, 1, 1, 2, 2, 3, 1, 1 Write a program to solve this problem.
Write a function that takes 2 arguments: a binary tree and an integer n, it should return the n-th element in the inorder traversal of the binary tree.
The first coding question was to determine whether a list of integers with size N, contains all the numbers from one to N.
Given a sorted array, where each element but one occurs only once, return the element that repeats. (For example, given 1, 2, 3, 3, 4, return 3. Given 1, 2, 3, 4, 6, 6, 7, 8, 9, return 6.)
Coding Challenge 3) You are given a linkedlist with next and arbitary pointers. Create a new linkedlist similar to the given linkedlist. You need to create a code for deep copy of a linkedlist.
Given an large list of unsorted numbers, find the smallest number. You can access the list only 3 numbers at a time, and keep moving forward 1 number at a time.
Find the last element of a linked list.
1. In an array provide pairs of numbers that add to a particular value 2. In fibonacci series provide sum of all even numbers
Find the 20 longest strings in a text file.
Viewing 291 - 300 interview questions