updated 7 files

001/ho.py

@@ -0,0 +1 @@
+print("ഹലോ വേൾഡ്     "hello world"")

01/thenga.js

@@ -0,0 +1,9 @@
+
+പ്രയോഗം വിളി(പേര്) {
+    മടക്കം "കമോണ്ട്രാ " + പേര് + "!";
+};
+ വിളി("മഹേഷേ");
+
+
+
+

ASPECTJ/Program

@@ -0,0 +1,23 @@
+# AspectJ uses a Java-like syntax.
+
+// HelloWorld.java
+public class HelloWorld {
+    public static void say(String message) {
+        System.out.println(message);
+    }
+
+    public static void sayToPerson(String message, String name) {
+        System.out.println(name + ", " + message);
+    }
+}
+
+// MannersAspect.java
+public aspect MannersAspect {
+    pointcut callSayMessage() : call(public static void HelloWorld.say*(..));
+    before() : callSayMessage() {
+        System.out.println("Good day!");
+    }
+    after() : callSayMessage() {
+        System.out.println("Thank you!");
+    }
+}

ArnoldC/hello_world.arnoldc

@@ -0,0 +1,4 @@
+IT'S SHOWTIME
+TALK TO THE HAND "hello world"
+TALK TO THE HAND "Woah let's do it"
+YOU HAVE BEEN TERMINATED

C ++/HELLO WORLD !!.CPP

@@ -1,5 +1,7 @@
 // CODING IN TURBO C++ //
-**  PRINTING OF �HELLO WORLD !!� **
+
+**  PRINTING OF “HELLO WORLD !!” **
+
 ( USING LOWER & UPPER TRAINGLE OF A MATRIX)
 
 #include<iostream.h>
@@ -24,7 +26,7 @@ void main()
   }
   cout<<"                                                                           ";
  }
- cout<<"      HELLO WORLD !! \n";
+ cout<<"\n      HELLO WORLD !! \n";
  cout<<"                                         ";
   for(i=0;i<r;i++)
  { for(j=0;j<c;j++)

C ++/Hello Earth.cpp

@@ -0,0 +1,8 @@
+#include<iostream>
+using namespace std;
+
+int main ()
+{
+cout<<"Hello Earth";
+return 0;
+}

C ++/Hello-Worldd!!

@@ -0,0 +1,8 @@
+#include <iostream>
+using namespace std;
+
+int main() 
+{
+    cout<<"Hello World";
+    return 0;
+}

C ++/Hello_world_by_Shashwat-Garg.cpp

@@ -0,0 +1,12 @@
+/*
+ *	Shashwat Garg
+ *	B16034
+ *	IIT Mandi
+ */
+
+#include<iostream>
+using namespace std;
+int main(){
+	cout<<"Hello World from Shashwat-Garg ! :)\n";
+	return 0;
+}

C ++/Mars_Exploration_Hackerrank.cpp

@@ -23,7 +23,7 @@ int main(){
                 i++;
             }
         }
-        i--;
+        i-=1;
     }
     cout << count;
     return 0;

C ++/hello_hacktoberfest.cpp

@@ -0,0 +1,8 @@
+#include<iostream>
+
+using namespace std;
+
+int main(){
+    cout << "Hello Hacktoberfest" <<endl;
+    return 0;
+}

C ++/hello_swar.cpp

@@ -4,6 +4,6 @@ using namespace std;
 
 int main()
 {
-  cout << "Hello World !!!" << endl;
+  cout << "Hello World !!!\n" << endl;
 return 0;
 }

C ++/hello_world.cpp

@@ -0,0 +1,8 @@
+//printing 100 time hello world!
+#include<iostream>
+using namespace std;
+int main(){
+for(int i=0;i<100;i++)
+cout<<"Hello world!\n";
+return 0;
+}

C Language/c program to implement ceaser cipher algorithm.c

@@ -0,0 +1,24 @@
+#include <stdio.h>
+
+int main() 
+{
+    char array[100], cipher[100];
+    int c=0, x=0, y=0;
+    int z;
+    printf("This Program will encrypt according to your needs\n");
+    printf("Enter the cipher key\n");
+    scanf("%d",&z);
+    printf("Enter the sentence");
+    while((c=getchar()) != '\n')
+    {
+        array[x++]=(char)c;
+        cipher[y++]=(char)(c+z);
+    }
+
+    array[x]=0;
+    cipher[y]=0;
+
+    printf("%s\n",cipher);
+
+    return 0;
+}

C Language/calculate height using struc

