Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Capita Accounting AllOther Interview Questions
Questions Answers Views Company eMail

How to calculate salary structure( PF, ESI, Gratuity, CCA, HRA, etc)

2 18625

Tell me the General entry for provision for bad debts?

19 26459

Post New Capita Accounting AllOther Interview Questions




Un-Answered Questions

how would you improve etl (extract, transform, load) throughput?

519


Briefly describe about size of a molecule, which make a substance antigenic ?

164


How do u configure the script?

516


What are xml attributes?

433


List the different stages of a thread?

462






What are accessors, mutators, @property?

454


Comment on Budget 2017 - 18 and current five year plan?

598


Should I disable javascript?

452


How does dll hell solve in .net?

468


Is cyclotetrane aromatic?

684


What is psb & how it is different from psd?

21


Require_once(), require(), include(). What is difference between them?

512


What does the jsonslurper class indicates?

5


What is meant by day types?

563


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2684