write a program to print the consecutive repeated character from the given string... input string is : hhhhjkutskkkkkggggj output should be like this: hhhhkkkkkgggg anyone help me...

1938

---

What is webapplicationinitializer in spring?

446

---

if we display var1 then what will b displayed in below condition. 77 var1 pic s9(2) value -10. 77 var1 pic s9(2) value -11. " " " -12. " " " -13. -14 ... ... -19.

6591

---

Explain the use of compress option in exp command.

1021

---

What is the difference of update types in call transaction method ? : abap bdc

1165

---

tell me abt ur most memorable moment

2183

---

How to create a custom errorhandler?

829

---

What is rdbms and also explain its components?

1097

---

What is an err object?

964

---

Is the use of dsa covered by any patents?

886

---

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 }

3191

---

What is the market like for EM majors?

2671

---

What is the dramatic increase in amplitude called when the frequency of forced vibrations on a body matches the bodys natural vibration frequency?

1011

---

Can we create foreign key without primary key?

985

---

Does sql view stored data?

959

---