Answer Posted / manomit mitra

4

Write a program to check armstrong number in c?

1132

---

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 }

3189

---

How can I swap two values without using a temporary?

1110

---

Write a program to print ASCII code for a given digit.

1095

---

What is a char in c?

998

---

Why c is faster than c++?

1041

---

in case any function return float value we must declare a) the function must be declared as 'float' in main() as well b) the function automatically returned float values c) function before declared 'float' keyword d) all the above

1030

---

What is #include stdio h and #include conio h?

1110

---

How can I remove the leading spaces from a string?

1170

---

What are header files in c?

1080

---

Why can’t we compare structures?

1275

---

Can stdout be forced to print somewhere other than the screen?

1049

---

What is the right way to use errno?

1057

---

Explain how do you list a file’s date and time?

1041

---

How can I sort a linked list?

1049

---