This page links to various other posts in this programming blogs that were written mostly from a standpoint of helping out to prepare for Software Engineering interviews at **Google, Microsoft, Amazon and Apple** to name a few. These articles contain fully compiled full source code along with the output. Also make sure to visit my other blog on Java Programming.

**INTERVIEW QUESTIONS:**

Core Java | J2EE | Database | Struts | XML | HTTP | Web Services

**SORTING ALGORITHMS:**

- Bubble Sort – Sorting Integer | Sorting String
- Bidirectional Bubble Sort – Java Implementation
- Insertion Sort – Java Implementation
- Merge Sort – Java Implementation
- Quick Sort – Java Implementation
- Selection Sort – Java Implementation

**DATA STRUCTURE:**

- Circular Linked List: Insert Operation
- Singly Linked List:
- Basic impelementation of Singly Linked List
- Iterative and Recursive Reverse
- Add and Remove Nodes on an Unsorted Linked List

- Set – Intersection
- Queue
- Stack

**GRAPHS / TREES:**

- Binary Tree
- A simple binary tree implementation in java
- Representation and Traversal (In-order, pre-order, post-order)

- Find the Lowest Common Ancestor of two nodes in a Binary Tree
- A basic implementation of Generic Tree (that has nodes having n-children)

**STRING MANIPULATION:**

- Finding if two Strings are anagrams
- Finding if two Strings are rotations of each other
- Split string and separate them with spaces
- Sort characters in a string
- Find if two strings are permutations
- Print all permutations of a given String

**BASIC MATHEMATICS:**

- Finding Mean Value of an array of integers.
- Generate Fibonacci Sequence using Iterative and Recursive approach
- Random Number Generation using another random function
- Rotating a two dimensional array:
- Using extra memory space (Clockwise and Counterclockwise)
- Using no extra memory space (in-place) – (Clockwise and CounterClockwise)

- Square root of a number using binary search
- Swap two integers without using extra variables
- Maximum Integer Finder – Three approaches (with Big O Analysis)
- Prime Number Printer
- Recursively find the Greatest Common Divisor (GCD)

**MISCELLANEOUS:**

- Bitwise Operation – A comprehensive example
- Deadlocks – Cause and Prevention
- SAX and DOM Parsers
- RestFul Webservices vs SOAP Based WebServices

Pingback: Core Java Interview Preparation Questions - Java and Android Programming Blog @ iCodeJava.com

Pingback: J2EE Interview Questions - Java and Android Programming Blog @ iCodeJava.com