String Programming Interview Questions String is the primary and probably most common thing you come across

on any prog ramming language and so is with any programming interview. There is almost alway s a question on String whether its related to length or replace but I have alway s find one or two String programming questions on interviews. 1) Write code to check a String is palindrome or not? 2) Write a method which will remove any given character from a String? 3) Print all permutation of String both iterative and Recursive way? 4) Write a function to find out longest palindrome in a given string? Programming questions on Array Array is one of the topics where most of programming questions is asked. There a re many and many programming questions on Array and here I have included only so me of them which is not very difficult to solve but some of array programming qu estion can be extremely challenging, so well prepare this topic. 5) In an array 1-100 numbers are stored, one number is missing how do you find i t? 6) In an array 1-100 exactly one number is duplicate how do you find it? 7) In an array 1-100 many numbers are duplicates, how do you find it? trick in this programming questions is by using hashmap or hashtable , we can st ore number as key and its occurrence as value, if number is already present in h ashtable then increment its value or insert value as 1 and later on print all th ose numbers whose values are more than one. 8)Given two arrays, 1,2,3,4,5 and 2,3,1,0,5 find which number is not present in the second array. Here is a quick tip to solve this programming question: put the elements of the second array in the hash table and for every element of the first array, check whether it s present in the hash or not, O/P all those elements from the first arr ay that are not present in the hash table 9) How do you find second highest number in an integer array? LinkedList Programming Interview Questions 10) How do you find middle element of a linked list in single pass? To answer this programming question I would say you start with simple solution o n which you traverse the link until you find the tail of linked list where it po ints to null to find the length of linked list and then reiterating till middle . after this answer interviewer will ask you find the middle element in single p ass and there you can explain that by doing space-time tradeoff you can use two pointers one incrementing one step at a time and other incrementing two step a t ime, so when first pointer reaches end of linked second pointer will point to th e middle element. 11) How do you find 3rd element from last in single pass? This programming question is similar to above and can be solved by using 2 point ers, start second pointer when first pointer reaches third place. 12) How do you find if there is any loop in singly linked list? How do you find the start of the loop? This programming question can also be solved using 2 pointers and if you increas e one pointer one step at a time and other as two steps at a time they will meet in some point if there is a loop. 13) How do you reverse a singly linked list?

Binary Tree Programming Interview Questions Binary tree or simply tree is one of favorite topic for most of interviewer and pose real challenge if you struggle with recursion. Programming questions on tre e can become increasingly difficult when you think iterative but sometime can be very easy if you come with recursive solution. 14) How do you find dept of binary tree? 15) Write code to print InOrder traversal of a tree? 16) Print out all leaf node of a binary tree? Programming questions on searching and sorting I have only included two programming questions on this category but there are mo re can be finding on google. Purpose of these programming questions is to see wh ether programmer is familiar with essential search and sort mechanism or not. 17) Write a program to sort numbers using quick sort? 18) Write a program to implement binary search algorithm Programming questions on numbers Most of the programming questions are based on numbers and these are the ones wh ich most of us did on college level and mind you they still has value I have see n programmers with experience of 3 years struggle with these programming questio ns and doesn t solve it some time and take a lot of time which simply shows that t hey are not in programming in there day to day work. 19) Write code to check whether a no is power of two or not? 20) Write a program to check whether a no is palindrome or not? 21) Write code to check whether a no is Armstrong no or not 22) Write a program to find all prime number up to a given numbers? 23) Write function to compute Nth Fibonacci number? Both iterative and recursive ? General Programming Interview Questions In this category of programming questions I have put questions which are not fit into any data structure but presents a real life problem and you need to provid e solution. These programming questions are sometime based on problems faced by developer itself. 24) Write a program to find out if two rectangles R1 and R2 are overlapping? 35) You need to write a function to climb n steps you can climb either 1 step at a time or 2 steps a time, write a function to return number of ways to climb a ladder with n step. 26) Write code for Generate Random No in a range from min to max? 27) Write program for word-wrap which should work on any screen size? 28) Design an algorithm to find the frequency of occurrence of a word in an arti cle? 29) Write a program to implement blocking queue in Java? 30) Write a program for producer-consumer problem? Tips on answering programming questions 1. If Interviewer asks you to write function then make sure you do some necessar y check for bad input e.g. null check or empty check. Most of the time programme r forgets to test for not null, empty, less than 1, greater than 1 or zero input .

2. If you write iterative version of function then Interviewer may ask you to wr ite recursive version or vice-versa so be prepare for that. 3. If you write a recursive function then Interviewer will ask to optimize it, e ven in case of Iterative version. So remember that you can optimize recursive fu nction by Memoization (caching already calculated value) and by applying some sp ace/time tradeoff principle. For example recursive version of Fibonacci series h as O(n2) which can be reduced to O(n) using Memoziation. 4. Interviewer may ask you to calculate Order of complexity for best and worst c ase of any method so be prepared. 5. Most of the time Interviewer ask how to fix a problem as follow-up question e .g. he will ask how do you find deadlock and then how to fix deadlock in java et c.