Answer Posted / manoj singh

#include<stdio.h>
void main()
{
clrscr();
if(printf("\"I love my India\""))
while(!kbhit());
}

Hai what is the different types of versions and their differences

1988

---

if p is a string contained in a string?

1894

---

Why dont c comments nest?

1122

---

How do you print only part of a string?

1073

---

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 }

3245

---

What are qualifiers in c?

1095

---

What is a nested loop?

1185

---

What is the difference between null pointer and wild pointer?

1257

---

What is optimization in c?

1075

---

how much salary u want ? why u join in our company? your domain is core sector why u prefer software ?

2052

---

What is operator precedence?

1289

---

How does pointer work in c?

1205

---

What are types of functions?

1082

---

What are linker error?

1154

---

Is main a keyword in c?

1188

---