Technical Interview Questions

Observable and Observer interface

Observable is a class.
Observer is an interface.
Observable class maintains a list of observers.
If something changes in Observable then it will notify all its observers.

 
import java.util.Observable;
import java.util.Observer;

class NewPosts extends Observable {
  private String post;

  public String getPost() {
    return post;
  }

  public void updatePost(String post) {
    this.post = post;
    setChanged();
    notifyObservers(post);
  }

  public static void main(String[] args) {
    NewPosts posts = new NewPosts();
    User user1 = new User();
    User user2 = new User();
    posts.addObserver(user1);
    posts.addObserver(user2);
    board.updatePost("New Post is available");
  }
}

class User implements Observer {
  public void update(Observable o, Object arg) {
    System.out.println("New Post available: " + arg);
  }
}

In the above example, a user registers by adding himself to the list of observers. When a new post is available, the user will be notified. Similarly, when a new post is available the observable updates all the users in the observers list.

You might also like:
Java Concepts
Java String concepts
Immutable classes in Java
Remove duplicates from the array
Telephonic phone technical interview questions
Telephonic phone technical interview questions - Part 2
Serialization & Deserialization
Jersey Package Dependencies
Servlet Filter
Servlet Client Request
Spring dependencies for Maven
Java String Operations

CSS Properties

CSS has so many different properties that it is confusing to keep a track of it. Most of the tutorials available online are only useful if you try the examples. This blogspot is a cheatsheet of some of the CSS properties. List is long so I am attempting to cover only a few. If you like it, please comment down below and I will make more blogposts like these

Color:
It will change the color of the text in the tag. For ex:

p {
color: blue;
}

This will change the text color to blue in all paragraphs.

Table:
It will help you to add table to the page.

Border-collapse: If you decide to collapse the borders of the table then you should use border-collapse property.

border-collapse can take up following values:

initial - Initial will remove the set value and revert it to the default.
inherit - Inherit will take this property from its parent element.
collapse - Collapse will collapse the double edged border to single property.
separate - Separate will separate the borders. This is the default value.
For ex: table { border-collapse: separate; }

Border-spacing: If you want to put some space between different table cells then you should use border-spacing property.

border-spacing can take up following values: length, initial, inherit.
length can be specified in px, cm, For ex:
For ex: table { border-spacing: 10px, 20px }

10px will set the horizontal spacing 20px will set the vertical spacing.

Caption: Tables are always captioned. So you can change the alignment of the captions to top, bottom, or inherit it or change it to initial value.

For ex: caption { caption-side: bottom; }

Empty-Cells: If you want to hide or show the empty cells in a table then you can use the property of table called as empty-cells.

For ex: table { empty-cells: hide; }
In above example, the values can be changed to hide, show, initial, or inherit.
The default value is show.

Table-Layout:

Sometimes it happens that in a table you have some content that is too big to fit in its cells. You can expand the table width as much as you like but there will surely be a situation, where your table content doesn't fit in fully.
You can fix it by make the table-layout property to auto. It will handle the situation, where you have unknown length of content.
It can take following values: fixed, auto, inherit, initial
For ex: table { table-layout: fixed; }

Hope you liked this article. If you want to read more of these then please comment down below. I will be happy to write similar articles if that helps!

Find a cycle in the linked list OR Find out if the linked list is cyclic or not

It is a very common question in the interviews. Most times it is asked during white board interviews but sometimes it can be asked during phone interviews.

Following diagram is a linked list without cycle:

Following diagram is a Linked list with cycle:

To find a cycle in the linked list, we will use two pointers. Pointer first and second. In the first iteration, first pointer will point to the next. Second pointer will point to first's next. Following diagram demonstrates this:

After first iteration, first pointer will point to second node, and second pointer will point to second->next->next. Since it contains 3 nodes, after first iteration both the first and second pointer will point to the second node.

Algorithm:

Initialize two pointers first and second. First will point to head, second will point to first->next
Increment pointer first to first->next and second to second->next->next.
Repeat step 2 till second pointer reaches null or meets the first pointer

Complexity:
Time complexity: It will be O(n) since it will traverse through n nodes to find the cycle or reach the cycle's end.

Space complexity: It will be O(1) since constant space is required during algorithm execution.

Implementation:

 
int find_cycle()
{
 node *first, *second;
 first = head;
 second = head;

 //Moving one pointer at the speed of 1 and other at the speed of 2
 while(second->link!=NULL)
 {
  first = first->link;
  second = second->link->link;

  if(first->data == second->data)
  {
   std::cout<<"\nCycle present\t"<link == NULL)
   return NULL;
 }

 //Detecting the start of the cycle.
 first = head;
 while(first!=second)
 {
  first = first->link;
  second = second->link;
 }

 std::cout<<"\nCycle present at:"<data<<"\n";
}