@@ -0,0 +1,62 @@
+struct height{
+int m;
+int cm;
+};
+int main(){
+struct height h1,h2,h3;
+int n=0,temp1,temp2,temp3;
+printf("enter h1:\n");
+scanf("%d%d",&h1.m,&h1.cm);
+printf("enter h2:\n");
+scanf("%d%d",&h2.m,&h2.cm);
+printf("enter 1 to add 2 heights and display result\nenter 2 to subtract 2 heights and display result\nenter 3 to display both the heights in meters\nenter 4 to exit\n");
+temp1=h1.m*100+h1.cm;
+temp2=h2.m*100+h2.cm;
+scanf("%d",&n);
+printf("%d",n);
+while(n!=4){
+//switch condition
+switch(n){
+case 1: 
+h3.m=h1.m+h2.m;
+h3.cm=h1.cm+h2.cm;
+while(h3.cm>100)
+{
+h3.m=h3.m+1;
+h3.cm=h3.cm-100;
+}
+printf("after addition height will be : %d m %d cm\n",h3.m,h3.cm);
+break;
+
+case 6:
+printf("fuhf");
+if(temp1>temp2)
+temp3=temp1-temp2;
+else
+temp3=temp2-temp1;
+while(temp3>100){
+h3.m=h3.m+1;
+h3.cm=h3.cm-100;
+}
+printf("after subtraction height will be : %d m %d cm\n",h3.m,h3.cm);
+break;
+
+
+case 3:
+printf("%d %d\n",h1.m,h1.cm);
+printf("%d %d\n",h2.m,h2.cm);
+break;
+
+case 4:
+return 0;
+break;
+
+default:
+printf("something wrong is entered\n");
+}
+scanf("%d",&n);
+printf("%d",n);
+}
+return 0;
+}
+

C#/PalindromeRecursive.cs

@@ -0,0 +1,33 @@
+using System;
+using System.Linq;
+
+namespace RecursivePalindrome
+{
+    class Program
+    {
+        private static void Main()
+        {
+            bool another;
+            Console.WriteLine("This is aRecursive Palindrome Test");
+            Console.WriteLine("To exit please use Ctrl+C");
+
+            do
+            {
+                Console.WriteLine("Please enter a possible palindrome: ");
+                var posPalin = Console.ReadLine()?.Trim().ToLower();
+                Console.WriteLine(IsPalindrome(posPalin)
+                    ? $"{posPalin} is a palindrome"
+                    : $"{posPalin} is not a palindrome");
+                Console.WriteLine("Do you want to test another palindrome? (y/n)");
+                another = (bool) Console.ReadLine()?.Trim().ToLower().Equals("y");
+            } while (another);
+        }
+
+        private static bool IsPalindrome(string s)
+        {
+            if (s.Length == 0 || s.Length == 1) return true;
+
+            return s.ToCharArray().First() == s.ToCharArray().Last() && IsPalindrome(s.Substring(1,s.Length-2));
+        }
+    }
+}

C#/WelcomeInBrazil

@@ -0,0 +1,12 @@
+using System;
+ namespace WelcomeInBrazil
+{
+    class Program
+    {
+        static void Main(string[] args)
+        {
+            Console.Write("Here's a mess, are you sure you want to come in?");
+            Console.ReadKey();
+        }
+    }
+}

C#/helloworld.cs

@@ -1,13 +1,12 @@
 using System;
 
-namespace Hello
+namespace hello
 {
-    class Program
+    class HelloWorld
     {
         static void Main(string[] args)
         {
             Console.WriteLine("Hello World!");
-            Console.ReadKey();
         }
     }
 }

C++/DynamicProgramming/Hosoya_triangle.cpp

@@ -0,0 +1,42 @@
+// CPP Program to print Hosoya's
+// triangle of height n.
+#include <bits/stdc++.h>
+using namespace std;
+
+int Hosoya(int n, int m) { 
+    // Base case
+    if ((n == 0 && m == 0) ||
+        (n == 1 && m == 0) ||
+        (n == 1 && m == 1) ||
+        (n == 2 && m == 1))
+        return 1;
+
+    // Recursive step
+    if (n > m)
+        return Hosoya(n - 1, m)
+               + Hosoya(n - 2, m);
+
+    else if (m == n)
+        return Hosoya(n - 1, m - 1)
+               + Hosoya(n - 2, m - 2);
+
+    else
+        return 0;
+}
+
+// Print the Hosoya triangle of height n.
+void printHosoya(int n) {
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j <= i; j++)
+            cout << Hosoya(i, j) << " ";
+
+        cout << endl;
+    }
+}
+
+// Driven Program
+int main() {
+    int n = 5;
+    printHosoya(n);
+    return 0;
+}

C++/DynamicProgramming/KnapSack_problem.cpp

@@ -0,0 +1,34 @@
+// A Dynamic Programming based solution for 0-1 Knapsack problem
+#include<stdio.h>
+
+// A utility function that returns maximum of two integers
+int max(int a, int b) { return (a > b)? a : b; }
+
+// Returns the maximum value that can be put in a knapsack of capacity W
+int knapSack(int W, int wt[], int val[], int n) {
+   int i, w;
+   int K[n+1][W+1];
+
+   // Build table K[][] in bottom up manner
+   for (i = 0; i <= n; i++) {
+       for (w = 0; w <= W; w++) {
+           if (i==0 || w==0)
+               K[i][w] = 0;
+           else if (wt[i-1] <= w)
+                 K[i][w] = max(val[i-1] + K[i-1][w-wt[i-1]],  K[i-1][w]);
+           else
+                 K[i][w] = K[i-1][w];
+       }
+   }
+
+   return K[n][W];
+}
+
+int main() {
+    int val[] = {60, 100, 120};
+    int wt[] = {10, 20, 30};
+    int  W = 50;
+    int n = sizeof(val)/sizeof(val[0]);
+    printf("%d", knapSack(W, wt, val, n));
+    return 0;
+}