Bhit

c/p11.c

@@ -13,7 +13,7 @@ int isSameTree(struct TreeNode* p, struct TreeNode* q){
         return 1;
     }
     if(p->val == q->val){
-        return isSameTree(p->left, q->left) || isSameTree(p->right, q->right);
+        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
     }
     return 0;
 }

c/p13.c

@@ -12,8 +12,7 @@ int main(){
 
     int n = sizeof(a)/sizeof(a[0]);
     int m = sizeof(b)/sizeof(b[0]);
-
-    for(int i=0;i<n;i++);{
+    for(int i=0;i<n;i++){
         printf("%d ", a[i]);
     }
     printf("\n");

c/p14.c

@@ -18,13 +18,18 @@ int romanToInt(char * s){
         }
     }
     int num=0;
-    for(int i=0;i<strlen(s)-1;i++){
+    int i;
+    for(i=0;i<strlen(s)-1;i++){
         if(a[i] < a[i+1]){
             a[i+1] -= a[i];
+            i++;
         }
         num += a[i];
     }
+    if(i==strlen(s)-1)
+    {
     num += a[strlen(s) - 1];
+    }
     return num;
 }
 

c/p4.cpp

@@ -10,10 +10,10 @@ string caesar(string s, int k, string direction){
     string ans = "";
     for(int i=0;i<s.length();i++){
         if(direction == "encode"){
-            ans += s[i] + k;
+            ans += 'a' + (s[i]-'a' + k) % 26;
         }
         else if(direction == "decode"){
-            ans += s[i] - k;
+            ans += 'a' + (s[i]-'a' - k + 26) % 26;
         }
     }
     return ans;

c/p5.c

@@ -6,6 +6,6 @@ void main(){
     int a=10;
     int *ptr = &a;
 
-    *ptr++;
+    (*ptr)++;
     printf("%d", *ptr);
 }

c/p6.c

@@ -4,7 +4,8 @@
 int *fun()
 {
     int x = 5;
-    return &x;
+    int *t=&x
+    return t;
 }
 int main()
 {

c/p8.c

@@ -5,7 +5,7 @@
 float computeAverage(float* x, size_t* N) {
     float numerator = 0.0;
     float denominator = 0.0;
-    for (size_t i = 0; i < (size_t)N; i++) {
+    for (size_t i = 0; i < *N; i++) {
         numerator += x[i];
         denominator++;
     }

c/p9.c

@@ -9,18 +9,18 @@
  */
 
 #include <stdio.h>
-
+#include <stdlib.h>
 int* filterMultiples(int* arr, int N, int* NOut, int num) {
     int numPrimes = 0;
     *NOut = 0;
     for (int i = 0; i < N; i++) {
         if (arr[i] >= num && arr[i]%num == 0) {
-            *NOut++;
+            (*NOut)++;
         }
     }
-    int* multiples = malloc((*NOut)*sizeof(int));
+    int* multiples =malloc((*NOut)*sizeof(int));
     int idx = 0;
-    for (int i = 0; i < *NOut; i++) {
+    for (int i = 0; i < N; i++) {
         if (arr[i] >= num && arr[i]%num == 0) {
             multiples[idx] = arr[i];
             idx++;

py/p1.py

@@ -7,6 +7,7 @@
 def asterisk_tree(height,level):
   if level > height:
     return
+  print(' '*(height-level),end='')
   for j in range(2*level-1):
     print("*", end="")
   print()

py/p10.py

@@ -1,6 +1,7 @@
 #Finding Average RGB values using the listmaker fuction to generate list of rgb values for a pixel
 
-def listmaker(r,g,b,list1=[]):
+def listmaker(r,g,b):
+    list1=[]
     list1.append(r)
     list1.append(g)
     list1.append(b)

py/p11.py

@@ -1,9 +1,9 @@
 # Function to convert decimal to binary number
 
 def binaryconversion(n):
-   print(n % 2,end = '')
-   if n > 1:
-       binaryconversion(n/2)
+    if n > 1:
+       binaryconversion(n//2)
+    print(n%2,end='')
 
 number=int(input("Enter Number: "))
 binaryconversion(number)

py/p2.py

@@ -2,7 +2,7 @@
 # input- 1 -> output- [1], input- 2 -> output- [2]
 
 def add_item(item, items=[]):
-   items.append(item)
+   items=[item]
    return items
 
 print(add_item(1))

py/p3.py

@@ -2,7 +2,7 @@
 #eg: [2, 4, 6, 17, 10] -> [17, 10] 
 
 def delete_starting_evens(list):
-  for item in list:
+  while True:
     if list[0] % 2 == 0:
       list.pop(0)
     else:

py/p4.py

@@ -6,10 +6,10 @@ def countSort(arr):
     ans = [0 for i in range(len(arr))]
     for i in arr:
         count[i] += 1
-    for i in range(k+1):
+    for i in range(1,k+1):
         count[i] += count[i-1]
     for i in range(len(arr)-1, -1, -1):
-        ans[count[arr[i]]] = arr[i]
+        ans[count[arr[i]]-1] = arr[i]
         count[arr[i]] -= 1
     return ans 
 

py/p6.py

@@ -15,7 +15,6 @@ def addBinary(a: str, b: str) -> str:
         j -= 1
       s.append(str(carry % 2))
       carry //= 2
-
-    return ''.join(reversed(s))
+    return str(carry)+''.join(reversed(s))
 
 print(addBinary("11", "0"))

py/p9.py

@@ -9,9 +9,12 @@ def ispangram(str1, alphabet=string.ascii_lowercase):
     alphaset = list(alphabet)
 
     str = list(str1.lower())
-
+    for i in ''.join(alphaset):
+        if i not in ''.join(str):
+            return False
+
     # Check if all lowercase characters in the input string covers all characters in 'alphaset'
-    return alphaset <= str
+    return True
 
 # Print the result of checking if the string is a pangram by calling the 'ispangram' function
 print(ispangram('The quick brown fox jumps over the lazy dog'))