Merge branch 'master' of https://github.com/Tuhin-thinks/Python-Codes

Author: Tuhin-thinks

Sorting/Selection_Sort.py

@@ -0,0 +1,18 @@
+def selectionSort(lst):
+    for i in range(0, len(lst) - 1):
+        minIndex = i
+        for j in range(i + 1, len(lst)):
+            if lst[j] < lst[minIndex]:
+                minIndex = j
+        if minIndex != i:
+            lst[minIndex], lst[i] = lst[i], lst[minIndex]
+
+
+def main():
+    lst = [4,1,2,8,7,2,6]
+    print('Sorted List: ',end='')
+    selectionSort(lst)
+    print(lst)
+
+if __name__ == '__main__':
+    main()

String/print_transpose.java

@@ -0,0 +1,68 @@
+import java.util.Scanner;
+
+public class print_transpose {
+    static Scanner sc = new Scanner(System.in);
+    void print_matrix(char[][] matrix){
+        for (char[] C: matrix){
+            for (char c: C){
+                System.out.print(c + "\t");
+            }
+            System.out.println();
+        }
+    }
+
+    void print_matrix(char[][] matrix, int r, int c){
+        for (int i=0; i<c; i++){
+            for (int j=0; j<r; j++){
+                if (i<matrix[j].length)
+                    System.out.print(matrix[j][i] + "  ");
+                else
+                    System.out.print("    ");
+            }
+            System.out.println();
+        }
+    }
+    int find_longestWord(String sentence){
+        int max_len = 0;
+        for (String word : sentence.split(" ")) {
+            if (word.length() > max_len) {
+                max_len = word.length();
+            }
+        }
+        return max_len;
+    }
+
+    char[][] str_to_matrix(String sentence, char[][] matrix){
+        int row=0, col=0;
+        for (String word : sentence.split(" ")){
+            col = 0;
+            for (char c : word.toCharArray()){
+                matrix[row][col] = c;
+                col++;
+            }
+            row ++;
+        }
+        return matrix;
+    }
+
+    public static void main(String[] args) {
+        String ip_sent;
+        System.out.print("Enter the input string:");
+        ip_sent = sc.nextLine();
+        print_transpose ob = new print_transpose();
+
+        // STEP 1. Start creating the matrix
+
+        int nr_words = ip_sent.split(" ").length;  // number of words in the input sentence
+        int longest_word_len = ob.find_longestWord(ip_sent);
+        System.out.printf("Longest word length: %d\n", longest_word_len);
+        char[][] matrix = new char[nr_words][longest_word_len];
+//        ob.print_matrix(matrix);
+        matrix = ob.str_to_matrix(ip_sent, matrix);
+
+        // STEP 2: Print the matrix in the transposed form
+        ob.print_matrix(matrix, nr_words, longest_word_len);
+
+        System.out.println("\n----------Done---------");
+    }
+}

codechef/warmup_and_complexity/carvans.py

@@ -0,0 +1,29 @@
+"""
+Problem statement: https://www.codechef.com/LRNDSA01/problems/CARVANS
+"""
+
+def calculate(n, max_speeds):
+    max_speed_count = 0
+    lowest_so_far = -1
+    for speed in max_speeds:
+        if lowest_so_far == -1:
+            lowest_so_far = speed
+            max_speed_count += 1
+            continue
+        if speed <= lowest_so_far:  # cars having speed eqauls to or lesser than the lowest speed so far, are moving at their max speed.
+            lowest_so_far = speed
+            max_speed_count += 1
+    return max_speed_count
+
+
+if __name__ == '__main__':
+    T = int(input())  # input number of test cases.
+
+    for i in range(T):
+        N = int(input())  # enter number of cars
+        max_car_speeds = list(map(int, input().split()))
+        res = calculate(N, max_car_speeds)
+        print(res)
+
+
+    

codechef/warmup_and_complexity/coinFlip.py

@@ -0,0 +1,6 @@
+if __name__ == '__main__':
+    T = int(input())  # enter test cases
+    for i in range(T):
+        G = int(input())  # no. of games played
+        for j in range(G):
+            i,n,q = list(map(int, input().split()))  # 3 space separated integers