You might also like:


Find White Spaces in Character Array

Find a character in the String

Number is prime or not

Finding Absolute Value

Notes on Sorting and Searching Algorithms

Common String Functions

Reverse a String

Product of all array location expect its own

Find a binomial co-efficient

Remove duplicates from the array

Telephonic phone technical interview questions

Telephonic phone technical interview questions - Part 2

Counting sort algorithm

B-Tree

Points to remember for C and C++ phone interviews

If you are new to technical interviews then you will notice that during phone interviews, conceptual and small questions are asked to gauge the abilities of an individual. Following is the list of some C and C++ questions that can be asked during technical phone interviews. This list shouldn't be referred if your basics of C and C++ are not clear. If you are programming in C or C++ from some time then you might be able to understand most of the points pretty quickly. Hope you find it useful.

On some compilers:

int is 4 bytes
long int 4 bytes
double int 8 bytes
float = 4 bytes
long float = 4 bytes
char = 1 bytes

signed and unsigned will not affect the size. They will affect the value range
Pointer always has same size regardless of where it is pointing.
Example of Enum:

enum color{Black,white};
color c = white;
cout<<c<<endl; //c will have the value 0 or 1 for black or white respectively.

break; breaks the inner loop only not the outer loop.
These all math functions work on: double, float, long double. Since, these functions work on the floating point numbers, we have to use typecasting (int).

fabs: Computes the absolute value of a floating point no.
abs: Computes the absolute for the integers
exp: To compute e^x, where x is a floating point value
sqrt: Finds the sqrt

Max and Min functions are present in the algorithm library.
Memory allocated by malloc, calloc, realloc might not be compatible with the one allocated by new. So manipulation is needed. Hence, malloc and delete & new and free cannot be used interchangeably.
void as a data type is not supported
Dynamic memory is allocated from system heap
If you call break before returning a value then a junk value is returned.

This pointer basics

this pointer stores the address of the class instance, to enable pointer access of the members to the member functions of the class.
this pointer is not counted for calculating the size of the object.
this pointers are not accessible for static member functions.
this pointers are not modifiable.

Example:

class A
{
  int i;
  public:
  int get()
  {
    return this->i;
  }

  void set(int k)
  {
    this->i = k;
  }
};

Shallow copy

Shallow copy will just copy one pointer to another pointer
Ex:

void shallow_copy(test *s,test *t)
{
  s->ptr = t->ptr;
}

Deep Copy

Deep copy will allocate the space for the target then using memcpy to copy the value from the source to the target.
Ex:

void deep_copy(test *s,test *t)
{
   t->ptr = (char*)malloc(sizeof(s) + 1);
   memcpy(t->ptr,s->ptr,strlen(s->ptr)+1);
}

Name hiding

Name hiding occurs when:
There is overloading in the base class and inheritance involved.

Ex:

  base:
  display();
  display(int i);

  derived:
  display();

derived_instance.display(1); //It will not work since it will confuse the compiler

How does delete work

delete p: It will delete the memory for single character

delete []p: It will delete the memory for an array

Different ways to access pointers





*(p+i)
*(i+p)
p[i]
i[p]



Why do we use pointer to a pointer in BST?



Because we have the nodes and the traversal in the form of the pointers.
To traverse we need a pointer.

List of Puzzles

It is very common these days to be asked a couple of puzzles during technical interviews. Following is a list of few puzzles that can be asked during your interview. These puzzles are not solved and the list is compiled just to provide you an overview of what might be asked. You can search on the web about different puzzles and there solution.

Question 1:

There is a disk on a turntable. Half of it is black, and the other half is white. It is rotating at constant speed, but it's rotating fast so that you can't see whether it's clockwise or counterclockwise. You also have a set of stationary sensors you can install anywhere which can tell whether the color of a spot has changed from black to white, or vice versa.
What is the minimum number of sensors needed to find out which way the disk is rotating?
What is the best, average, worst time to figure out the direction?
If you use more sensors, can you improve the best, average, worst time?
How can you accomplish that?
If you are given only one sensor, how can you find out the direction, assuming you can change one constraint of the problem?

Question 2:

You have a pile of coins. One of them is counterfeit, and its weight is different from the other coins. All of the other coins weigh the same. You are given a balance. How would you find the counterfeit coin?

Question 3:

There are three buckets with a label each: oranges, apples, oranges + apples. The labels are guaranteed to be wrong, make minimum draws from the buckets and find out which bucket contains what?

Question 4:

Two airline companies, Kingfisher and Jet airways want to do a merger. Design a database migration scheme, so that no inconsistencies and redundancies. Assume suitable data and brief on the problems you might face.

Question 5:

Come up with an architecture for determining how many users are currently playing a game online. How do you scale it up and out? Where are the points of failure? Scale to 10M. Scale to 100M. Scale to 1B.

Question 6:

With two probes, determine the [clockwise/counterclockwise] direction that a plate with 2 different colors (split along a diameter) is spinning.

Find binomial co-efficient

Finding a binomial co-efficient means finding a certain combination. It is represented as nCk, which means finding k possibilities from n outcomes.

Background:
nCk = (n!) / ((n-k)! k!)
For ex: 4C2 will be 4!/(2! . 2!) = 6
So from 4 elements, there are 6 ways to pick up 2 elements. So if elements are a, b, c, d; they can be picked up as:
a, b
a, c
a, d
b, c
b, d
c, d

Approach:
4C2 = 4!/2! * 2! = (1 * 2 * 3 * 4)/ ((1 * 2) * (1 * 2))
So in numerator we are multiplying 1, 2, 3, 4. And in denominator we are multiplying 1*2, 1*2
So our numerator is something which we have to multiple to result and our denominator is something that we have to divide from result.

How to implement it:
If 4 > 4-2 then b = 4-2 = 2
i starts from 0 and goes till < b = 2.
Iteration 1: result = 1 -> result = result * (4-0) = 1 * 4. result = result / 1 = 4
Iteration 2: result = 4 -> result = result * (4-1) = 4 * 3 = 12. result = result/2 = 6

So in each iteration we are multiplying and dividing at the same time. However, we are multiplying starting from n, n-1, n-2 and so on. And we are dividing with 1, 2, 3..till n-k. Hence the algorithm will be like the following:

Algorithm:
1) If b > n-b then b = n-b.
2) Initialize result to 1 and i to 0.
3) Perform result = result * (n-i) and result = result/(i+1)
4) Increment i by 1.
5) Repeat steps 3, 4 till i <b.

 
int findBinomialCoefficient(int b, int n) 
{
 int result = 1;
 
 if(b > n-b)
  b = n-b;

 for(int i=0; i < b; i++) 
 {
  result *= (n-i);
  result /= (i+1);
 }
 return result; 
}

You might also like:


Find White Spaces in Character Array

Find a character in the String

Number is prime or not

Finding Absolute Value

Notes on Sorting and Searching Algorithms

Common String Functions

Reverse a String

Product of all array location expect its own

Find a cycle in the Linked List

Find a binomial co-efficient

Remove duplicates from the array

Telephonic phone technical interview questions

Telephonic phone technical interview questions - Part 2

Counting sort algorithm

B-Tree

Counting sort

Counting sort will sort the elements of the array on the basis of its array position. It will set the value of array position to 1 and 0 if the element is present or not.

For example if element 10 is present then this sort method will set a[10] to 1. By default a[10] will be set to 0. Then the array a is read one by one. If a[i] is set to 1, then the value will be outputted to entered into a final array. So the output/final array will contain sorted elements.

Algorithm:

Initialize i to 0
Set count[a[i]] to 1(Set the value at location a[i] to 1).
Repeat step 2 till i reaches n-1.
Initialize i to 0 again
If count[i] is not 0 then initialize j to 0 and output count[i].
Repeat step 5 till j < length of(count[i])
Repeat steps 5 and 6 till i reaches count.length.

Raw Iterations:

For example if the input array is 10, 30, 20, 30.
Then this algorithm will set a[10] to 1, a[20] to 1 and a[30] to 2.
Then it will iterate a from i = 0 to 30 and will output 10, 20, 20, 30

 
public static int a[] = {1,2,8,5,3,6,4,10};
public static int count[] = new int[100];

for(int i=0; i < a.length; i++) 
{
 count[a[i]]++;
}

int k = 0;
for(int i=0; i < count.length; i++) 
{
 if(count[i] != 0)
 {
  for(int j=0;j < count[i]; j++) 
  {
   a[k++] = i;
  }
 }
}

Complexity:

Time complexity is O(n) since we iterate through the input array twice.
Space complexity is O(n) since we need additional space to store the number of times the element is repeated.

You might also like:
Find White Spaces in Character Array
Find a character in the String
Number is prime or not
Finding Absolute Value
Notes on Sorting and Searching Algorithms
Common String Functions
Reverse a String
Product of all array location expect its own
Find a cycle in the Linked List
Find a binomial co-efficient
Remove duplicates from the array

Telephonic phone technical interview questions

Telephonic phone technical interview questions - Part 2
Counting sort algorithm
B-Tree