Best XML Parsers

Use Xstream parser. Best and easy to use. any questions reply to this post

SVN Eclipse plugin Installation

http://www.roseindia.net/projectmanagement/continuousintegration/subeclipse/subversion-eclipse.shtml

Error in Workflow APEXP/49013 3205: USER_NAMEis not a valid role or user name.

Hi,

This is the issue with iexpense report. The user submits expense and its goes to the approver.But, when the approver approves it, workflow errors out saying 'XYZ' is not a valid role or username

(For example: XYZ i.e., employee is attached to user id XYZA)

 

iexpenses interview question

Write a query to get employee bank Details(iexpenses) in Oracle Apps R12

Google Interview Question

There is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a function that will return k random numbers from the list. Numbers should be completely random.

Google Interview Question

There is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a function that will return k random numbers from the list. Numbers should be completely random.

Google Interview Question

Given n non overlapping intervals and an element. Find the interval into which this element falls.

Google Interview Question

There is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a function that will return k random numbers from the list. Numbers should be completely random.

Google Interview Question

 There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1].

Solve it without division operator and in O(n).

Google Interview Question

 There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1].

Solve it without division operator and in O(n).

Google Interview Question

 If array A is small and array B is too large. how will you proceed for getting intersection of those two arrays?

Google Interview Question

 If array A is small and array B is too large. how will you proceed for getting intersection of those two arrays?

Google Interview Question

Three strings say A,B,C are given to you. Check weather 3rd string is interleaved from string A and B.

Google Interview Question

You have given an array. Find the maximum and minimum numbers in less number of comparisons.

Google Interview Question

You have cycle in linked list. Find it. Prove that time complexity is linear. Also find the node at which looping takes place.

Google Interview Question

You have cycle in linked list. Find it. Prove that time complexity is linear. Also find the node at which looping takes place.

Google Interview Question

You have given an array. Find the maximum and minimum numbers in less number of comparisons.

Google Interview Question

You have cycle in linked list. Find it. Prove that time complexity is linear. Also find the node at which looping takes place.

Google Interview Question

On a empty chessboard, a horse starts from a point( say location x,y) and it starts moving randomly, but once it moves out of board, it cant come inside. So what is the total probability that it stays within the board after N steps.

Google Interview Question

Given that you can take one step or two steps forward from a given step. So find the total number of ways of reaching Nth step.

Google Interview Question

What are dangling pointers?

Google Interview Question

What is the Space complexity of quick sort algorithm? how do find it?

Linked List Question

Given a linked list with two pointers where first pointer pointing to the first node and the other pointer pointing to some random node. How to clone the linked list

Linked List Question

Given a linked list with two pointers where first pointer pointing to the first node and the other pointer pointing to some random node. How to clone the linked list

Stack Question

How to find the maximum element in the stack in O(1)?

Linked List Question

Code for basic operations on the linked list like insert, delete,size.

Linked List Question

Code for basic operations on the linked list like insert, delete,size.

Linked List Question

What is linked list?

Linked List Question

What is linked list?

Queue Question

Code for the basic operations on queue like insert,delete,size and get.

Queue Question

What is a queue data structure?

Stack Question

Code for the basic operations on the stack like

add,remove,getTop,size

Stack Question

What is a stack

Oracle Apps Interview Question

How to get requisition number from PO Number?