Pull Request for Issue 626 Opened

Floyds_pattern.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+
+
+int main(){
+
+    int n,num=1;
+    cin>>n;
+
+
+
+
+    for (int i=1;i<=n;i++){
+        for(int j=1;j<=i;j++){
+            cout<<num;
+            num=num+1;
+        }
+        cout<<endl;
+
+    }
+
+    return 0;
+
+}

Hello_world.kt

@@ -0,0 +1,3 @@
+fun main() {
+    println("hello world")
+}

Inheritance.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+
+using namespace std;
+
+class Mammals {
+	public:
+		void fn1() {
+			cout << "I am mammal" << endl;
+		}
+};
+
+class MarineAnimals {
+	public:
+		void fn2() {
+			cout << "I am a marine animal" << endl;
+		}
+};
+
+class BlueWhale : public Mammals, public MarineAnimals {
+	public:
+		void fn3() {
+			cout << "I belong to both the categories: Mammals as well as Marine Animals" << endl;
+		}
+};
+
+int main()
+{
+	Mammals mm;
+	MarineAnimals ma;
+	BlueWhale bw;
+	mm.fn1(); /* func of Mammals by obj of Mammals */
+	ma.fn2(); /* func of MarineAnimals by obj of MarineAnimals */
+	bw.fn3(); /* func of BlueWhale by obj of BlueWhale */
+	bw.fn1(); /* func of Mammals by obj of BlueWhale */
+	bw.fn2(); /* func of MarineAnimals by obj of BlueWhale */
+	return 0;
+}

README.md

@@ -10,7 +10,7 @@ Geek Week: Local will run from 14/03/21 to 21/03/21.
 During this time, you can expect challenges for all skill levels. These challenges can be completed on your own time, and new ones will be released each day on our website! Once the daily challenges are announced, you’ll have 24 hours to complete and submit them in order to
 earn those points on the leader-board.
 
-If the daily challenges aren’t quite your speed, there will also be plenty of week-long challenges you can complete at any time. These will range from quick technical challenges to tasks you can complete with your guild-mates (guild=team), both beginner-friendly and technically advanced so there is something for everyone.
+If the daily challenges aren’t quite your speed, there will also be plenty of week-long challenges you can complete at any time. These will range from quick technical challenges to tasks you can complete with your guild-mates (guild=team), both beginner-friendly and technically advanced , so there is something for everyone.
 
 ![](assets/banner2(1).png)
 

Sakalya100-Day4/Day4-Problem1.py

@@ -0,0 +1,11 @@
+class Solution:
+    def longestPalindrome(self, s: str) -> str:
+        m = ''  # Memory to remember a palindrome
+        for i in range(len(s)):  # i = start, O = n
+            for j in range(len(s), i, -1):  # j = end, O = n^2
+                if len(m) >= j-i:  # To reduce time
+                    break
+                elif s[i:j] == s[i:j][::-1]:
+                    m = s[i:j]
+                    break
+        return m

Sakalya100-Day4/Day4-Problem2.py

@@ -0,0 +1,19 @@
+class Solution:
+    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
+        result = ListNode(0)
+        result_tail = result
+        carry = 0
+
+        while l1 or l2 or carry:            
+            val1  = (l1.val if l1 else 0)
+            val2  = (l2.val if l2 else 0)
+            carry, out = divmod(val1+val2 + carry, 10)    
+
+            result_tail.next = ListNode(out)
+            result_tail = result_tail.next                      
+
+            l1 = (l1.next if l1 else None)
+            l2 = (l2.next if l2 else None)
+
+        return result.next
+

Sakalya100-Day4/Day4-Problem3.py

@@ -0,0 +1,15 @@
+class Solution:
+    def convert(self, s: str, numRows: int) -> str:
+        if numRows == 1:
+            return s 
+        n = len(s)
+        cycle = 2*numRows - 2
+        strlist = []
+        for i in range(numRows):
+            for j in range(i, n, cycle):
+                strlist.append(s[j])
+                if i != numRows-1 and i != 0 and j+cycle-2*i < n:
+                    strlist.append(s[j+cycle-2*i])             
+        newstr = ''.join(strlist)
+        return newstr
+

Sakalya100-Day4/Day4-Problem4.py

@@ -0,0 +1,30 @@
+class Solution:
+    def letterCombinations(self, digits: str) -> List[str]:
+         # If the input is empty, immediately return an empty answer array
+        if len(digits) == 0: 
+            return []
+
+        # Map all the digits to their corresponding letters
+        letters = {"2": "abc", "3": "def", "4": "ghi", "5": "jkl", 
+                   "6": "mno", "7": "pqrs", "8": "tuv", "9": "wxyz"}
+
+        def backtrack(index, path):
+            # If the path is the same length as digits, we have a complete combination
+            if len(path) == len(digits):
+                combinations.append("".join(path))
+                return # Backtrack
+
+            # Get the letters that the current digit maps to, and loop through them
+            possible_letters = letters[digits[index]]
+            for letter in possible_letters:
+                # Add the letter to our current path
+                path.append(letter)
+                # Move on to the next digit
+                backtrack(index + 1, path)
+                # Backtrack by removing the letter before moving onto the next
+                path.pop()
+
+        # Initiate backtracking with an empty path and starting index of 0
+        combinations = []
+        backtrack(0, [])
+        return combinations

Sakalya100-Day4/Day4-Problem5.py

@@ -0,0 +1,7 @@
+class Solution:
+    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
+        ans = collections.defaultdict(list)
+        for s in strs:
+            ans[tuple(sorted(s))].append(s)
+        return ans.values()
+