├── C++ Codes ├── README.md ├── Comparision.cpp ├── maxSubarray.cpp ├── count number of digits ├── Convert decimal number input by the user to binary ├── Swap Numbers.cpp ├── Euler_totient_function.cpp ├── reverse.cpp ├── next_permutation.cpp ├── Prime_Number.cpp ├── fact.cpp ├── Print a 2-D matrix ├── prev_permutation.cpp ├── Power_Of_Two.cpp ├── Checking string is Palindrome or not ├── Check leap year.cpp ├── leapyear.cpp ├── pascal'striangle.cpp ├── RepeatAndMissingNumber.cpp ├── Isomorphic Strings ├── SimplePattern.cpp ├── Prefix ++.cpp ├── Container With Most Water.cpp ├── TowerOfHanoi.cpp ├── Sliding Window Maximum.cpp ├── LongestConsecutiveSubsequence.cpp ├── TWOSUM.cpp ├── rainwater ├── rainwater1 ├── pairSwap.c ├── Longest Common Prefix ├── matrix_search.cpp ├── MaxMinArr.cpp ├── Stock ├── bfs.cpp ├── GroupAnagrams.cpp ├── StockBuySell.cpp ├── ReshapeMatrix.cpp ├── shell_sort.cpp ├── BubbleSort.cpp ├── MergeOverlappingIntervals.cpp ├── n-queens.cpp ├── Roots of a Quadratic Equation.cpp ├── rotate_image.cpp ├── Bitonic_String_Maximum_Length.cpp ├── Flattening of a LinkedList.cpp ├── quicksort.cpp ├── 11InfixToPostfix.cpp └── mergeinterval.cpp ├── C-lang Codes ├── README.md ├── substract.c ├── factors.c ├── factorial.c ├── exponent.c ├── triangle.c ├── C program to reverse 5 digit number .c ├── Dancing sentence.c ├── Traping rain water.c ├── fibonacci triangle.c ├── C Program to Write a Sentence to a File.c ├── kadaneAlgo.c ├── C program to implement 2-D Array.c ├── createapassword.c ├── starprint.c ├── Reverse String using stack.c ├── twosum Problem.c ├── DFS_Algo.c ├── minimize the heights.c ├── finding_array_largest&smallest_element.c ├── minimum number following a pattern.c ├── minspanningtree.c ├── Addnumbersupto50digits ├── Sort character by frequency.c ├── matrixmul.c ├── QuickSort.c ├── Factorialoflargenumber.c ├── Fractional_Knapsack.c ├── implement a stack.c ├── Circular Queue.c └── array_no-of-duplicate-elements_&_most-repeating-element.c ├── Java Codes ├── README.md ├── Print Zigzag->recursion ├── RomanToIntegers.java ├── Max Of An Array->recursion ├── InvertBinaryTree.java ├── print the even number in an array using lambda expression. ├── Duplicate character conversation.java └── BinaryTreeLevelOrderTraversal.java ├── Python Codes ├── README.md ├── inverseofanum.py ├── Fibonacci Numbers Less Than N.py ├── sorting.py ├── two sum in pythom ├── Beautiful Triplets.py ├── mark_and_toys_problem.py ├── even fibonacci series less than n.py ├── matrix_addition.py ├── bubble_sort.py ├── python program to calculate LCM and GCD of two numbers .py ├── Python Program to print all the prime numbers within a given range.py ├── Game of Thrones - I.py ├── python program to read two numbers and an arithmetic operator and display the result .py ├── matrix_multiplication.py ├── selection_sort.py ├── binary search.py ├── Python program to count uppercase , lowercase letters, aphabets and digits .py ├── insertion_sort.py ├── Factorial.py ├── merge_sort.py ├── matrix_zig_zag.py ├── Binary_search.py ├── shell_sort.py └── heap_sort.py ├── demo.tyx ├── C++ Opengl └── read.md ├── flutter └── show_users_from_api │ ├── ios │ ├── Flutter │ │ ├── Debug.xcconfig │ │ ├── Release.xcconfig │ │ └── AppFrameworkInfo.plist │ ├── Runner │ │ ├── Runner-Bridging-Header.h │ │ ├── Assets.xcassets │ │ │ ├── LaunchImage.imageset │ │ │ │ ├── LaunchImage.png │ │ │ │ ├── LaunchImage@2x.png │ │ │ │ ├── LaunchImage@3x.png │ │ │ │ ├── README.md │ │ │ │ └── Contents.json │ │ │ └── AppIcon.appiconset │ │ │ │ ├── Icon-App-20x20@1x.png │ │ │ │ ├── Icon-App-20x20@2x.png │ │ │ │ ├── Icon-App-20x20@3x.png │ │ │ │ ├── Icon-App-29x29@1x.png │ │ │ │ ├── Icon-App-29x29@2x.png │ │ │ │ ├── Icon-App-29x29@3x.png │ │ │ │ ├── Icon-App-40x40@1x.png │ │ │ │ ├── Icon-App-40x40@2x.png │ │ │ │ ├── Icon-App-40x40@3x.png │ │ │ │ ├── Icon-App-60x60@2x.png │ │ │ │ ├── Icon-App-60x60@3x.png │ │ │ │ ├── Icon-App-76x76@1x.png │ │ │ │ ├── Icon-App-76x76@2x.png │ │ │ │ ├── Icon-App-1024x1024@1x.png │ │ │ │ └── Icon-App-83.5x83.5@2x.png │ │ └── AppDelegate.swift │ ├── Runner.xcodeproj │ │ └── project.xcworkspace │ │ │ ├── contents.xcworkspacedata │ │ │ └── xcshareddata │ │ │ ├── WorkspaceSettings.xcsettings │ │ │ └── IDEWorkspaceChecks.plist │ ├── Runner.xcworkspace │ │ ├── contents.xcworkspacedata │ │ └── xcshareddata │ │ │ ├── WorkspaceSettings.xcsettings │ │ │ └── IDEWorkspaceChecks.plist │ └── .gitignore │ ├── android │ ├── gradle.properties │ ├── app │ │ └── src │ │ │ ├── main │ │ │ ├── res │ │ │ │ ├── mipmap-hdpi │ │ │ │ │ └── ic_launcher.png │ │ │ │ ├── mipmap-mdpi │ │ │ │ │ └── ic_launcher.png │ │ │ │ ├── mipmap-xhdpi │ │ │ │ │ └── ic_launcher.png │ │ │ │ ├── mipmap-xxhdpi │ │ │ │ │ └── ic_launcher.png │ │ │ │ ├── mipmap-xxxhdpi │ │ │ │ │ └── ic_launcher.png │ │ │ │ ├── drawable │ │ │ │ │ └── launch_background.xml │ │ │ │ ├── drawable-v21 │ │ │ │ │ └── launch_background.xml │ │ │ │ ├── values │ │ │ │ │ └── styles.xml │ │ │ │ └── values-night │ │ │ │ │ └── styles.xml │ │ │ └── kotlin │ │ │ │ └── com │ │ │ │ └── example │ │ │ │ └── showuser │ │ │ │ └── MainActivity.kt │ │ │ ├── debug │ │ │ └── AndroidManifest.xml │ │ │ └── profile │ │ │ └── AndroidManifest.xml │ ├── gradle │ │ └── wrapper │ │ │ └── gradle-wrapper.properties │ ├── .gitignore │ ├── settings.gradle │ └── build.gradle │ ├── web │ ├── favicon.png │ ├── icons │ │ ├── Icon-192.png │ │ └── Icon-512.png │ └── manifest.json │ ├── windows │ ├── runner │ │ ├── resources │ │ │ └── app_icon.ico │ │ ├── resource.h │ │ ├── CMakeLists.txt │ │ ├── utils.h │ │ ├── runner.exe.manifest │ │ ├── run_loop.h │ │ ├── flutter_window.h │ │ └── main.cpp │ ├── flutter │ │ ├── generated_plugin_registrant.cc │ │ ├── generated_plugin_registrant.h │ │ └── generated_plugins.cmake │ └── .gitignore │ ├── .metadata │ ├── README.md │ ├── .gitignore │ ├── lib │ └── main.dart │ └── test │ └── widget_test.dart ├── assets ├── img │ ├── about.jpg │ ├── favicon.png │ ├── hero-bg.jpg │ ├── logo3.gif │ ├── counts-bg.png │ ├── footer-bg.jpg │ ├── hero-img.png │ └── apple-touch-icon.png ├── vendor │ ├── boxicons │ │ ├── fonts │ │ │ ├── boxicons.eot │ │ │ ├── boxicons.ttf │ │ │ ├── boxicons.woff │ │ │ └── boxicons.woff2 │ │ └── css │ │ │ └── transformations.css │ ├── icofont │ │ └── fonts │ │ │ ├── icofont.woff │ │ │ └── icofont.woff2 │ └── owl.carousel │ │ ├── assets │ │ ├── ajax-loader.gif │ │ ├── owl.video.play.png │ │ ├── owl.theme.default.min.css │ │ └── owl.theme.green.min.css │ │ └── LICENSE └── E-Books │ ├── Complete_Kali_Linux_Commands_List.pdf │ ├── Introduction to Bash Scripting eBook.pdf │ └── Introduction to Modeling and Si - Steven I. Gordon.pdf ├── contact-form ├── scss │ └── bootstrap │ │ ├── utilities │ │ ├── _clearfix.scss │ │ ├── _overflow.scss │ │ ├── _screenreaders.scss │ │ ├── _visibility.scss │ │ ├── _shadows.scss │ │ ├── _float.scss │ │ ├── _align.scss │ │ ├── _background.scss │ │ ├── _stretched-link.scss │ │ ├── _sizing.scss │ │ ├── _position.scss │ │ ├── _display.scss │ │ └── _embed.scss │ │ ├── _media.scss │ │ ├── mixins │ │ ├── _clearfix.scss │ │ ├── _size.scss │ │ ├── _lists.scss │ │ ├── _text-truncate.scss │ │ ├── _resize.scss │ │ ├── _visibility.scss │ │ ├── _alert.scss │ │ ├── _nav-divider.scss │ │ ├── _text-hide.scss │ │ ├── _badge.scss │ │ ├── _transition.scss │ │ ├── _float.scss │ │ ├── _text-emphasis.scss │ │ ├── _list-group.scss │ │ ├── _reset-text.scss │ │ ├── _pagination.scss │ │ ├── _background-variant.scss │ │ ├── _box-shadow.scss │ │ ├── _deprecate.scss │ │ ├── _screen-reader.scss │ │ ├── _hover.scss │ │ ├── _table-row.scss │ │ └── _image.scss │ │ ├── _transitions.scss │ │ ├── bootstrap-reboot.scss │ │ ├── _jumbotron.scss │ │ ├── _utilities.scss │ │ ├── _root.scss │ │ ├── bootstrap-grid.scss │ │ ├── bootstrap.scss │ │ ├── _close.scss │ │ ├── _toasts.scss │ │ ├── _code.scss │ │ ├── _grid.scss │ │ ├── _progress.scss │ │ ├── _mixins.scss │ │ ├── _spinners.scss │ │ ├── _images.scss │ │ ├── _badge.scss │ │ ├── _alert.scss │ │ └── _breadcrumb.scss ├── Output.jpg └── main.html ├── Video Call ├── download.jpg └── index.html ├── C-Programming-Notes by Abhishek Banerjee.pdf ├── logic.js ├── password.py ├── backtracking.py ├── loginpage_UI_Demo └── readme.md ├── Factorial1 ├── C++ Template Library ├── pair.cpp ├── Map template ├── Overloading Function Template └── list template ├── Camera.py ├── Pyramid and Pattern ├── Euler_totient_function.cpp ├── qr-code.py ├── Palindrome program in C++ ├── slicing.py ├── Armstrong_number.c ├── Dancing sentence ├── mergeksorted list.py ├── merge ksorted list.py ├── Traping rain water--c ├── English Dictionary CMD ├── database.py └── app1.py ├── bubblesort.py ├── Detecting cycle in undirected graph solution in c++ ├── FreqCount.cpp ├── FloydWarshall.cpp ├── Add_Two_Number.cpp ├── problem50.c ├── Dijkstra_Algo.c ├── C++ program to convert decimal to hexadecimal ├── C++ program to separate even and odd numbers from an array of integers. Put all even numbers first, and then odd numbers. ├── C++ Program to Find All Roots of a Quadratic Equation ├── Program to find two’s complement of a binary number in C++ ├── Create lexicographic strings ├── email Sender └── ZigZagTreeTraversal.cpp /C++ Codes/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /C-lang Codes/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Java Codes/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Python Codes/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /demo.tyx: -------------------------------------------------------------------------------- 1 | add zomato demo website 2 | -------------------------------------------------------------------------------- /C++ Opengl/read.md: -------------------------------------------------------------------------------- 1 | Opengl project codes 2 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Flutter/Debug.xcconfig: -------------------------------------------------------------------------------- 1 | #include "Generated.xcconfig" 2 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Flutter/Release.xcconfig: -------------------------------------------------------------------------------- 1 | #include "Generated.xcconfig" 2 | -------------------------------------------------------------------------------- /assets/img/about.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/about.jpg -------------------------------------------------------------------------------- /assets/img/favicon.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/favicon.png -------------------------------------------------------------------------------- /assets/img/hero-bg.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/hero-bg.jpg -------------------------------------------------------------------------------- /assets/img/logo3.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/logo3.gif -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_clearfix.scss: -------------------------------------------------------------------------------- 1 | .clearfix { 2 | @include clearfix(); 3 | } 4 | -------------------------------------------------------------------------------- /Video Call/download.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/Video Call/download.jpg -------------------------------------------------------------------------------- /assets/img/counts-bg.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/counts-bg.png -------------------------------------------------------------------------------- /assets/img/footer-bg.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/footer-bg.jpg -------------------------------------------------------------------------------- /assets/img/hero-img.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/hero-img.png -------------------------------------------------------------------------------- /contact-form/Output.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/contact-form/Output.jpg -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner/Runner-Bridging-Header.h: -------------------------------------------------------------------------------- 1 | #import "GeneratedPluginRegistrant.h" 2 | -------------------------------------------------------------------------------- /assets/img/apple-touch-icon.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/img/apple-touch-icon.png -------------------------------------------------------------------------------- /assets/vendor/boxicons/fonts/boxicons.eot: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/boxicons/fonts/boxicons.eot -------------------------------------------------------------------------------- /assets/vendor/boxicons/fonts/boxicons.ttf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/boxicons/fonts/boxicons.ttf -------------------------------------------------------------------------------- /assets/vendor/boxicons/fonts/boxicons.woff: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/boxicons/fonts/boxicons.woff -------------------------------------------------------------------------------- /assets/vendor/icofont/fonts/icofont.woff: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/icofont/fonts/icofont.woff -------------------------------------------------------------------------------- /assets/vendor/icofont/fonts/icofont.woff2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/icofont/fonts/icofont.woff2 -------------------------------------------------------------------------------- /C-Programming-Notes by Abhishek Banerjee.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/C-Programming-Notes by Abhishek Banerjee.pdf -------------------------------------------------------------------------------- /assets/vendor/boxicons/fonts/boxicons.woff2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/boxicons/fonts/boxicons.woff2 -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/gradle.properties: -------------------------------------------------------------------------------- 1 | org.gradle.jvmargs=-Xmx1536M 2 | android.useAndroidX=true 3 | android.enableJetifier=true 4 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/web/favicon.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/web/favicon.png -------------------------------------------------------------------------------- /assets/vendor/owl.carousel/assets/ajax-loader.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/owl.carousel/assets/ajax-loader.gif -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_media.scss: -------------------------------------------------------------------------------- 1 | .media { 2 | display: flex; 3 | align-items: flex-start; 4 | } 5 | 6 | .media-body { 7 | flex: 1; 8 | } 9 | -------------------------------------------------------------------------------- /assets/E-Books/Complete_Kali_Linux_Commands_List.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/E-Books/Complete_Kali_Linux_Commands_List.pdf -------------------------------------------------------------------------------- /assets/vendor/owl.carousel/assets/owl.video.play.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/vendor/owl.carousel/assets/owl.video.play.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/web/icons/Icon-192.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/web/icons/Icon-192.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/web/icons/Icon-512.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/web/icons/Icon-512.png -------------------------------------------------------------------------------- /assets/E-Books/Introduction to Bash Scripting eBook.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/E-Books/Introduction to Bash Scripting eBook.pdf -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_clearfix.scss: -------------------------------------------------------------------------------- 1 | @mixin clearfix() { 2 | &::after { 3 | display: block; 4 | clear: both; 5 | content: ""; 6 | } 7 | } 8 | -------------------------------------------------------------------------------- /Python Codes/inverseofanum.py: -------------------------------------------------------------------------------- 1 | a=int(input()) 2 | i=0 3 | j=1 4 | while(a>0): 5 | d=int(a%10) 6 | a=int(a/10) 7 | i+=j*(10**d-1) 8 | j+=1 9 | print(i) -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/runner/resources/app_icon.ico: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/windows/runner/resources/app_icon.ico -------------------------------------------------------------------------------- /assets/E-Books/Introduction to Modeling and Si - Steven I. Gordon.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/assets/E-Books/Introduction to Modeling and Si - Steven I. Gordon.pdf -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_overflow.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | @each $value in $overflows { 4 | .overflow-#{$value} { overflow: $value !important; } 5 | } 6 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_size.scss: -------------------------------------------------------------------------------- 1 | // Sizing shortcuts 2 | 3 | @mixin size($width, $height: $width) { 4 | width: $width; 5 | height: $height; 6 | @include deprecate("`size()`", "v4.3.0", "v5"); 7 | } 8 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/mipmap-hdpi/ic_launcher.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/android/app/src/main/res/mipmap-hdpi/ic_launcher.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/mipmap-mdpi/ic_launcher.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/android/app/src/main/res/mipmap-mdpi/ic_launcher.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/mipmap-xhdpi/ic_launcher.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/android/app/src/main/res/mipmap-xhdpi/ic_launcher.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/mipmap-xxhdpi/ic_launcher.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/android/app/src/main/res/mipmap-xxhdpi/ic_launcher.png -------------------------------------------------------------------------------- /Python Codes/Fibonacci Numbers Less Than N.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | n = [] 3 | b = [] 4 | n1,n2 = 0,1 5 | while n2 2 | 3 | int main() { 4 | int a, b; 5 | 6 | printf("\nEnter two no: "); 7 | scanf("%d %d", &a, &b); 8 | 9 | printf("Difference is : %d", (a + ~b + 1)); 10 | 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /Python Codes/sorting.py: -------------------------------------------------------------------------------- 1 | l,u,o,e=[],[],[],[] 2 | for i in sorted(input()): 3 | if i.isalpha(): 4 | x = u if i.isupper() else l 5 | else: 6 | x = o if int(i)%2 else e 7 | x.append(i) 8 | print("".join(l+u+o+e)) 9 | 10 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_text-truncate.scss: -------------------------------------------------------------------------------- 1 | // Text truncate 2 | // Requires inline-block or block for proper styling 3 | 4 | @mixin text-truncate() { 5 | overflow: hidden; 6 | text-overflow: ellipsis; 7 | white-space: nowrap; 8 | } 9 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner.xcodeproj/project.xcworkspace/contents.xcworkspacedata: -------------------------------------------------------------------------------- 1 | 2 | 4 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner.xcworkspace/contents.xcworkspacedata: -------------------------------------------------------------------------------- 1 | 2 | 4 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner/Assets.xcassets/AppIcon.appiconset/Icon-App-1024x1024@1x.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/ios/Runner/Assets.xcassets/AppIcon.appiconset/Icon-App-1024x1024@1x.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner/Assets.xcassets/AppIcon.appiconset/Icon-App-83.5x83.5@2x.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bhargav-joshi/LearnFree/HEAD/flutter/show_users_from_api/ios/Runner/Assets.xcassets/AppIcon.appiconset/Icon-App-83.5x83.5@2x.png -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/flutter/generated_plugin_registrant.cc: -------------------------------------------------------------------------------- 1 | // 2 | // Generated file. Do not edit. 3 | // 4 | 5 | #include "generated_plugin_registrant.h" 6 | 7 | 8 | void RegisterPlugins(flutter::PluginRegistry* registry) { 9 | } 10 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_resize.scss: -------------------------------------------------------------------------------- 1 | // Resize anything 2 | 3 | @mixin resizable($direction) { 4 | overflow: auto; // Per CSS3 UI, `resize` only applies when `overflow` isn't `visible` 5 | resize: $direction; // Options: horizontal, vertical, both 6 | } 7 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_visibility.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | // Visibility 4 | 5 | @mixin invisible($visibility) { 6 | visibility: $visibility !important; 7 | @include deprecate("`invisible()`", "v4.3.0", "v5"); 8 | } 9 | -------------------------------------------------------------------------------- /password.py: -------------------------------------------------------------------------------- 1 | #Creating Strong password using python libraries 2 | import random 3 | passlen = int(input("Enter the length of password:")) 4 | s="abcdefghijklmnopqrstuvwxyz01234567890ABCDEFGHIJKLMNOPQRSTUVWXYZ!@#$%^&*()?" 5 | p = "".join(random.sample(s,passlen )) 6 | print(p) 7 | -------------------------------------------------------------------------------- /C++ Codes/Comparision.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | float x = 0.1; 5 | if (x == 0.1) 6 | printf("IF"); 7 | else if (x == 0.1f) 8 | printf("ELSE IF"); 9 | else 10 | printf("ELSE"); 11 | } 12 | 13 | #output : ELSE IF 14 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_visibility.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | // 4 | // Visibility utilities 5 | // 6 | 7 | .visible { 8 | visibility: visible !important; 9 | } 10 | 11 | .invisible { 12 | visibility: hidden !important; 13 | } 14 | -------------------------------------------------------------------------------- /Python Codes/two sum in pythom: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def twoSum(self, nums: List[int], target: int) -> List[int]: 3 | n = len(nums) 4 | for i in range(n): 5 | for j in range(i+1,n): 6 | if nums[i]+nums[j] == target: 7 | return [i,j] 8 | -------------------------------------------------------------------------------- /Python Codes/Beautiful Triplets.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | 4 | x = map(int,raw_input().strip().split(' ')) 5 | n=x[0] 6 | d=x[1] 7 | a = map(int,raw_input().strip().split(' ')) 8 | 9 | count=0 10 | for i in xrange(n): 11 | if a[i]+d in a and a[i]+2*d in a: 12 | count+=1 13 | print count 14 | -------------------------------------------------------------------------------- /backtracking.py: -------------------------------------------------------------------------------- 1 | def permute(list, s): 2 | if list == 1: 3 | return s 4 | else: 5 | return [ 6 | y + x 7 | for y in permute(1, s) 8 | for x in permute(list - 1, s) 9 | ] 10 | print(permute(1, ["a","b","c"])) 11 | print(permute(2, ["a","b","c"])) 12 | -------------------------------------------------------------------------------- /Python Codes/mark_and_toys_problem.py: -------------------------------------------------------------------------------- 1 | def maximumToys(prices, k): 2 | total=0 3 | cost=0 4 | prices.sort() 5 | for x in prices: 6 | if((cost+x) 2 | 3 | 4 | int main() 5 | { 6 | int a,b; 7 | 8 | printf("Enter a number\n"); 9 | 10 | scanf("%d",&a); 11 | 12 | for(b=1;b<=a;b++){ 13 | 14 | if(a%b==0){printf("%d is the factor of %d\n",b,a);} 15 | 16 | 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_shadows.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | .shadow-sm { box-shadow: $box-shadow-sm !important; } 4 | .shadow { box-shadow: $box-shadow !important; } 5 | .shadow-lg { box-shadow: $box-shadow-lg !important; } 6 | .shadow-none { box-shadow: none !important; } 7 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/gradle/wrapper/gradle-wrapper.properties: -------------------------------------------------------------------------------- 1 | #Fri Jun 23 08:50:38 CEST 2017 2 | distributionBase=GRADLE_USER_HOME 3 | distributionPath=wrapper/dists 4 | zipStoreBase=GRADLE_USER_HOME 5 | zipStorePath=wrapper/dists 6 | distributionUrl=https\://services.gradle.org/distributions/gradle-6.7-all.zip 7 | -------------------------------------------------------------------------------- /Python Codes/even fibonacci series less than n.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | n = [] 3 | b = [] 4 | n1,n2 = 0,1 5 | while n2 2 | 3 | 4 | 5 | PreviewsEnabled 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /C-lang Codes/factorial.c: -------------------------------------------------------------------------------- 1 | #include 2 | long int fact(int n) { 3 | if (n>=1) 4 | return n*fact(n-1); 5 | else 6 | return 1; 7 | } 8 | int main() { 9 | int n; 10 | printf("Enter a positive integer: "); 11 | scanf("%d",&n); 12 | printf("Factorial of %d = %ld", n, fact(n)); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_alert.scss: -------------------------------------------------------------------------------- 1 | @mixin alert-variant($background, $border, $color) { 2 | color: $color; 3 | @include gradient-bg($background); 4 | border-color: $border; 5 | 6 | hr { 7 | border-top-color: darken($border, 5%); 8 | } 9 | 10 | .alert-link { 11 | color: darken($color, 10%); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | IDEDidComputeMac32BitWarning 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_nav-divider.scss: -------------------------------------------------------------------------------- 1 | // Horizontal dividers 2 | // 3 | // Dividers (basically an hr) within dropdowns and nav lists 4 | 5 | @mixin nav-divider($color: $nav-divider-color, $margin-y: $nav-divider-margin-y) { 6 | height: 0; 7 | margin: $margin-y 0; 8 | overflow: hidden; 9 | border-top: 1px solid $color; 10 | } 11 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/.gitignore: -------------------------------------------------------------------------------- 1 | gradle-wrapper.jar 2 | /.gradle 3 | /captures/ 4 | /gradlew 5 | /gradlew.bat 6 | /local.properties 7 | GeneratedPluginRegistrant.java 8 | 9 | # Remember to never publicly share your keystore. 10 | # See https://flutter.dev/docs/deployment/android#reference-the-keystore-from-the-app 11 | key.properties 12 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner.xcodeproj/project.xcworkspace/xcshareddata/WorkspaceSettings.xcsettings: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | PreviewsEnabled 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | IDEDidComputeMac32BitWarning 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /C++ Codes/maxSubarray.cpp: -------------------------------------------------------------------------------- 1 | int maxSubArray(vector& nums) { 2 | int maxi=nums[0]; 3 | int* sum=new int[nums.size()+1]; 4 | sum[0]=nums[0]; 5 | for(int i=1;i 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | pair PAIR1; 9 | 10 | PAIR1.first = 100; 11 | PAIR1.second = 'G'; 12 | 13 | cout << PAIR1.first << " "; 14 | cout << PAIR1.second << endl; 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/.metadata: -------------------------------------------------------------------------------- 1 | # This file tracks properties of this Flutter project. 2 | # Used by Flutter tool to assess capabilities and perform upgrades etc. 3 | # 4 | # This file should be version controlled and should not be manually edited. 5 | 6 | version: 7 | revision: d79295af24c3ed621c33713ecda14ad196fd9c31 8 | channel: stable 9 | 10 | project_type: app 11 | -------------------------------------------------------------------------------- /C++ Codes/count number of digits: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | unsigned long long int x = 255657434267; 7 | 8 | int num_digits = 0; 9 | 10 | do { 11 | num_digits++; 12 | x /= 10; 13 | } 14 | while (x); 15 | 16 | cout << num_digits << endl; 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_transitions.scss: -------------------------------------------------------------------------------- 1 | .fade { 2 | @include transition($transition-fade); 3 | 4 | &:not(.show) { 5 | opacity: 0; 6 | } 7 | } 8 | 9 | .collapse { 10 | &:not(.show) { 11 | display: none; 12 | } 13 | } 14 | 15 | .collapsing { 16 | position: relative; 17 | height: 0; 18 | overflow: hidden; 19 | @include transition($transition-collapse); 20 | } 21 | -------------------------------------------------------------------------------- /Camera.py: -------------------------------------------------------------------------------- 1 | #using phone camera with computer with IP cam Application 2 | import cv2 3 | import numpy as np 4 | url =input("Your IP Address/video:") 5 | cp = cv2.VideoCapture(url) 6 | while(True): 7 | camera, frame = cp.read() 8 | if frame is not None: 9 | cv2.imshow("Frame", frame) 10 | q = cv2.waitKey() 11 | if q==ord("q"): 12 | break 13 | cv2.destroyAllWindows() 14 | -------------------------------------------------------------------------------- /Pyramid and Pattern: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int rows; 7 | 8 | cout << "Enter number of rows: "; 9 | cin >> rows; 10 | 11 | for(int i = 1; i <= rows; ++i) 12 | { 13 | for(int j = 1; j <= i; ++j) 14 | { 15 | cout << "* "; 16 | } 17 | cout << "\n"; 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Python Codes/matrix_addition.py: -------------------------------------------------------------------------------- 1 | ''' Program to perform 2 | addition of two matrices''' 3 | def matrix_addition(X,Y): 4 | result = [[X[i][j] + Y[i][j] for j in range 5 | (len(X[0]))] for i in range(len(X))] 6 | 7 | for row in result: 8 | print(row) 9 | 10 | #Driver Code 11 | matrix_addition([[1,2,3],[4 ,5,6],[7 ,8,9]], 12 | [[9,8,7],[6,5,4],[3,2,1]]) 13 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/.gitignore: -------------------------------------------------------------------------------- 1 | flutter/ephemeral/ 2 | 3 | # Visual Studio user-specific files. 4 | *.suo 5 | *.user 6 | *.userosscache 7 | *.sln.docstates 8 | 9 | # Visual Studio build-related files. 10 | x64/ 11 | x86/ 12 | 13 | # Visual Studio cache files 14 | # files ending in .cache can be ignored 15 | *.[Cc]ache 16 | # but keep track of directories ending in .cache 17 | !*.[Cc]ache/ 18 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/flutter/generated_plugin_registrant.h: -------------------------------------------------------------------------------- 1 | // 2 | // Generated file. Do not edit. 3 | // 4 | 5 | #ifndef GENERATED_PLUGIN_REGISTRANT_ 6 | #define GENERATED_PLUGIN_REGISTRANT_ 7 | 8 | #include 9 | 10 | // Registers Flutter plugins. 11 | void RegisterPlugins(flutter::PluginRegistry* registry); 12 | 13 | #endif // GENERATED_PLUGIN_REGISTRANT_ 14 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/debug/AndroidManifest.xml: -------------------------------------------------------------------------------- 1 | 3 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/profile/AndroidManifest.xml: -------------------------------------------------------------------------------- 1 | 3 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_text-hide.scss: -------------------------------------------------------------------------------- 1 | // CSS image replacement 2 | @mixin text-hide($ignore-warning: false) { 3 | // stylelint-disable-next-line font-family-no-missing-generic-family-keyword 4 | font: 0/0 a; 5 | color: transparent; 6 | text-shadow: none; 7 | background-color: transparent; 8 | border: 0; 9 | 10 | @include deprecate("`text-hide()`", "v4.1.0", "v5", $ignore-warning); 11 | } 12 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner/Assets.xcassets/LaunchImage.imageset/README.md: -------------------------------------------------------------------------------- 1 | # Launch Screen Assets 2 | 3 | You can customize the launch screen with your own desired assets by replacing the image files in this directory. 4 | 5 | You can also do it by opening your Flutter project's Xcode project with `open ios/Runner.xcworkspace`, selecting `Runner/Assets.xcassets` in the Project Navigator and dropping in the desired images. -------------------------------------------------------------------------------- /C++ Codes/Convert decimal number input by the user to binary: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | long long x = 29; 7 | 8 | string bin; 9 | 10 | while (x) { 11 | bin += (char)((x & 1) + '0'); 12 | x >>= 1; 13 | } 14 | 15 | reverse(bin.begin(), bin.end()); 16 | 17 | cout << bin << endl; 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Euler_totient_function.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int phi(int n) { 5 | int result = n; 6 | for (int i = 2; i * i <= n; i++) { 7 | if (n % i == 0) { 8 | while (n % i == 0) 9 | n /= i; 10 | result -= result / i; 11 | } 12 | } 13 | if (n > 1) 14 | result -= result / n; 15 | return result; 16 | } 17 | 18 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_badge.scss: -------------------------------------------------------------------------------- 1 | @mixin badge-variant($bg) { 2 | color: color-yiq($bg); 3 | background-color: $bg; 4 | 5 | @at-root a#{&} { 6 | @include hover-focus { 7 | color: color-yiq($bg); 8 | background-color: darken($bg, 10%); 9 | } 10 | 11 | &:focus, 12 | &.focus { 13 | outline: 0; 14 | box-shadow: 0 0 0 $badge-focus-width rgba($bg, .5); 15 | } 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /C++ Codes/Swap Numbers.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int a = 10; 7 | int b = 20; 8 | cout << "Value of a before: " << a << endl; 9 | cout << "Value of b before: " << b << endl; 10 | 11 | // swap values of the variables 12 | swap(a, b); 13 | cout << "Value of a now: " << a << endl; 14 | cout << "Value of b now: " << b << endl; 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Python Codes/bubble_sort.py: -------------------------------------------------------------------------------- 1 | def countSwaps(a): 2 | count=0 3 | for x in range(len(a)): 4 | for y in range(len(a)-1): 5 | if(a[y]>a[y+1]): 6 | count=count+1 7 | temp=a[y] 8 | a[y]=a[y+1] 9 | a[y+1]=temp 10 | print("Array is sorted in "+str(count)+" swaps.") 11 | print("First Element: "+str(a[0])) 12 | print("Last Element: "+str(a[-1])) 13 | -------------------------------------------------------------------------------- /Python Codes/python program to calculate LCM and GCD of two numbers .py: -------------------------------------------------------------------------------- 1 | x = int(input("Enter first number: ")) 2 | y = int(input("Enter second number: ")) 3 | if x > y : 4 | smaller = y 5 | else : 6 | smaller = x 7 | for i in range(1, smaller + 1): 8 | if(x % i == 0) and (y % i == 0): 9 | gcd = i 10 | lcm = (x * y)/gcd 11 | print("The G.C.D of" ,x, "and",y ,"is", gcd) 12 | print("The L.C.M of" ,x, "and",y ,"is", lcm) 13 | -------------------------------------------------------------------------------- /C++ Codes/Euler_totient_function.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int phi(int n) { 5 | int result = n; 6 | for (int i = 2; i * i <= n; i++) { 7 | if (n % i == 0) { 8 | while (n % i == 0) 9 | n /= i; 10 | result -= result / i; 11 | } 12 | } 13 | if (n > 1) 14 | result -= result / n; 15 | return result; 16 | } 17 | 18 | -------------------------------------------------------------------------------- /qr-code.py: -------------------------------------------------------------------------------- 1 | # Import QRCode from pyqrcode 2 | import pyqrcode 3 | import png 4 | from pyqrcode import QRCode 5 | 6 | 7 | # String which represents the QR code 8 | s = "www.github.com" 9 | 10 | # Generate QR code 11 | url = pyqrcode.create(s) 12 | 13 | # Create and save the svg file naming "myqr.svg" 14 | url.svg("myqr.svg", scale = 8) 15 | 16 | # Create and save the png file naming "myqr.png" 17 | url.png('myqr.png', scale = 6) 18 | -------------------------------------------------------------------------------- /Palindrome program in C++: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n,r,sum=0,temp; 6 | cout<<"Enter the Number="; 7 | cin>>n; 8 | temp=n; 9 | while(n>0) 10 | { 11 | r=n%10; 12 | sum=(sum*10)+r; 13 | n=n/10; 14 | } 15 | if(temp==sum) 16 | cout<<"Number is Palindrome."; 17 | else 18 | cout<<"Number is not Palindrome."; 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /C++ Codes/reverse.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int n, reversedNumber = 0, remainder; 6 | 7 | cout << "Enter an integer: "; 8 | cin >> n; 9 | 10 | while(n != 0) { 11 | remainder = n%10; 12 | reversedNumber = reversedNumber*10 + remainder; 13 | n /= 10; 14 | } 15 | 16 | cout << "Reversed Number = " << reversedNumber; 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /C-lang Codes/exponent.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | int main() 5 | 6 | { 7 | int base,exponent; 8 | long long power=1; 9 | int i; 10 | 11 | printf("Enter the base number\n"); 12 | scanf("%d",&base); 13 | printf("Enter the exponent\n"); 14 | scanf("%d",&exponent); 15 | for(i=1;i<=exponent;i++){ 16 | 17 | power=power*base; 18 | 19 | } 20 | printf("%d^%d=%ld",base,exponent,power); 21 | 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_float.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | @each $breakpoint in map-keys($grid-breakpoints) { 4 | @include media-breakpoint-up($breakpoint) { 5 | $infix: breakpoint-infix($breakpoint, $grid-breakpoints); 6 | 7 | .float#{$infix}-left { float: left !important; } 8 | .float#{$infix}-right { float: right !important; } 9 | .float#{$infix}-none { float: none !important; } 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /Python Codes/Python Program to print all the prime numbers within a given range.py: -------------------------------------------------------------------------------- 1 | r=int(input("Enter upper limit: ")) #takes upperlimit from the user. 2 | for a in range(2,r+1): 3 | count=0 # count variable is initialized to zero. 4 | for i in range(2,a//2+1): 5 | if(a%i==0): 6 | count = count + 1 7 | if(count<=0): #if count <= 0 then the number is prime. 8 | print(a) #prints prime number within a given range. 9 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_transition.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable property-blacklist 2 | @mixin transition($transition...) { 3 | @if $enable-transitions { 4 | @if length($transition) == 0 { 5 | transition: $transition-base; 6 | } @else { 7 | transition: $transition; 8 | } 9 | } 10 | 11 | @if $enable-prefers-reduced-motion-media-query { 12 | @media (prefers-reduced-motion: reduce) { 13 | transition: none; 14 | } 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_float.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | @mixin float-left { 4 | float: left !important; 5 | @include deprecate("The `float-left` mixin", "v4.3.0", "v5"); 6 | } 7 | @mixin float-right { 8 | float: right !important; 9 | @include deprecate("The `float-right` mixin", "v4.3.0", "v5"); 10 | } 11 | @mixin float-none { 12 | float: none !important; 13 | @include deprecate("The `float-none` mixin", "v4.3.0", "v5"); 14 | } 15 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_text-emphasis.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | // Typography 4 | 5 | @mixin text-emphasis-variant($parent, $color) { 6 | #{$parent} { 7 | color: $color !important; 8 | } 9 | @if $emphasized-link-hover-darken-percentage != 0 { 10 | a#{$parent} { 11 | @include hover-focus { 12 | color: darken($color, $emphasized-link-hover-darken-percentage) !important; 13 | } 14 | } 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_align.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | .align-baseline { vertical-align: baseline !important; } // Browser default 4 | .align-top { vertical-align: top !important; } 5 | .align-middle { vertical-align: middle !important; } 6 | .align-bottom { vertical-align: bottom !important; } 7 | .align-text-bottom { vertical-align: text-bottom !important; } 8 | .align-text-top { vertical-align: text-top !important; } 9 | -------------------------------------------------------------------------------- /slicing.py: -------------------------------------------------------------------------------- 1 | # Accessing tuple elements using slicing 2 | my_tuple = ('p','r','o','g','r','a','m','i','z') 3 | 4 | # elements 2nd to 4th 5 | # Output: ('r', 'o', 'g') 6 | print(my_tuple[1:4]) 7 | 8 | # elements beginning to 2nd 9 | # Output: ('p', 'r') 10 | print(my_tuple[:-7]) 11 | 12 | # elements 8th to end 13 | # Output: ('i', 'z') 14 | print(my_tuple[7:]) 15 | 16 | # elements beginning to end 17 | # Output: ('p', 'r', 'o', 'g', 'r', 'a', 'm', 'i', 'z') 18 | print(my_tuple[:]) 19 | -------------------------------------------------------------------------------- /C++ Codes/next_permutation.cpp: -------------------------------------------------------------------------------- 1 | using namespace std; 2 | 3 | int main() 4 | { 5 | int arr[] = { 1, 2, 3 }; 6 | 7 | sort(arr, arr + 3); 8 | 9 | cout << "The 3! possible permutations with 3 elements:\n"; 10 | do { 11 | cout << arr[0] << " " << arr[1] << " " << arr[2] << "\n"; 12 | } while (next_permutation(arr, arr + 3)); 13 | 14 | cout << "After loop: " << arr[0] << ' ' 15 | << arr[1] << ' ' << arr[2] << '\n'; 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /C-lang Codes/triangle.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int side1, side2, side3; 4 | printf("Enter sides of triangle:"); 5 | scanf("%d%d%d",&side1,&side2,&side3); 6 | if(side1 == side2 && side2 == side3) 7 | printf("The Given Triangle is equilateral\n"); 8 | else if(side1 == side2 || side2 == side3 || side3 == side1) 9 | printf("The given Triangle is isosceles\n"); 10 | else 11 | printf("The given Triangle is scalene\n"); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/bootstrap-reboot.scss: -------------------------------------------------------------------------------- 1 | /*! 2 | * Bootstrap Reboot v4.3.1 (https://getbootstrap.com/) 3 | * Copyright 2011-2019 The Bootstrap Authors 4 | * Copyright 2011-2019 Twitter, Inc. 5 | * Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE) 6 | * Forked from Normalize.css, licensed MIT (https://github.com/necolas/normalize.css/blob/master/LICENSE.md) 7 | */ 8 | 9 | @import "functions"; 10 | @import "variables"; 11 | @import "mixins"; 12 | @import "reboot"; 13 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner/AppDelegate.swift: -------------------------------------------------------------------------------- 1 | import UIKit 2 | import Flutter 3 | 4 | @UIApplicationMain 5 | @objc class AppDelegate: FlutterAppDelegate { 6 | override func application( 7 | _ application: UIApplication, 8 | didFinishLaunchingWithOptions launchOptions: [UIApplication.LaunchOptionsKey: Any]? 9 | ) -> Bool { 10 | GeneratedPluginRegistrant.register(with: self) 11 | return super.application(application, didFinishLaunchingWithOptions: launchOptions) 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /Python Codes/Game of Thrones - I.py: -------------------------------------------------------------------------------- 1 | string = raw_input() 2 | 3 | found = False 4 | # Write the code to find the required palindrome and then assign the variable 'found' a value of True or False 5 | 6 | freq = {} 7 | for i in string: 8 | if i not in freq: 9 | freq[i] = 0 10 | freq[i] += 1 11 | oddfreq = 0 12 | for i in freq: 13 | if freq[i] % 2 != 0: 14 | oddfreq += 1 15 | if oddfreq <= 1: 16 | found = True 17 | 18 | if not found: 19 | print("NO") 20 | else: 21 | print("YES") 22 | -------------------------------------------------------------------------------- /contact-form/main.html: -------------------------------------------------------------------------------- 1 | Colorlib logo 2 |

Thank you for using our template!

3 |

For more awesome templates please visit Colorlib.

4 | 5 | 12 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_jumbotron.scss: -------------------------------------------------------------------------------- 1 | .jumbotron { 2 | padding: $jumbotron-padding ($jumbotron-padding / 2); 3 | margin-bottom: $jumbotron-padding; 4 | color: $jumbotron-color; 5 | background-color: $jumbotron-bg; 6 | @include border-radius($border-radius-lg); 7 | 8 | @include media-breakpoint-up(sm) { 9 | padding: ($jumbotron-padding * 2) $jumbotron-padding; 10 | } 11 | } 12 | 13 | .jumbotron-fluid { 14 | padding-right: 0; 15 | padding-left: 0; 16 | @include border-radius(0); 17 | } 18 | -------------------------------------------------------------------------------- /Armstrong_number.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int n,s,r,n1,c,x; 6 | printf("Enter the range i.e th end number:\n"); 7 | scanf("%d",&x); 8 | for(n=1;n<=x;n++) 9 | { 10 | c=0; 11 | n1=n; 12 | while(n1!=0){ 13 | n1=n1/10; 14 | c++; 15 | } 16 | n1=n; 17 | s=0; 18 | while(n1!=0) 19 | { 20 | r=n1%10; 21 | s=s+pow(r,c); 22 | n1=n1/10; 23 | } 24 | if(s==n) 25 | printf("%d\t",n); 26 | } 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /C++ Codes/Prime_Number.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n, i, m=0, flag=0; 6 | cout << "Enter the Number to check Prime: "; 7 | cin >> n; 8 | m=n/2; 9 | for(i = 2; i <= m; i++) 10 | { 11 | if(n % i == 0) 12 | { 13 | cout<<"Number is not Prime."< 2 | using namespace std; 3 | 4 | int main() { 5 | int n; 6 | long double factorial = 1.0; 7 | 8 | cout << "Enter a positive integer: "; 9 | cin >> n; 10 | 11 | if (n < 0) 12 | cout << "Error! Factorial of a negative number doesn't exist."; 13 | else { 14 | for(int i = 1; i <= n; ++i) { 15 | factorial *= i; 16 | } 17 | cout << "Factorial of " << n << " = " << factorial; 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /C-lang Codes/C program to reverse 5 digit number .c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n, d1, d2 , d3 , d4 , d5; 5 | long int revnum ; 6 | printf("enter 5 digit number:"); 7 | scanf("%d",&n); 8 | d5 = n % 10; 9 | n = n/10; 10 | d4 = n % 10; 11 | n = n/10; 12 | d3 = n % 10; 13 | n = n/10 ; 14 | d2 = n % 10; 15 | n = n/10 ; 16 | d1 = n; 17 | revnum = d5*10000 + d4*1000 + d3*100 + d2*10 +d1; 18 | printf("The reverse of 5 digit number is : %ld", revnum); 19 | return 0; 20 | } 21 | 22 | -------------------------------------------------------------------------------- /Dancing sentence: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main(){ 4 | char a[100]; 5 | char b[28]="abcdefghijklmnopqrstuvwxyz"; 6 | char c[28]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; 7 | int x,i,g; 8 | g=0; 9 | scanf("\n%[^\n]",a); 10 | for(x=0;x<100;x++){ 11 | for(i=0;i<27;i++) 12 | if(g%2==0){ 13 | if((a[x]==b[i])|| (a[x]==c[i])){ 14 | a[x]=c[i]; 15 | } 16 | } 17 | else{ 18 | if((a[x]==b[i]||(a[x]==c[i])){ 19 | a[x]=b[i]; 20 | } 21 | } 22 | if(a[x]!=''){ 23 | g++; 24 | } 25 | } 26 | printf("%s\n",a); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_background.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | @each $color, $value in $theme-colors { 4 | @include bg-variant(".bg-#{$color}", $value); 5 | } 6 | 7 | @if $enable-gradients { 8 | @each $color, $value in $theme-colors { 9 | @include bg-gradient-variant(".bg-gradient-#{$color}", $value); 10 | } 11 | } 12 | 13 | .bg-white { 14 | background-color: $white !important; 15 | } 16 | 17 | .bg-transparent { 18 | background-color: transparent !important; 19 | } 20 | -------------------------------------------------------------------------------- /mergeksorted list.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def mergeKLists(self, lists: List[ListNode]) -> ListNode: 3 | if not lists: return 4 | result=[] 5 | for i in lists: 6 | while i: 7 | result.append(i.val) 8 | i=i.next 9 | if not result: return 10 | result.sort() 11 | head=ListNode(result.pop(0)) 12 | m=head 13 | while result: 14 | m.next=ListNode(result.pop(0)) 15 | m=m.next 16 | return head 17 | -------------------------------------------------------------------------------- /C++ Codes/Print a 2-D matrix: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void print_matrix(int *p, int n, int m) 5 | { 6 | int i,j; 7 | 8 | for (i=0;i 2 | #include 3 | int main(){ 4 | char a[100]; 5 | char b[28]="abcdefghijklmnopqrstuvwxyz"; 6 | char c[28]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; 7 | int x,i,g; 8 | g=0; 9 | scanf("\n%[^\n]",a); 10 | for(x=0;x<100;x++){ 11 | for(i=0;i<27;i++) 12 | if(g%2==0){ 13 | if((a[x]==b[i])|| (a[x]==c[i])){ 14 | a[x]=c[i]; 15 | } 16 | } 17 | else{ 18 | if((a[x]==b[i]||(a[x]==c[i])){ 19 | a[x]=b[i]; 20 | } 21 | } 22 | if(a[x]!=''){ 23 | g++; 24 | } 25 | } 26 | printf("%s\n",a); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /merge ksorted list.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def mergeKLists(self, lists: List[ListNode]) -> ListNode: 3 | if not lists: return 4 | result=[] 5 | for i in lists: 6 | while i: 7 | result.append(i.val) 8 | i=i.next 9 | if not result: return 10 | result.sort() 11 | head=ListNode(result.pop(0)) 12 | m=head 13 | while result: 14 | m.next=ListNode(result.pop(0)) 15 | m=m.next 16 | return head 17 | -------------------------------------------------------------------------------- /Traping rain water--c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n; 4 | scanf("%d",&n); 5 | while(n--){ 6 | int k; 7 | scanf("%d",&k); 8 | int a[k],i,j,t,c=0,m=0; 9 | for(i=0;im) 31 | m=c; 32 | } 33 | printf("%d\n",m); 34 | } 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/runner/resource.h: -------------------------------------------------------------------------------- 1 | //{{NO_DEPENDENCIES}} 2 | // Microsoft Visual C++ generated include file. 3 | // Used by Runner.rc 4 | // 5 | #define IDI_APP_ICON 101 6 | 7 | // Next default values for new objects 8 | // 9 | #ifdef APSTUDIO_INVOKED 10 | #ifndef APSTUDIO_READONLY_SYMBOLS 11 | #define _APS_NEXT_RESOURCE_VALUE 102 12 | #define _APS_NEXT_COMMAND_VALUE 40001 13 | #define _APS_NEXT_CONTROL_VALUE 1001 14 | #define _APS_NEXT_SYMED_VALUE 101 15 | #endif 16 | #endif 17 | -------------------------------------------------------------------------------- /C++ Template Library/Map template: -------------------------------------------------------------------------------- 1 | // Map is same like dictionary in python 2 | #include 3 | #include 4 | #include 5 | 6 | using namespace std; 7 | int main() 8 | { 9 | map marksmap; 10 | marksmap["Namit"] = 98; 11 | marksmap["havna"] = 78; 12 | marksmap["Rohan"] = 35; 13 | map ::iterator iter; 14 | for (iter = marksmap.begin(); iter != marksmap.end() ; iter++) 15 | { 16 | cout<<(*iter).first<<" "<<(*iter).second<<"\n"; 17 | } 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/settings.gradle: -------------------------------------------------------------------------------- 1 | include ':app' 2 | 3 | def localPropertiesFile = new File(rootProject.projectDir, "local.properties") 4 | def properties = new Properties() 5 | 6 | assert localPropertiesFile.exists() 7 | localPropertiesFile.withReader("UTF-8") { reader -> properties.load(reader) } 8 | 9 | def flutterSdkPath = properties.getProperty("flutter.sdk") 10 | assert flutterSdkPath != null, "flutter.sdk not set in local.properties" 11 | apply from: "$flutterSdkPath/packages/flutter_tools/gradle/app_plugin_loader.gradle" 12 | -------------------------------------------------------------------------------- /C-lang Codes/Traping rain water.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n; 4 | scanf("%d",&n); 5 | while(n--){ 6 | int k; 7 | scanf("%d",&k); 8 | int a[k],i,j,t,c=0,m=0; 9 | for(i=0;im) 31 | m=c; 32 | } 33 | printf("%d\n",m); 34 | } 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /Python Codes/python program to read two numbers and an arithmetic operator and display the result .py: -------------------------------------------------------------------------------- 1 | num1 = float(input("Enter first number :")) 2 | num2 = float(input("Enter second number :")) 3 | oper = input("Enter operator [+,-,*,/]:") 4 | result = 0 5 | if oper == '+': 6 | result = num1 + num2 7 | elif oper == '-': 8 | result = num1 - num2 9 | elif oper == '*': 10 | result = num1 * num2 11 | elif oper == '/': 12 | result = num1 / num2 13 | else: 14 | print("invalid operator") 15 | print("the required result between two nunber is :",result) 16 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/drawable/launch_background.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 12 | 13 | -------------------------------------------------------------------------------- /Python Codes/matrix_multiplication.py: -------------------------------------------------------------------------------- 1 | ''' Python program to multiply 2 | two matrices''' 3 | def matrix_multiplication(A,B): 4 | result=[] 5 | for i in range(len(A)): 6 | result.append([0]*len(B[0])) 7 | for i in range(len(A)): 8 | for j in range(len(B[0])): 9 | for k in range(len(B)): 10 | result[i][j] += A[i][k] * B[k][j] 11 | for row in result: 12 | print(row) 13 | matrix_multiplication([[12, 7, 3],[4, 5, 6],[7, 8, 9]], 14 | [[5, 8, 1, 2],[6, 7, 3, 0],[4, 5, 9, 1]]) 15 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_list-group.scss: -------------------------------------------------------------------------------- 1 | // List Groups 2 | 3 | @mixin list-group-item-variant($state, $background, $color) { 4 | .list-group-item-#{$state} { 5 | color: $color; 6 | background-color: $background; 7 | 8 | &.list-group-item-action { 9 | @include hover-focus { 10 | color: $color; 11 | background-color: darken($background, 5%); 12 | } 13 | 14 | &.active { 15 | color: $white; 16 | background-color: $color; 17 | border-color: $color; 18 | } 19 | } 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_stretched-link.scss: -------------------------------------------------------------------------------- 1 | // 2 | // Stretched link 3 | // 4 | 5 | .stretched-link { 6 | &::after { 7 | position: absolute; 8 | top: 0; 9 | right: 0; 10 | bottom: 0; 11 | left: 0; 12 | z-index: 1; 13 | // Just in case `pointer-events: none` is set on a parent 14 | pointer-events: auto; 15 | content: ""; 16 | // IE10 bugfix, see https://stackoverflow.com/questions/16947967/ie10-hover-pseudo-class-doesnt-work-without-background-color 17 | background-color: rgba(0, 0, 0, 0); 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/drawable-v21/launch_background.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 12 | 13 | -------------------------------------------------------------------------------- /C++ Codes/prev_permutation.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include 4 | using namespace std; 5 | int main() 6 | { 7 | int arr[] = { 1, 2, 3 }; 8 | 9 | sort(arr, arr + 3); 10 | reverse(arr, arr + 3); 11 | 12 | cout << "The 3! possible permutations with 3 elements:\n"; 13 | do { 14 | cout << arr[0] << " " << arr[1] << " " << arr[2] << "\n"; 15 | } while (prev_permutation(arr, arr + 3)); 16 | 17 | cout << "After loop: " << arr[0] << ' ' << arr[1] 18 | << ' ' << arr[2] << '\n'; 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/Runner/Assets.xcassets/LaunchImage.imageset/Contents.json: -------------------------------------------------------------------------------- 1 | { 2 | "images" : [ 3 | { 4 | "idiom" : "universal", 5 | "filename" : "LaunchImage.png", 6 | "scale" : "1x" 7 | }, 8 | { 9 | "idiom" : "universal", 10 | "filename" : "LaunchImage@2x.png", 11 | "scale" : "2x" 12 | }, 13 | { 14 | "idiom" : "universal", 15 | "filename" : "LaunchImage@3x.png", 16 | "scale" : "3x" 17 | } 18 | ], 19 | "info" : { 20 | "version" : 1, 21 | "author" : "xcode" 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /English Dictionary CMD/database.py: -------------------------------------------------------------------------------- 1 | import mysql.connector 2 | 3 | con = mysql.connector.connect( 4 | user = "ardit700_student", 5 | password = "ardit700_student", 6 | host = "108.167.140.122", 7 | database = "ardit700_pm1database" 8 | ) 9 | 10 | cursor = con.cursor() 11 | word = input("Enter word: ") 12 | query = cursor.execute("SELECT * FROM Dictionary WHERE Expression = '{}'".format(word)) 13 | results = cursor.fetchall() 14 | 15 | if results: 16 | for result in results: 17 | print(result[1]) 18 | else: 19 | print("No word found!") 20 | 21 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/flutter/generated_plugins.cmake: -------------------------------------------------------------------------------- 1 | # 2 | # Generated file, do not edit. 3 | # 4 | 5 | list(APPEND FLUTTER_PLUGIN_LIST 6 | ) 7 | 8 | set(PLUGIN_BUNDLED_LIBRARIES) 9 | 10 | foreach(plugin ${FLUTTER_PLUGIN_LIST}) 11 | add_subdirectory(flutter/ephemeral/.plugin_symlinks/${plugin}/windows plugins/${plugin}) 12 | target_link_libraries(${BINARY_NAME} PRIVATE ${plugin}_plugin) 13 | list(APPEND PLUGIN_BUNDLED_LIBRARIES $) 14 | list(APPEND PLUGIN_BUNDLED_LIBRARIES ${${plugin}_bundled_libraries}) 15 | endforeach(plugin) 16 | -------------------------------------------------------------------------------- /C++ Codes/Power_Of_Two.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | bool isPowerOfTwo(int n) { 5 | int cnt = 0; 6 | while(n>0){ 7 | cnt++; 8 | n = n & (n-1); 9 | } 10 | cout<> t; 22 | while (t--) 23 | { 24 | int n,cnt=0; 25 | cin >>n; 26 | cout< 2 | using namespace std; 3 | 4 | void check_palindrome(string s) 5 | { 6 | int len = s.length(); 7 | for (int i=0; i lst[j]: 9 | min_idx = j 10 | # Swap the found minimum element with the first element 11 | lst[i], lst[min_idx] = lst[min_idx], lst[i] 12 | return lst 13 | # Driver code to the algortihm 14 | lst = [64, 25, 12, 22, 11] 15 | print ("Sorted array : ",sort(lst)) 16 | 17 | -------------------------------------------------------------------------------- /C++ Codes/Check leap year.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int year; 6 | 7 | cout << "Enter a year: "; 8 | cin >> year; 9 | 10 | if (year % 4 == 0) { 11 | if (year % 100 == 0) { 12 | if (year % 400 == 0) 13 | cout << year << " is a leap year."; 14 | else 15 | cout << year << " is not a leap year."; 16 | } 17 | else 18 | cout << year << " is a leap year."; 19 | } 20 | else 21 | cout << year << " is not a leap year."; 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /C++ Codes/leapyear.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int year; 6 | 7 | cout << "Enter a year: "; 8 | cin >> year; 9 | 10 | if (year % 4 == 0) { 11 | if (year % 100 == 0) { 12 | if (year % 400 == 0) 13 | cout << year << " is a leap year."; 14 | else 15 | cout << year << " is not a leap year."; 16 | } 17 | else 18 | cout << year << " is a leap year."; 19 | } 20 | else 21 | cout << year << " is not a leap year."; 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /C++ Codes/pascal'striangle.cpp: -------------------------------------------------------------------------------- 1 | // 118. Pascal's Triangle 2 | // https://leetcode.com/problems/pascals-triangle/ 3 | 4 | 5 | class Solution { 6 | public: 7 | vector> generate(int numRows) { 8 | vector> ans(numRows); 9 | 10 | for(int i=0;irecursion: -------------------------------------------------------------------------------- 1 | import java.io.*; 2 | import java.util.*; 3 | 4 | public class Main { 5 | 6 | public static void main(String[] args) throws Exception { 7 | // write your code here 8 | Scanner sc =new Scanner(System.in); 9 | int n=sc.nextInt(); 10 | pzz(n); 11 | } 12 | 13 | public static void pzz(int n){ 14 | if(n==0)return; 15 | System.out.print(n+" "); 16 | pzz(n-1); 17 | System.out.print(n+" "); 18 | pzz(n-1); 19 | System.out.print(n+" "); 20 | 21 | 22 | } 23 | 24 | } 25 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_pagination.scss: -------------------------------------------------------------------------------- 1 | // Pagination 2 | 3 | @mixin pagination-size($padding-y, $padding-x, $font-size, $line-height, $border-radius) { 4 | .page-link { 5 | padding: $padding-y $padding-x; 6 | @include font-size($font-size); 7 | line-height: $line-height; 8 | } 9 | 10 | .page-item { 11 | &:first-child { 12 | .page-link { 13 | @include border-left-radius($border-radius); 14 | } 15 | } 16 | &:last-child { 17 | .page-link { 18 | @include border-right-radius($border-radius); 19 | } 20 | } 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /C-lang Codes/fibonacci triangle.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main(){ 4 | int a=0,b=1,i,c,n,j; 5 | system("cls"); 6 | printf("Enter the limit:"); 7 | scanf("%d",&n); 8 | for(i=1;i<=n;i++) 9 | { 10 | a=0; 11 | b=1; 12 | printf("%d\t",b); 13 | for(j=1;j 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | int *nums = new int[n]; 8 | for(int i = 0; i < n; ++i) 9 | cin>>nums[i]; 10 | cout<<"REPEATED: "; 11 | for(int i = 0; i < n; ++i) 12 | { 13 | if(nums[abs(nums[i]) - 1] < 0) 14 | cout< 0) 21 | cout<<"MISSING: "< 2 | #include 3 | 4 | int main() { 5 | char sentence[1000]; 6 | 7 | // creating file pointer to work with files 8 | FILE *fptr; 9 | 10 | // opening file in writing mode 11 | fptr = fopen("program.txt", "w"); 12 | 13 | // exiting program 14 | if (fptr == NULL) { 15 | printf("Error!"); 16 | exit(1); 17 | } 18 | printf("Enter a sentence:\n"); 19 | fgets(sentence, sizeof(sentence), stdin); 20 | fprintf(fptr, "%s", sentence); 21 | fclose(fptr); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /C++ Codes/Isomorphic Strings: -------------------------------------------------------------------------------- 1 | /* 2 | Input: s = "foo", t = "bar" 3 | Output: false 4 | */ 5 | class Solution { 6 | public: 7 | bool isIsomorphic(string s, string t) { 8 | mapmp; 9 | setx; 10 | for(int i=0;i 2 | using namespace std; 3 | 4 | void hollowSquare(int row, int col) 5 | { 6 | for (int i = 0; i < col; i++) 7 | { 8 | for (int j = 0; j < row; j++) 9 | { 10 | if (i == 0 || i == col - 1 || j == 0 || j == row - 1) 11 | { 12 | cout << "* "; 13 | } 14 | else 15 | cout << " "; 16 | } 17 | cout << endl; 18 | } 19 | } 20 | 21 | int main() 22 | { 23 | 24 | hollowSquare(5, 5); 25 | // You Can Change your Length And Width Over Here 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_sizing.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | // Width and height 4 | 5 | @each $prop, $abbrev in (width: w, height: h) { 6 | @each $size, $length in $sizes { 7 | .#{$abbrev}-#{$size} { #{$prop}: $length !important; } 8 | } 9 | } 10 | 11 | .mw-100 { max-width: 100% !important; } 12 | .mh-100 { max-height: 100% !important; } 13 | 14 | // Viewport additional helpers 15 | 16 | .min-vw-100 { min-width: 100vw !important; } 17 | .min-vh-100 { min-height: 100vh !important; } 18 | 19 | .vw-100 { width: 100vw !important; } 20 | .vh-100 { height: 100vh !important; } 21 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/README.md: -------------------------------------------------------------------------------- 1 | # showuser 2 | 3 | A new Flutter project. 4 | 5 | ## Getting Started 6 | 7 | This project is a starting point for a Flutter application. 8 | 9 | A few resources to get you started if this is your first Flutter project: 10 | 11 | - [Lab: Write your first Flutter app](https://flutter.dev/docs/get-started/codelab) 12 | - [Cookbook: Useful Flutter samples](https://flutter.dev/docs/cookbook) 13 | 14 | For help getting started with Flutter, view our 15 | [online documentation](https://flutter.dev/docs), which offers tutorials, 16 | samples, guidance on mobile development, and a full API reference. 17 | -------------------------------------------------------------------------------- /C++ Codes/Prefix ++.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | class Check 5 | { 6 | private: 7 | int i; 8 | public: 9 | Check(): i(0) { } 10 | void operator ++() 11 | { ++i; } 12 | void Display() 13 | { cout << "i=" << i << endl; } 14 | }; 15 | 16 | int main() 17 | { 18 | Check obj; 19 | 20 | // Displays the value of data member i for object obj 21 | obj.Display(); 22 | 23 | // Invokes operator function void operator ++( ) 24 | ++obj; 25 | 26 | // Displays the value of data member i for object obj 27 | obj.Display(); 28 | 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /C++ Codes/Container With Most Water.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Input: height = [1,8,6,2,5,4,8,3,7] 3 | Output: 49 4 | */ 5 | class Solution { 6 | public: 7 | int maxArea(vector& height) { 8 | int water=0; 9 | int start=0,end=height.size()-1; 10 | while(start 2 | 3 | // function for kadane's algorithm 4 | static int kadane(int Array[], int n) { 5 | int max_sum = 0; 6 | int current_sum = 0; 7 | 8 | for(int i=0; i 0) { 17 | box-shadow: $result; 18 | } 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /Java Codes/RomanToIntegers.java: -------------------------------------------------------------------------------- 1 | // for input s = "IX" 2 | // Output: 9 3 | 4 | class Solution { 5 | public int romanToInt(String s) { // here s is the input string 6 | Map map = new HashMap<>(); 7 | map.put('I',1); 8 | map.put('V',5); 9 | map.put('X',10); 10 | map.put('L',50); 11 | map.put('C',100); 12 | map.put('D',500); 13 | map.put('M',1000); 14 | int result =map.get(s.charAt(s.length()-1)); 15 | for(int i=s.length()-2;i>=0;i--) 16 | { 17 | if(map.get(s.charAt(i)) 2 | int main(){ 3 | /* 2D array declaration*/ 4 | int disp[2][3]; 5 | /*Counter variables for the loop*/ 6 | int i, j; 7 | for(i=0; i<2; i++) { 8 | for(j=0;j<3;j++) { 9 | printf("Enter value for disp[%d][%d]:", i, j); 10 | scanf("%d", &disp[i][j]); 11 | } 12 | } 13 | //Displaying array elements 14 | printf("Two Dimensional array elements:\n"); 15 | for(i=0; i<2; i++) { 16 | for(j=0;j<3;j++) { 17 | printf("%d ", disp[i][j]); 18 | if(j==2){ 19 | printf("\n"); 20 | } 21 | } 22 | } 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_position.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | // Common values 4 | @each $position in $positions { 5 | .position-#{$position} { position: $position !important; } 6 | } 7 | 8 | // Shorthand 9 | 10 | .fixed-top { 11 | position: fixed; 12 | top: 0; 13 | right: 0; 14 | left: 0; 15 | z-index: $zindex-fixed; 16 | } 17 | 18 | .fixed-bottom { 19 | position: fixed; 20 | right: 0; 21 | bottom: 0; 22 | left: 0; 23 | z-index: $zindex-fixed; 24 | } 25 | 26 | .sticky-top { 27 | @supports (position: sticky) { 28 | position: sticky; 29 | top: 0; 30 | z-index: $zindex-sticky; 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /C-lang Codes/createapassword.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int main() 5 | { 6 | char pass[20], e_pass[20]; 7 | int num1, num2, sum; 8 | printf("Create a Password: "); 9 | scanf("%s", pass); 10 | printf("\nEnter any two number to Add: "); 11 | scanf("%d %d", &num1, &num2); 12 | printf("\nEnter password to see the Result: "); 13 | scanf("%s", e_pass); 14 | if(!strcmp(pass, e_pass)) 15 | { 16 | sum = num1 + num2; 17 | printf("\n%d + %d = %d", num1, num2, sum); 18 | } 19 | else 20 | printf("\nSorry! You entered a Wrong Password"); 21 | getch(); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_display.scss: -------------------------------------------------------------------------------- 1 | // stylelint-disable declaration-no-important 2 | 3 | // 4 | // Utilities for common `display` values 5 | // 6 | 7 | @each $breakpoint in map-keys($grid-breakpoints) { 8 | @include media-breakpoint-up($breakpoint) { 9 | $infix: breakpoint-infix($breakpoint, $grid-breakpoints); 10 | 11 | @each $value in $displays { 12 | .d#{$infix}-#{$value} { display: $value !important; } 13 | } 14 | } 15 | } 16 | 17 | 18 | // 19 | // Utilities for toggling `display` in print 20 | // 21 | 22 | @media print { 23 | @each $value in $displays { 24 | .d-print-#{$value} { display: $value !important; } 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /C++ Codes/TowerOfHanoi.cpp: -------------------------------------------------------------------------------- 1 | // Tower of Hanoi 2 | #include 3 | using namespace std; 4 | 5 | void towerOfHanoi(int n, char from_rod, 6 | char to_rod, char aux_rod) 7 | { 8 | if (n == 1) 9 | { 10 | cout << "Move disk 1 from rod " << from_rod << 11 | " to rod " << to_rod< maxSlidingWindow(vector& nums, int k) { 9 | priority_queue>maxh; 10 | vectorres; 11 | for(int i=0;ii-k)) 19 | maxh.pop(); 20 | res.push_back(maxh.top().first); 21 | } 22 | return res; 23 | } 24 | }; 25 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/web/manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "showuser", 3 | "short_name": "showuser", 4 | "start_url": ".", 5 | "display": "standalone", 6 | "background_color": "#0175C2", 7 | "theme_color": "#0175C2", 8 | "description": "A new Flutter project.", 9 | "orientation": "portrait-primary", 10 | "prefer_related_applications": false, 11 | "icons": [ 12 | { 13 | "src": "icons/Icon-192.png", 14 | "sizes": "192x192", 15 | "type": "image/png" 16 | }, 17 | { 18 | "src": "icons/Icon-512.png", 19 | "sizes": "512x512", 20 | "type": "image/png" 21 | } 22 | ] 23 | } 24 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/runner/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.15) 2 | project(runner LANGUAGES CXX) 3 | 4 | add_executable(${BINARY_NAME} WIN32 5 | "flutter_window.cpp" 6 | "main.cpp" 7 | "run_loop.cpp" 8 | "utils.cpp" 9 | "win32_window.cpp" 10 | "${FLUTTER_MANAGED_DIR}/generated_plugin_registrant.cc" 11 | "Runner.rc" 12 | "runner.exe.manifest" 13 | ) 14 | apply_standard_settings(${BINARY_NAME}) 15 | target_compile_definitions(${BINARY_NAME} PRIVATE "NOMINMAX") 16 | target_link_libraries(${BINARY_NAME} PRIVATE flutter flutter_wrapper_app) 17 | target_include_directories(${BINARY_NAME} PRIVATE "${CMAKE_SOURCE_DIR}") 18 | add_dependencies(${BINARY_NAME} flutter_assemble) 19 | -------------------------------------------------------------------------------- /C++ Codes/LongestConsecutiveSubsequence.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int findLongestConseqSubseq(int arr[], int n) 4 | { 5 | unordered_set S; 6 | int ans = 0; 7 | for (int i = 0; i < n; i++) 8 | S.insert(arr[i]); 9 | for (int i = 0; i < n; i++) 10 | { 11 | if (S.find(arr[i] - 1) == S.end()) 12 | { 13 | int j = arr[i]; 14 | while (S.find(j) != S.end()) 15 | j++; 16 | ans = max(ans, j - arr[i]); 17 | } 18 | } 19 | return ans; 20 | } 21 | int main() 22 | { 23 | int n; 24 | cin>>n; 25 | int *arr = new int[n]; 26 | for(int i = 0; i < n; ++i) 27 | cin>>arr[i]; 28 | cout< 2 | #include 3 | int main() 4 | { 5 | int starTot, rowTot, i, j, starInOneRow, rem; 6 | printf("How many stars you want to print ? "); 7 | scanf("%d", &starTot); 8 | printf("Upto how many rows ? "); 9 | scanf("%d", &rowTot); 10 | starInOneRow = starTot/rowTot; 11 | rem = starTot%rowTot; 12 | printf("\n"); 13 | i=0; 14 | while(i twoSum(vector& nums, int target) { 5 | unordered_set s; vector ans(2); 6 | for(int i=0; i=0 and key < arr[j] : 16 | arr[j+1] = arr[j] 17 | j -= 1 18 | arr[j+1] = key 19 | 20 | 21 | # Driver code to test above 22 | arr = [132, 111, 613, 45, 36] 23 | insertionSort(arr) 24 | print ("Sorted array is:") 25 | for i in range(len(arr)): 26 | print ("%d" %arr[i]) 27 | 28 | # This code is contributed by Nikhar Kesari 29 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/ios/.gitignore: -------------------------------------------------------------------------------- 1 | *.mode1v3 2 | *.mode2v3 3 | *.moved-aside 4 | *.pbxuser 5 | *.perspectivev3 6 | **/*sync/ 7 | .sconsign.dblite 8 | .tags* 9 | **/.vagrant/ 10 | **/DerivedData/ 11 | Icon? 12 | **/Pods/ 13 | **/.symlinks/ 14 | profile 15 | xcuserdata 16 | **/.generated/ 17 | Flutter/App.framework 18 | Flutter/Flutter.framework 19 | Flutter/Flutter.podspec 20 | Flutter/Generated.xcconfig 21 | Flutter/ephemeral/ 22 | Flutter/app.flx 23 | Flutter/app.zip 24 | Flutter/flutter_assets/ 25 | Flutter/flutter_export_environment.sh 26 | ServiceDefinitions.json 27 | Runner/GeneratedPluginRegistrant.* 28 | 29 | # Exceptions to above rules. 30 | !default.mode1v3 31 | !default.mode2v3 32 | !default.pbxuser 33 | !default.perspectivev3 34 | -------------------------------------------------------------------------------- /bubblesort.py: -------------------------------------------------------------------------------- 1 | # Python program for implementation of Bubble Sort 2 | 3 | def bubbleSort(arr): 4 | n = len(arr) 5 | 6 | # Traverse through all array elements 7 | for i in range(n-1): 8 | # range(n) also work but outer loop will repeat one time more than needed. 9 | 10 | # Last i elements are already in place 11 | for j in range(0, n-i-1): 12 | 13 | # traverse the array from 0 to n-i-1 14 | # Swap if the element found is greater 15 | # than the next element 16 | if arr[j] > arr[j + 1] : 17 | arr[j], arr[j + 1] = arr[j + 1], arr[j] 18 | 19 | # Driver code to test above 20 | arr = [64, 34, 25, 12, 22, 11, 90] 21 | 22 | bubbleSort(arr) 23 | 24 | print ("Sorted array is:") 25 | for i in range(len(arr)): 26 | print ("% d" % arr[i]), 27 | -------------------------------------------------------------------------------- /C++ Codes/rainwater: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int maxWater(int arr[], int n) 5 | { 6 | 7 | int res = 0; 8 | 9 | for (int i = 1; i < n-1; i++) { 10 | 11 | int left = arr[i]; 12 | for (int j=0; j 2 | using namespace std; 3 | 4 | int maxWater(int arr[], int n) 5 | { 6 | 7 | int res = 0; 8 | 9 | for (int i = 1; i < n-1; i++) { 10 | 11 | int left = arr[i]; 12 | for (int j=0; j 5 | #include 6 | 7 | // Creates a console for the process, and redirects stdout and stderr to 8 | // it for both the runner and the Flutter library. 9 | void CreateAndAttachConsole(); 10 | 11 | // Takes a null-terminated wchar_t* encoded in UTF-16 and returns a std::string 12 | // encoded in UTF-8. Returns an empty std::string on failure. 13 | std::string Utf8FromUtf16(const wchar_t* utf16_string); 14 | 15 | // Gets the command line arguments passed in as a std::vector, 16 | // encoded in UTF-8. Returns an empty std::vector on failure. 17 | std::vector GetCommandLineArguments(); 18 | 19 | #endif // RUNNER_UTILS_H_ 20 | -------------------------------------------------------------------------------- /C++ Codes/pairSwap.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main() 4 | { 5 | int n, i, j; 6 | printf("Enter the number of elements in the array to be searched: "); 7 | scanf("%d", &n); 8 | int a, b= 0; 9 | int arr[n]; 10 | printf("Enter the elements of the array: "); 11 | for(i=0; i& str) { 8 | int n = str.size(); 9 | 10 | if(n==0) return ""; 11 | 12 | 13 | 14 | string ans = ""; 15 | 16 | sort(begin(str), end(str)); 17 | 18 | string a = str[0]; 19 | 20 | string b = str[n-1]; 21 | 22 | 23 | 24 | for(int i=0; i 2 | #define MAX 50 3 | char stack[MAX]; 4 | int top=-1; 5 | void push(char item) 6 | { 7 | if(top==MAX-1) 8 | printf("Stack is full1\n"); 9 | else 10 | { 11 | top++; 12 | stack[top]=item; 13 | } 14 | } 15 | int pop() 16 | { 17 | char item; 18 | if(top==-1) 19 | printf("Stack is empty!\n"); 20 | else 21 | { 22 | item=stack[top]; 23 | top--; 24 | return item; 25 | } 26 | } 27 | int main(void) 28 | { 29 | char str[20]; 30 | int i,l; 31 | printf("Enter a string:\n"); 32 | scanf("%s",str); 33 | for(l=0;str[l];l++); 34 | for(i=0;i 2 | using namespace std; 3 | int matrixsearch(int arr[][100], int m, int n, int key) 4 | { 5 | 6 | for (int i = 0; i < m; i++) 7 | { 8 | for (int j = 0; j < n; j++) 9 | { 10 | if (arr[i][j] == key) 11 | { 12 | cout << "1"; 13 | return 0; 14 | } 15 | 16 | } 17 | } 18 | cout<<0; 19 | return 0; 20 | } 21 | 22 | int main() 23 | { 24 | int m, n, key; 25 | cin >> m >> n; 26 | int a[100][100]; 27 | for (int i = 0; i < m; i++) 28 | { 29 | for (int j = 0; j < n; j++) 30 | { 31 | cin >> a[i][j]; 32 | } 33 | } 34 | 35 | cout << "enter the key"; 36 | cin >> key; 37 | matrixsearch(a, m, n, key); 38 | } 39 | -------------------------------------------------------------------------------- /C-lang Codes/twosum Problem.c: -------------------------------------------------------------------------------- 1 | typedef struct { 2 | int num; 3 | int idx; 4 | // Makes structure hashable 5 | UT_hash_handle hh; 6 | } num_t; 7 | 8 | int* twoSum(int* nums, int numsSize, int target, int* returnSize){ 9 | int* res = calloc((*returnSize = 2), sizeof(int)); 10 | num_t *numsHash = NULL, *num = NULL, *tmp = NULL; 11 | 12 | for(int i = 0; i < numsSize; ++i){ 13 | int toFind = target - nums[i]; 14 | HASH_FIND_INT(numsHash, &toFind, num); 15 | 16 | if (num != NULL){ 17 | res[0] = num->idx; 18 | res[1] = i; 19 | 20 | break; 21 | } else { 22 | num = malloc(sizeof(num_t)); 23 | num->num = nums[i]; num->idx = i; 24 | 25 | HASH_ADD_INT(numsHash, num, num); 26 | } 27 | } 28 | 29 | HASH_ITER(hh, numsHash, num, tmp) { 30 | HASH_DEL(numsHash, num); free(num); 31 | } 32 | 33 | return res; 34 | } 35 | -------------------------------------------------------------------------------- /C-lang Codes/DFS_Algo.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int a[20][20],reach[20],n; 4 | void dfs(int v) { 5 | int i; 6 | reach[v]=1; 7 | for (i=1;i<=n;i++) 8 | if(a[v][i] && !reach[i]) { 9 | printf("\n %d->%d",v,i); 10 | dfs(i); 11 | } 12 | } 13 | void main() { 14 | int i,j,count=0; 15 | clrscr(); 16 | printf("\n Enter number of vertices:"); 17 | scanf("%d",&n); 18 | for (i=1;i<=n;i++) { 19 | reach[i]=0; 20 | for (j=1;j<=n;j++) 21 | a[i][j]=0; 22 | } 23 | printf("\n Enter the adjacency matrix:\n"); 24 | for (i=1;i<=n;i++) 25 | for (j=1;j<=n;j++) 26 | scanf("%d",&a[i][j]); 27 | dfs(1); 28 | printf("\n"); 29 | for (i=1;i<=n;i++) { 30 | if(reach[i]) 31 | count++; 32 | } 33 | if(count==n) 34 | printf("\n Graph is connected"); else 35 | printf("\n Graph is not connected"); 36 | getch(); 37 | -------------------------------------------------------------------------------- /C++ Codes/MaxMinArr.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | 7 | int n; 8 | cout << ("Enter Size of Array "); 9 | cin >> n; 10 | 11 | cout << ("Enter Elements "); 12 | int arr[n]; 13 | for (int i = 0; i < n; i++) 14 | { 15 | cin >> arr[i]; 16 | } 17 | 18 | int Min = arr[0]; 19 | int Max = arr[0]; 20 | 21 | for (int j = 0; j < n; j++) 22 | { 23 | if (arr[j] >= Max) 24 | { 25 | Max = arr[j]; 26 | } 27 | if (arr[j] <= Min) 28 | { 29 | Min = arr[j]; 30 | } 31 | } 32 | cout << ("The Max Element in Array is ") << Max << endl; 33 | // cout << Max; 34 | // cout << endl; 35 | cout << ("The Min Element in Array is ") << Min; 36 | // cout << Min; 37 | 38 | return 0; 39 | } 40 | -------------------------------------------------------------------------------- /C-lang Codes/minimize the heights.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int t; 4 | scanf("%d",&t); 5 | while(t--){ 6 | int n,k; 7 | scanf("%d%d",&k,&n); 8 | int a[n]; 9 | for(int i=0;ia[i]) 16 | min=a[i]; 17 | if(max=k){ 21 | int avg=(min+max)/2; 22 | for(int i=0;ia[i]) 32 | min=a[i]; 33 | if(maxrecursion: -------------------------------------------------------------------------------- 1 | import java.io.*; 2 | import java.util.*; 3 | 4 | public class Main { 5 | 6 | public static void main(String[] args) throws Exception { 7 | // write your code here 8 | Scanner sc =new Scanner(System.in); 9 | int n=sc.nextInt(); 10 | int[] arr=new int[n]; 11 | for(int i=0;i arr[idx]){ 25 | return misa; 26 | } else { 27 | return arr[idx]; 28 | } 29 | } 30 | 31 | } 32 | -------------------------------------------------------------------------------- /C++ Codes/Stock: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int max(int x, int y) 5 | { 6 | if (x > y) 7 | return x; 8 | else 9 | return y; 10 | } 11 | 12 | int stock1(int price[], int start, int end) 13 | { 14 | if (start >= end) 15 | return 0; 16 | int profit = 0; 17 | 18 | for (int i = start; i < end; i++) 19 | { 20 | for (int j = i + 1; j <= end; j++) 21 | { 22 | if (price[j] > price[i]) 23 | { 24 | int curr_profit = price[j] - price[i] + stock1(price, start, i - 1) + stock1(price, j + 1, end); 25 | 26 | profit = max(profit, curr_profit); 27 | } 28 | } 29 | } 30 | return profit; 31 | } 32 | 33 | int main() 34 | { 35 | int price[5] = {3, 5, 1, 8, 12}; 36 | cout << stock1(price, start, end - 1); 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /C++ Codes/bfs.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | void bfs(list* adj,int s){ 6 | queue q; 7 | vector visited(4,0); 8 | 9 | visited[s]=1; 10 | q.push(s); 11 | 12 | while(!q.empty()){ 13 | int i=q.front(); 14 | cout<* adj; 26 | adj= new list[4]; 27 | adj[0].push_back(1); 28 | adj[0].push_back(3); 29 | adj[1].push_back(0); 30 | adj[1].push_back(2); 31 | adj[2].push_back(3); 32 | adj[2].push_back(1); 33 | adj[3].push_back(0); 34 | adj[3].push_back(2); 35 | 36 | bfs(adj,2); 37 | } 38 | -------------------------------------------------------------------------------- /C++ Codes/GroupAnagrams.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | 3 | Input: strs = ["eat","tea","tan","ate","nat","bat"] 4 | Output: [["bat"],["nat","tan"],["ate","eat","tea"]] 5 | 6 | */ 7 | class Solution { 8 | public: 9 | vector> groupAnagrams(vector& strs) { 10 | 11 | vector> ans; 12 | 13 | unordered_map > mp; 14 | 15 | for(int i = 0; i < strs.size(); ++i) { 16 | 17 | string temp = strs[i]; 18 | sort(temp.begin(), temp.end()); 19 | 20 | mp[temp].push_back(strs[i]); 21 | } 22 | if(mp.size()) { 23 | for(auto it = mp.begin(); it != mp.end(); ++it) { 24 | 25 | ans.push_back(it->second); 26 | } 27 | } 28 | mp.clear(); 29 | return ans; 30 | } 31 | }; 32 | -------------------------------------------------------------------------------- /Java Codes/InvertBinaryTree.java: -------------------------------------------------------------------------------- 1 | // Input: root = [4,2,7,1,3,6,9] 2 | // Output: [4,7,2,9,6,3,1] 3 | 4 | 5 | /** 6 | * Definition for a binary tree node. 7 | * public class TreeNode { 8 | * int val; 9 | * TreeNode left; 10 | * TreeNode right; 11 | * TreeNode() {} 12 | * TreeNode(int val) { this.val = val; } 13 | * TreeNode(int val, TreeNode left, TreeNode right) { 14 | * this.val = val; 15 | * this.left = left; 16 | * this.right = right; 17 | * } 18 | * } 19 | */ 20 | class Solution { 21 | public TreeNode invertTree(TreeNode root) { 22 | if(root == null) 23 | return root; 24 | TreeNode temp= root.left; // node temp will be use to swap nodes 25 | root.left = invertTree(root.right); 26 | root.right = invertTree(temp); 27 | 28 | 29 | return root; 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /C++ Codes/StockBuySell.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | void stockBuySell(int price[], int n) 4 | { 5 | 6 | if (n == 1) 7 | return; 8 | int i = 0, profit = 0; 9 | while (i < n - 1) 10 | { 11 | while ((i < n - 1) && (price[i + 1] <= price[i])) 12 | i++; 13 | if (i == n - 1) 14 | break; 15 | int buy = i++; 16 | profit -= price[buy]; 17 | while ((i < n) && (price[i] >= price[i - 1])) 18 | i++; 19 | int sell = i - 1; 20 | profit += price[sell]; 21 | cout << "Buy on day: " << buy 22 | << "\t Sell on day: " << sell << endl; 23 | } 24 | cout<<"\nPROFIT: "<>n; 30 | int *price = new int[n]; 31 | for(int i = 0; i < n; ++i) 32 | cin>>price[i]; 33 | stockBuySell(price, n); 34 | delete []price; 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /C-lang Codes/finding_array_largest&smallest_element.c: -------------------------------------------------------------------------------- 1 | /* Write a program to store random numbers into an array of n integers and then find out the smallest and largest number stored in it. n is the user input. 2 | */ 3 | 4 | #include 5 | #include 6 | int main() 7 | { int n,i,large,small; 8 | printf("Enter the size of the array: "); 9 | scanf("%d",&n); 10 | int a[n]; 11 | printf("\nEnter the %d elements of the array: ",n); 12 | for(i=0;ia[i]) 25 | small=a[i]; 26 | } 27 | printf("\nSmallest element is: %d",small); 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_screen-reader.scss: -------------------------------------------------------------------------------- 1 | // Only display content to screen readers 2 | // 3 | // See: https://a11yproject.com/posts/how-to-hide-content/ 4 | // See: https://hugogiraudel.com/2016/10/13/css-hide-and-seek/ 5 | 6 | @mixin sr-only { 7 | position: absolute; 8 | width: 1px; 9 | height: 1px; 10 | padding: 0; 11 | overflow: hidden; 12 | clip: rect(0, 0, 0, 0); 13 | white-space: nowrap; 14 | border: 0; 15 | } 16 | 17 | // Use in conjunction with .sr-only to only display content when it's focused. 18 | // 19 | // Useful for "Skip to main content" links; see https://www.w3.org/TR/2013/NOTE-WCAG20-TECHS-20130905/G1 20 | // 21 | // Credit: HTML5 Boilerplate 22 | 23 | @mixin sr-only-focusable { 24 | &:active, 25 | &:focus { 26 | position: static; 27 | width: auto; 28 | height: auto; 29 | overflow: visible; 30 | clip: auto; 31 | white-space: normal; 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /C++ Codes/ReshapeMatrix.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | vector> matrixReshape(vector>& mat, int r, int c) { 4 | vector v; 5 | int k=0; 6 | vector> mr(r , vector (c, 0));; 7 | int a=mat.size(); 8 | int b=mat[0].size(); 9 | if(a*b != r*c) 10 | { 11 | return mat; 12 | } 13 | 14 | for(int i=0;i 2 | 3 | 4 | 5 | CFBundleDevelopmentRegion 6 | en 7 | CFBundleExecutable 8 | App 9 | CFBundleIdentifier 10 | io.flutter.flutter.app 11 | CFBundleInfoDictionaryVersion 12 | 6.0 13 | CFBundleName 14 | App 15 | CFBundlePackageType 16 | FMWK 17 | CFBundleShortVersionString 18 | 1.0 19 | CFBundleSignature 20 | ???? 21 | CFBundleVersion 22 | 1.0 23 | MinimumOSVersion 24 | 8.0 25 | 26 | 27 | -------------------------------------------------------------------------------- /Python Codes/matrix_zig_zag.py: -------------------------------------------------------------------------------- 1 | ''' 2 | This programs prints an input 2D matrix 3 | in zig-zag fashion. 4 | ''' 5 | 6 | def zig_zag_pattern(matrix): 7 | #Storing dimensions of the input matrix 8 | rows=len(matrix) 9 | cols=len(matrix[0]) 10 | result=[[] for i in range(rows+cols-1)] 11 | 12 | for i in range(rows): 13 | for j in range(cols): 14 | ind=i+j 15 | if(ind%2 ==0): 16 | 17 | #adding at beginning 18 | result[ind].insert(0,matrix[i][j]) 19 | else: 20 | 21 | #adding at end 22 | result[ind].append(matrix[i][j]) 23 | 24 | for i in result: 25 | for j in i: 26 | print(j,end=" ") 27 | 28 | if __name__ == "__main__": 29 | 30 | zig_zag_pattern([ 31 | [ 1, 2, 3,], 32 | [ 4, 5, 6 ], 33 | [ 7, 8, 9 ], 34 | ]) 35 | 36 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_hover.scss: -------------------------------------------------------------------------------- 1 | // Hover mixin and `$enable-hover-media-query` are deprecated. 2 | // 3 | // Originally added during our alphas and maintained during betas, this mixin was 4 | // designed to prevent `:hover` stickiness on iOS-an issue where hover styles 5 | // would persist after initial touch. 6 | // 7 | // For backward compatibility, we've kept these mixins and updated them to 8 | // always return their regular pseudo-classes instead of a shimmed media query. 9 | // 10 | // Issue: https://github.com/twbs/bootstrap/issues/25195 11 | 12 | @mixin hover { 13 | &:hover { @content; } 14 | } 15 | 16 | @mixin hover-focus { 17 | &:hover, 18 | &:focus { 19 | @content; 20 | } 21 | } 22 | 23 | @mixin plain-hover-focus { 24 | &, 25 | &:hover, 26 | &:focus { 27 | @content; 28 | } 29 | } 30 | 31 | @mixin hover-focus-active { 32 | &:hover, 33 | &:focus, 34 | &:active { 35 | @content; 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /C-lang Codes/minimum number following a pattern.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | char str[100]; 4 | int arr[100],i,j,min,t,len,k,count,x; 5 | scanf("%d"'&t); 6 | while(t--){ 7 | scanf("%s",&str); 8 | len=strlen(str); 9 | min=1; 10 | k=0; 11 | for(i=0;i<=len;i++) 12 | arr[i]=0; 13 | count=0; 14 | for(i=0;i=k;j--){ 17 | arr[j]=min; 18 | min++; 19 | count++; 20 | } 21 | k=i+1; 22 | } 23 | } 24 | count=min+len-count; 25 | for(i=0;i<=len;i++){ 26 | if(arr[i]==0){ 27 | arr[i]=count; 28 | count--; 29 | } 30 | } 31 | for(i=0;i<=len;i++) 32 | printf("%d",arr[i]); 33 | printf("\n"); 34 | } 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /C-lang Codes/minspanningtree.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int a,b,u,v,n,i,j,ne=1; 4 | int visited[10]= { 5 | 0 6 | } 7 | ,min,mincost=0,cost[10][10]; 8 | void main() { 9 | clrscr(); 10 | printf("\n Enter the number of nodes:"); 11 | scanf("%d",&n); 12 | printf("\n Enter the adjacency matrix:\n"); 13 | for (i=1;i<=n;i++) 14 | for (j=1;j<=n;j++) { 15 | scanf("%d",&cost[i][j]); 16 | if(cost[i][j]==0) 17 | cost[i][j]=999; 18 | } 19 | visited[1]=1; 20 | printf("\n"); 21 | while(ne= low: 6 | 7 | mid = (high + low) // 2 8 | 9 | # If element is present at the middle itself 10 | if arr[mid] == x: 11 | return mid 12 | 13 | # If element is smaller than mid, then it can only 14 | # be present in left subarray 15 | elif arr[mid] > x: 16 | return binary_search(arr, low, mid - 1, x) 17 | 18 | # Else the element can only be present in right subarray 19 | else: 20 | return binary_search(arr, mid + 1, high, x) 21 | 22 | else: 23 | # Element is not present in the array 24 | return -1 25 | 26 | # Test array 27 | arr = [ 2, 3, 4, 10, 40 ] 28 | x = 10 29 | 30 | # Function call 31 | result = binary_search(arr, 0, len(arr)-1, x) 32 | 33 | if result != -1: 34 | print("Element is present at index", str(result)) 35 | else: 36 | print("Element is not present in array") 37 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/.gitignore: -------------------------------------------------------------------------------- 1 | # Miscellaneous 2 | *.class 3 | *.log 4 | *.pyc 5 | *.swp 6 | .DS_Store 7 | .atom/ 8 | .buildlog/ 9 | .history 10 | .svn/ 11 | 12 | # IntelliJ related 13 | *.iml 14 | *.ipr 15 | *.iws 16 | .idea/ 17 | 18 | # The .vscode folder contains launch configuration and tasks you configure in 19 | # VS Code which you may wish to be included in version control, so this line 20 | # is commented out by default. 21 | #.vscode/ 22 | 23 | # Flutter/Dart/Pub related 24 | **/doc/api/ 25 | **/ios/Flutter/.last_build_id 26 | .dart_tool/ 27 | .flutter-plugins 28 | .flutter-plugins-dependencies 29 | .packages 30 | .pub-cache/ 31 | .pub/ 32 | /build/ 33 | 34 | # Web related 35 | lib/generated_plugin_registrant.dart 36 | 37 | # Symbolication related 38 | app.*.symbols 39 | 40 | # Obfuscation related 41 | app.*.map.json 42 | 43 | # Android Studio will place build artifacts here 44 | /android/app/debug 45 | /android/app/profile 46 | /android/app/release 47 | -------------------------------------------------------------------------------- /C-lang Codes/Addnumbersupto50digits: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int rem, carry; 6 | int a[50], b[50], sum[51]; 7 | 8 | printf("Enter first number : \n"); 9 | for (int i = 0; i < 3; i++) 10 | scanf("%d", &a[i]); 11 | 12 | printf("Enter second number : \n"); 13 | for (int i = 0; i < 3; i++) 14 | scanf("%d", &b[i]); 15 | 16 | for (int i = 0; i < 3; i++) 17 | { 18 | sum[i] = a[i] + b[i]; 19 | // printf("%d ", sum[i]); 20 | } 21 | 22 | for (int i = 2; i >= 0; i--) 23 | { 24 | // printf("%d ", sum[i]); 25 | if (sum[i] > 9) 26 | { 27 | rem = sum[i] % 10; 28 | carry = sum[i] / 10; 29 | sum[i - 1] = sum[i - 1] + carry; 30 | sum[i] = rem; 31 | } 32 | } 33 | 34 | for (int i = 0; i < 3; i++) 35 | { 36 | // sum[i] = a[i] + b[i]; 37 | printf("%d", sum[i]); 38 | } 39 | return 0; 40 | } 41 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/runner/runner.exe.manifest: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | PerMonitorV2 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | -------------------------------------------------------------------------------- /C++ Template Library/Overloading Function Template: -------------------------------------------------------------------------------- 1 | //can template formation be overload? Yes then here is the code 2 | 3 | #include 4 | using namespace std; 5 | 6 | template 7 | class namit 8 | { 9 | public: 10 | T data; 11 | namit(T a) 12 | { 13 | data = a; 14 | } 15 | void display(); 16 | }; 17 | 18 | template // writing the class function outside using scope resolution operator 19 | void namit::display() 20 | { 21 | cout << data< // tempaltised function 30 | void func(T a) 31 | { 32 | cout<<"I am templatised func "< obj('c'); 38 | obj.display(); 39 | 40 | func(99); // exact match takes highest priority 41 | func(99); // if not found, then goes to template function 42 | return 0; 43 | } 44 | -------------------------------------------------------------------------------- /C++ Codes/shell_sort.cpp: -------------------------------------------------------------------------------- 1 | // C++ implementation of Shell Sort 2 | #include 3 | 4 | /* function to sort arr using shellSort */ 5 | void shellSort(int arr[], int n) 6 | { 7 | // Start with a big gap, then reduce the gap 8 | for (int gap = n / 2; gap > 0; gap /= 2) { 9 | 10 | for (int i = gap; i < n; i += 1) { 11 | 12 | int temp = arr[i]; 13 | int j; 14 | for (j = i; j >= gap && arr[j - gap] > temp; j -= gap) 15 | arr[j] = arr[j - gap]; 16 | arr[j] = temp; 17 | } 18 | } 19 | } 20 | 21 | void printArray(int arr[], int n) 22 | { 23 | for (int i = 0; i < n; i++) 24 | std::cout << arr[i] << " "; 25 | std::cout << "\n"; 26 | } 27 | 28 | int main() 29 | { 30 | int arr[] = { 12, 34, 54, 2, 3 }; 31 | int n = sizeof(arr) / sizeof(arr[0]); 32 | 33 | std::cout << "Array before sorting: \n"; 34 | printArray(arr, n); 35 | 36 | shellSort(arr, n); 37 | 38 | std::cout << "Array after sorting: \n"; 39 | printArray(arr, n); 40 | } 41 | -------------------------------------------------------------------------------- /Detecting cycle in undirected graph solution in c++: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | struct tree{ 5 | int val; 6 | tree * left; 7 | tree * right; 8 | }; 9 | 10 | tree * addNode(tree* root, int x){ 11 | if(root==NULL){ 12 | tree * a = new tree(); 13 | a->left = NULL; 14 | a->right = NULL; 15 | a->val = x; 16 | root = a; 17 | return root; 18 | } 19 | if(root->valright = addNode(root->right,x); 21 | } 22 | else{ 23 | root->left = addNode(root->left,x); 24 | } 25 | 26 | return root; 27 | } 28 | 29 | void inorder(tree * root){ 30 | if(root == NULL)return; 31 | 32 | inorder(root->left); 33 | cout<val<<" "; 34 | inorder(root->right); 35 | 36 | 37 | } 38 | 39 | int main(){ 40 | int n; 41 | cout<<"Size of tree : \n"; 42 | cin>>n; 43 | tree * root = NULL; 44 | for(int i=0; i>x; 47 | root = addNode(root,x); 48 | } 49 | cout<<"Printed Values : \n"; 50 | inorder(root); 51 | 52 | } 53 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_table-row.scss: -------------------------------------------------------------------------------- 1 | // Tables 2 | 3 | @mixin table-row-variant($state, $background, $border: null) { 4 | // Exact selectors below required to override `.table-striped` and prevent 5 | // inheritance to nested tables. 6 | .table-#{$state} { 7 | &, 8 | > th, 9 | > td { 10 | background-color: $background; 11 | } 12 | 13 | @if $border != null { 14 | th, 15 | td, 16 | thead th, 17 | tbody + tbody { 18 | border-color: $border; 19 | } 20 | } 21 | } 22 | 23 | // Hover states for `.table-hover` 24 | // Note: this is not available for cells or rows within `thead` or `tfoot`. 25 | .table-hover { 26 | $hover-background: darken($background, 5%); 27 | 28 | .table-#{$state} { 29 | @include hover { 30 | background-color: $hover-background; 31 | 32 | > td, 33 | > th { 34 | background-color: $hover-background; 35 | } 36 | } 37 | } 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /C-lang Codes/Sort character by frequency.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #define MAX 256 5 | int cmpfunc(const char a[], cost char b[]); 6 | void frequencysort(char s[]); 7 | struct freq{ 8 | int val; 9 | char c; 10 | 11 | }; 12 | int main(){ 13 | char s[30]; 14 | scanf("%s",&s); 15 | frequencysort(s); 16 | printf("%s",s); 17 | return 0; 18 | } 19 | int cmpfunc(const char a[], const char b[]){ 20 | int l=((struct freq*)a->)val; 21 | int r=((struct freq*)b->)val; 22 | return r-l; 23 | } 24 | void frequencysort(char s[]){ 25 | struct freq res[MAX]={0}; 26 | int len=strlen(s); 27 | for(int i=0;i 4 | using namespace std; 5 | 6 | // Prints frequencies of individual words in str 7 | void printFrequencies(const string &str) 8 | { 9 | // declaring map of type, each word 10 | // is mapped to its frequency 11 | unordered_map wordFreq; 12 | 13 | // breaking input into word using string stream 14 | stringstream ss(str); // Used for breaking words 15 | string word; // To store individual words 16 | while (ss >> word) 17 | wordFreq[word]++; 18 | 19 | // now iterating over word, freq pair and printing 20 | // them in <, > format 21 | unordered_map:: iterator p; 22 | for (p = wordFreq.begin(); p != wordFreq.end(); p++) 23 | cout << "(" << p->first << ", " << p->second << ")\n"; 24 | } 25 | 26 | // Driver code 27 | int main() 28 | { 29 | string str = "geeks for geeks geeks quiz " 30 | "practice qa for"; 31 | printFrequencies(str); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /assets/vendor/owl.carousel/assets/owl.theme.default.min.css: -------------------------------------------------------------------------------- 1 | /** 2 | * Owl Carousel v2.3.4 3 | * Copyright 2013-2018 David Deutsch 4 | * Licensed under: SEE LICENSE IN https://github.com/OwlCarousel2/OwlCarousel2/blob/master/LICENSE 5 | */ 6 | .owl-theme .owl-dots,.owl-theme .owl-nav{text-align:center;-webkit-tap-highlight-color:transparent}.owl-theme .owl-nav{margin-top:10px}.owl-theme .owl-nav [class*=owl-]{color:#FFF;font-size:14px;margin:5px;padding:4px 7px;background:#D6D6D6;display:inline-block;cursor:pointer;border-radius:3px}.owl-theme .owl-nav [class*=owl-]:hover{background:#869791;color:#FFF;text-decoration:none}.owl-theme .owl-nav .disabled{opacity:.5;cursor:default}.owl-theme .owl-nav.disabled+.owl-dots{margin-top:10px}.owl-theme .owl-dots .owl-dot{display:inline-block;zoom:1}.owl-theme .owl-dots .owl-dot span{width:10px;height:10px;margin:5px 7px;background:#D6D6D6;display:block;-webkit-backface-visibility:visible;transition:opacity .2s ease;border-radius:30px}.owl-theme .owl-dots .owl-dot.active span,.owl-theme .owl-dots .owl-dot:hover span{background:#869791} -------------------------------------------------------------------------------- /assets/vendor/owl.carousel/assets/owl.theme.green.min.css: -------------------------------------------------------------------------------- 1 | /** 2 | * Owl Carousel v2.3.4 3 | * Copyright 2013-2018 David Deutsch 4 | * Licensed under: SEE LICENSE IN https://github.com/OwlCarousel2/OwlCarousel2/blob/master/LICENSE 5 | */ 6 | .owl-theme .owl-dots,.owl-theme .owl-nav{text-align:center;-webkit-tap-highlight-color:transparent}.owl-theme .owl-nav{margin-top:10px}.owl-theme .owl-nav [class*=owl-]{color:#FFF;font-size:14px;margin:5px;padding:4px 7px;background:#D6D6D6;display:inline-block;cursor:pointer;border-radius:3px}.owl-theme .owl-nav [class*=owl-]:hover{background:#4DC7A0;color:#FFF;text-decoration:none}.owl-theme .owl-nav .disabled{opacity:.5;cursor:default}.owl-theme .owl-nav.disabled+.owl-dots{margin-top:10px}.owl-theme .owl-dots .owl-dot{display:inline-block;zoom:1}.owl-theme .owl-dots .owl-dot span{width:10px;height:10px;margin:5px 7px;background:#D6D6D6;display:block;-webkit-backface-visibility:visible;transition:opacity .2s ease;border-radius:30px}.owl-theme .owl-dots .owl-dot.active span,.owl-theme .owl-dots .owl-dot:hover span{background:#4DC7A0} -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/utilities/_embed.scss: -------------------------------------------------------------------------------- 1 | // Credit: Nicolas Gallagher and SUIT CSS. 2 | 3 | .embed-responsive { 4 | position: relative; 5 | display: block; 6 | width: 100%; 7 | padding: 0; 8 | overflow: hidden; 9 | 10 | &::before { 11 | display: block; 12 | content: ""; 13 | } 14 | 15 | .embed-responsive-item, 16 | iframe, 17 | embed, 18 | object, 19 | video { 20 | position: absolute; 21 | top: 0; 22 | bottom: 0; 23 | left: 0; 24 | width: 100%; 25 | height: 100%; 26 | border: 0; 27 | } 28 | } 29 | 30 | @each $embed-responsive-aspect-ratio in $embed-responsive-aspect-ratios { 31 | $embed-responsive-aspect-ratio-x: nth($embed-responsive-aspect-ratio, 1); 32 | $embed-responsive-aspect-ratio-y: nth($embed-responsive-aspect-ratio, 2); 33 | 34 | .embed-responsive-#{$embed-responsive-aspect-ratio-x}by#{$embed-responsive-aspect-ratio-y} { 35 | &::before { 36 | padding-top: percentage($embed-responsive-aspect-ratio-y / $embed-responsive-aspect-ratio-x); 37 | } 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /C++ Codes/BubbleSort.cpp: -------------------------------------------------------------------------------- 1 | // C++ program for implementation of Bubble sort 2 | #include 3 | using namespace std; 4 | 5 | void swap(int *xp, int *yp) 6 | { 7 | int temp = *xp; 8 | *xp = *yp; 9 | *yp = temp; 10 | } 11 | 12 | // A function to implement bubble sort 13 | void bubbleSort(int arr[], int n) 14 | { 15 | int i, j; 16 | for (i = 0; i < n-1; i++) 17 | 18 | // Last i elements are already in place 19 | for (j = 0; j < n-i-1; j++) 20 | if (arr[j] > arr[j+1]) 21 | swap(&arr[j], &arr[j+1]); 22 | } 23 | 24 | /* Function to print an array */ 25 | void printArray(int arr[], int size) 26 | { 27 | int i; 28 | for (i = 0; i < size; i++) 29 | cout << arr[i] << " "; 30 | cout << endl; 31 | } 32 | 33 | 34 | int main() 35 | { 36 | 37 | int n; 38 | cout<<"enter array size: "; 39 | cin>>n; 40 | int arr[n]; 41 | cout<<"enter array elements: "; 42 | for(int i=0; i>arr[i]; 43 | bubbleSort(arr, n); 44 | cout<<"Sorted array: \n"; 45 | printArray(arr, n); 46 | return 0; 47 | } 48 | 49 | // This code is contributed by rathbhupendra 50 | -------------------------------------------------------------------------------- /FloydWarshall.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); 5 | #define int long long 6 | #define endl "\n" 7 | 8 | const int INF = 1e18; 9 | const int MAXN = 1005; 10 | int dist[MAXN][MAXN]; 11 | 12 | int n, m; 13 | 14 | int32_t main() 15 | { 16 | cin>>n>>m; 17 | for(int i = 1; i<=m; i++) 18 | { 19 | int u, v, d; 20 | cin>>u>>v>>d; 21 | 22 | dist[u][v] = d; 23 | dist[v][u] = d; 24 | } 25 | 26 | for(int i = 1; i<=n; i++) 27 | { 28 | for(int j = 1; j<=n; j++) 29 | { 30 | if(i == j) dist[i][j] = 0; 31 | else if(dist[i][j] == 0) dist[i][j] = INF; 32 | } 33 | } 34 | 35 | for(int k = 1; k<=n; k++) 36 | { 37 | for(int i = 1; i<=n; i++) 38 | { 39 | for(int j = 1; j<=n; j++) 40 | { 41 | dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); 42 | } 43 | } 44 | } 45 | 46 | // dist matrix will give you all pair shortest path possible in graph 47 | } 48 | -------------------------------------------------------------------------------- /Add_Two_Number.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | string addition(string str1, string str2) 5 | { 6 | 7 | if (str1.length() > str2.length()) 8 | swap(str1, str2); 9 | 10 | string str = ""; 11 | 12 | int n1 = str1.length(), n2 = str2.length(); 13 | 14 | reverse(str1.begin(), str1.end()); 15 | reverse(str2.begin(), str2.end()); 16 | 17 | int carry = 0; 18 | for (int i=0; i> t; 43 | while (t--) 44 | { 45 | string str1,str2; 46 | cin >>str1>>str2; 47 | cout << addition(str1, str2)< 5 | 6 | int main() 7 | { 8 | int rem, carry; 9 | int a[50], b[50], sum[51]; 10 | 11 | printf("Enter first number : \n"); 12 | for (int i = 0; i < 3; i++) 13 | scanf("%d", &a[i]); 14 | 15 | printf("Enter second number : \n"); 16 | for (int i = 0; i < 3; i++) 17 | scanf("%d", &b[i]); 18 | 19 | for (int i = 0; i < 3; i++) 20 | { 21 | sum[i] = a[i] + b[i]; 22 | // printf("%d ", sum[i]); 23 | } 24 | 25 | for (int i = 2; i >= 0; i--) 26 | { 27 | // printf("%d ", sum[i]); 28 | if (sum[i] > 9) 29 | { 30 | rem = sum[i] % 10; 31 | carry = sum[i] / 10; 32 | sum[i - 1] = sum[i - 1] + carry; 33 | sum[i] = rem; 34 | } 35 | } 36 | 37 | for (int i = 0; i < 3; i++) 38 | { 39 | // sum[i] = a[i] + b[i]; 40 | printf("%d", sum[i]); 41 | } 42 | return 0; 43 | } -------------------------------------------------------------------------------- /C-lang Codes/matrixmul.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main(){ 4 | int a[10][10],b[10][10],mul[10][10],r,c,i,j,k; 5 | system("cls"); 6 | printf("enter the number of row="); 7 | scanf("%d",&r); 8 | printf("enter the number of column="); 9 | scanf("%d",&c); 10 | printf("enter the first matrix element=\n"); 11 | for(i=0;i 2 | 3 | 4 | 9 | 15 | 18 | 19 | -------------------------------------------------------------------------------- /Dijkstra_Algo.c: -------------------------------------------------------------------------------- 1 | #include 2 | #define infinity 999 3 | void dij(int n, int v,int cost[20][20], int dist[]) 4 | { 5 | int i,u,count,w,flag[20], min; 6 | 7 | for(i=1;i<=n;i++) 8 | { 9 | flag[i]=0, dist[i]=cost[v][i]; 10 | 11 | } 12 | count=2; 13 | while(count<=n) 14 | { 15 | min=99; 16 | 17 | for(w=1;w<=n;w++) 18 | 19 | if(dist[w]%d,cost=%d\n",v,i,dist[i]); 62 | } 63 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/android/app/src/main/res/values-night/styles.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 9 | 15 | 18 | 19 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/lib/main.dart: -------------------------------------------------------------------------------- 1 | import 'package:flutter/material.dart'; 2 | import 'package:showuser/views/userlist.dart'; 3 | 4 | void main() { 5 | runApp(MyApp()); 6 | } 7 | 8 | class MyApp extends StatelessWidget { 9 | // This widget is the root of your application. 10 | @override 11 | Widget build(BuildContext context) { 12 | return MaterialApp( 13 | title: 'Flutter Demo', 14 | theme: ThemeData( 15 | // This is the theme of your application. 16 | // 17 | // Try running your application with "flutter run". You'll see the 18 | // application has a blue toolbar. Then, without quitting the app, try 19 | // changing the primarySwatch below to Colors.green and then invoke 20 | // "hot reload" (press "r" in the console where you ran "flutter run", 21 | // or simply save your changes to "hot reload" in a Flutter IDE). 22 | // Notice that the counter didn't reset back to zero; the application 23 | // is not restarted. 24 | primarySwatch: Colors.blue, 25 | ), 26 | home: UserList(), 27 | ); 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /C++ program to convert decimal to hexadecimal: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | 6 | { 7 | 8 | long int dno, temp; 9 | 10 | char hex[100]; 11 | 12 | int j, remainder, i=1; 13 | 14 | cout<<"Enter Decimal Number : "; 15 | 16 | cin>>dno; 17 | 18 | temp = dno; 19 | 20 | while(temp!=0) 21 | 22 | { 23 | 24 | remainder = temp%16; 25 | 26 | if(remainder<10) // Converts integer into character 27 | 28 | { 29 | 30 | remainder = remainder + 48; 31 | 32 | } 33 | 34 | else 35 | 36 | { 37 | 38 | remainder = remainder + 55; 39 | 40 | } 41 | 42 | hex[i++] = remainder; 43 | 44 | temp = temp/16; 45 | 46 | } 47 | 48 | cout<<"\nHexadecimal Number corresponding to Decimal Number : "; 49 | 50 | for(j=i-1; j>0; j--) 51 | 52 | { 53 | 54 | cout< 2 | using namespace std; 3 | struct Interval 4 | { 5 | int s, e; 6 | }; 7 | bool mycomp(Interval a, Interval b) 8 | { return a.s > b.s; } 9 | 10 | void mergeIntervals(Interval arr[], int n) 11 | { 12 | sort(arr, arr+n, mycomp); 13 | int index = 0; 14 | for (int i = 0; i < n; i++) 15 | { 16 | if(index != 0 && arr[index-1].s <= arr[i].e) 17 | { 18 | while(index != 0 && arr[index-1].s <= arr[i].e) 19 | { 20 | arr[index-1].e = max(arr[index-1].e, arr[i].e); 21 | arr[index-1].s = min(arr[index-1].s, arr[i].s); 22 | index--; 23 | } 24 | } 25 | else arr[index] = arr[i]; 26 | index++; 27 | } 28 | cout<<"The Merged Intervals are: "; 29 | for(int i = 0; i < index; i++) 30 | cout<<"["<>n; 37 | Interval arr[n]; 38 | for(int i = 0; i < n; ++i) 39 | { 40 | cin>>arr[i].s>>arr[i].e; 41 | } 42 | mergeIntervals(arr, n); 43 | return 0; 44 | } 45 | -------------------------------------------------------------------------------- /C-lang Codes/QuickSort.c: -------------------------------------------------------------------------------- 1 | // Quick sort in C 2 | 3 | #include 4 | 5 | void swap(int *a, int *b) { 6 | int t = *a; 7 | *a = *b; 8 | *b = t; 9 | } 10 | 11 | int partition(int array[], int low, int high) { 12 | int pivot = array[high]; 13 | int i = (low - 1); 14 | for (int j = low; j < high; j++) { 15 | if (array[j] <= pivot) { 16 | i++; 17 | swap(&array[i], &array[j]); 18 | } 19 | } 20 | swap(&array[i + 1], &array[high]); 21 | return (i + 1); 22 | } 23 | 24 | void quickSort(int array[], int low, int high) { 25 | if (low < high) { 26 | int pi = partition(array, low, high); 27 | quickSort(array, low, pi - 1); 28 | quickSort(array, pi + 1, high); 29 | } 30 | } 31 | 32 | void printArray(int array[], int size) { 33 | for (int i = 0; i < size; ++i) { 34 | printf("%d ", array[i]); 35 | } 36 | printf("\n"); 37 | } 38 | 39 | int main() { 40 | int data[] = {8, 7, 2, 1, 0, 9, 6}; 41 | int n = sizeof(data) / sizeof(data[0]); 42 | quickSort(data, 0, n - 1); 43 | 44 | printf("Sorted array in ascending order: \n"); 45 | printArray(data, n); 46 | } -------------------------------------------------------------------------------- /C++ program to separate even and odd numbers from an array of integers. Put all even numbers first, and then odd numbers.: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void swap(int * x, int * y){ 5 | int t = * x; 6 | * x = * y; 7 | * y = t; 8 | } 9 | 10 | void segregate(int array[], int n){ 11 | int left = 0, right = n - 1; 12 | while (left < right){ 13 | while (array[left] % 2 == 0 && left < right) 14 | left++; 15 | while (array[right] % 2 == 1 && left < right) 16 | right--; 17 | if (left < right){ 18 | swap( & array[left], & array[right]); 19 | left++; 20 | right--; 21 | } 22 | } 23 | } 24 | 25 | int main(){ 26 | 27 | int array[100], n, i; 28 | cout << "Enter number of elements: "; 29 | cin >> n; 30 | cout << "\nEnter elements: "; 31 | 32 | for (i = 0; i < n; i++) 33 | cin >> array[i]; 34 | 35 | cout << "Original array: "; 36 | for (int i = 0; i < n; i++) 37 | cout << array[i] << " "; 38 | 39 | segregate(array, n); 40 | cout << "\nArray after divided: "; 41 | 42 | for (int i = 0; i < n; i++) 43 | cout << array[i] << " "; 44 | 45 | return 0; 46 | 47 | } 48 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_close.scss: -------------------------------------------------------------------------------- 1 | .close { 2 | float: right; 3 | @include font-size($close-font-size); 4 | font-weight: $close-font-weight; 5 | line-height: 1; 6 | color: $close-color; 7 | text-shadow: $close-text-shadow; 8 | opacity: .5; 9 | 10 | // Override 's hover style 11 | @include hover { 12 | color: $close-color; 13 | text-decoration: none; 14 | } 15 | 16 | &:not(:disabled):not(.disabled) { 17 | @include hover-focus { 18 | opacity: .75; 19 | } 20 | } 21 | } 22 | 23 | // Additional properties for button version 24 | // iOS requires the button element instead of an anchor tag. 25 | // If you want the anchor version, it requires `href="#"`. 26 | // See https://developer.mozilla.org/en-US/docs/Web/Events/click#Safari_Mobile 27 | 28 | // stylelint-disable-next-line selector-no-qualifying-type 29 | button.close { 30 | padding: 0; 31 | background-color: transparent; 32 | border: 0; 33 | appearance: none; 34 | } 35 | 36 | // Future-proof disabling of clicks on `` elements 37 | 38 | // stylelint-disable-next-line selector-no-qualifying-type 39 | a.close.disabled { 40 | pointer-events: none; 41 | } 42 | -------------------------------------------------------------------------------- /C++ Codes/n-queens.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | bool issafe(int board[][10],int i,int j,int n){ 4 | for(int row=0;row=0 && y>=0){ 13 | if(board[x][y]==1){ 14 | return false; 15 | } 16 | x--; 17 | y--; 18 | } 19 | 20 | x=i; 21 | y=j; 22 | 23 | while(x>=0 && y>n; 63 | int board[10][10]; 64 | nqueen(board,0,n); 65 | } 66 | -------------------------------------------------------------------------------- /C++ Codes/Roots of a Quadratic Equation.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | 7 | float a, b, c, x1, x2, discriminant, realPart, imaginaryPart; 8 | cout << "Enter coefficients a, b and c: "; 9 | cin >> a >> b >> c; 10 | discriminant = b*b - 4*a*c; 11 | 12 | if (discriminant > 0) { 13 | x1 = (-b + sqrt(discriminant)) / (2*a); 14 | x2 = (-b - sqrt(discriminant)) / (2*a); 15 | cout << "Roots are real and different." << endl; 16 | cout << "x1 = " << x1 << endl; 17 | cout << "x2 = " << x2 << endl; 18 | } 19 | 20 | else if (discriminant == 0) { 21 | cout << "Roots are real and same." << endl; 22 | x1 = -b/(2*a); 23 | cout << "x1 = x2 =" << x1 << endl; 24 | } 25 | 26 | else { 27 | realPart = -b/(2*a); 28 | imaginaryPart =sqrt(-discriminant)/(2*a); 29 | cout << "Roots are complex and different." << endl; 30 | cout << "x1 = " << realPart << "+" << imaginaryPart << "i" << endl; 31 | cout << "x2 = " << realPart << "-" << imaginaryPart << "i" << endl; 32 | } 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /C++ Codes/rotate_image.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void rotateimage(int a[][100], int n) 5 | { 6 | for (int i = 0; i < n; i++) 7 | { 8 | reverse(a[i], a[i] + n); 9 | } 10 | for (int i = 0; i < n; i++) 11 | { 12 | for (int j = 0; j < n; j++) 13 | { 14 | if (i < j)//i> n; 26 | int a[100][100]; 27 | int val = 1; 28 | 29 | for (int i = 0; i < n; i++) 30 | { 31 | for (int j = 0; j < n; j++) 32 | { 33 | a[i][j] = val; 34 | val = val + 1; 35 | cout << a[i][j] << " "; 36 | } 37 | 38 | cout << endl; 39 | } 40 | rotateimage(a,n); 41 | 42 | for (int i = 0; i < n; i++) 43 | { 44 | for (int j = 0; j < n; j++) 45 | { 46 | 47 | cout << a[i][j] << " "; 48 | } 49 | 50 | cout << endl; 51 | } 52 | 53 | return 0; 54 | } 55 | -------------------------------------------------------------------------------- /C++ Template Library/list template: -------------------------------------------------------------------------------- 1 | // list is a bidirectional linear list which is highly efficient in operations like insertion and deletion 2 | // basicaly it is a special form of Linked list 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | void display(list &lst) 8 | { 9 | list :: iterator it; 10 | for (it = lst.begin(); it != lst.end(); it++) 11 | { 12 | cout<<*it<<" "; 13 | } 14 | 15 | } 16 | int main() 17 | { 18 | list list1; // list of size 0 length 19 | 20 | list1.push_back(5); 21 | list1.push_back(7); 22 | list1.push_back(9); 23 | list1.push_back(12); 24 | list1.pop_back(); 25 | list1.pop_front(); 26 | list1.remove(9); 27 | list1.sort(); 28 | display(list1); 29 | 30 | list list2(4); // empty list of size 7 length 31 | list :: iterator iter; 32 | iter = list2.begin(); 33 | *iter = 45; 34 | iter++; 35 | *iter = 6; 36 | iter++; 37 | *iter = 9; 38 | iter++; 39 | *iter = 14; 40 | iter++; 41 | display(list2); 42 | list1.merge(list2); 43 | list1.reverse(); 44 | display(list1); 45 | return 0; 46 | } 47 | -------------------------------------------------------------------------------- /C++ Program to Find All Roots of a Quadratic Equation: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | 7 | float a, b, c, x1, x2, discriminant, realPart, imaginaryPart; 8 | cout << "Enter coefficients a, b and c: "; 9 | cin >> a >> b >> c; 10 | discriminant = b*b - 4*a*c; 11 | 12 | if (discriminant > 0) { 13 | x1 = (-b + sqrt(discriminant)) / (2*a); 14 | x2 = (-b - sqrt(discriminant)) / (2*a); 15 | cout << "Roots are real and different." << endl; 16 | cout << "x1 = " << x1 << endl; 17 | cout << "x2 = " << x2 << endl; 18 | } 19 | 20 | else if (discriminant == 0) { 21 | cout << "Roots are real and same." << endl; 22 | x1 = -b/(2*a); 23 | cout << "x1 = x2 =" << x1 << endl; 24 | } 25 | 26 | else { 27 | realPart = -b/(2*a); 28 | imaginaryPart =sqrt(-discriminant)/(2*a); 29 | cout << "Roots are complex and different." << endl; 30 | cout << "x1 = " << realPart << "+" << imaginaryPart << "i" << endl; 31 | cout << "x2 = " << realPart << "-" << imaginaryPart << "i" << endl; 32 | } 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /Java Codes/print the even number in an array using lambda expression.: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.util.function.Predicate; 3 | 4 | class GfG 5 | { 6 | // Take a Collection and a Predicate 7 | // Predicate helps in unit-testing 8 | // Collection can accept LinkedList, 9 | // ArrayList, Queue etc 10 | static void printCond( 11 | Collection c, 12 | Predicate p) 13 | { 14 | // Traverse the Collection 15 | // Print only those elements which 16 | // pass the test 17 | for (Integer x: c) 18 | if(p.test(x)) 19 | System.out.print(x + " "); 20 | } 21 | public static void main(String args[]) 22 | { 23 | // ArrayList to check the function 24 | List al 25 | = new ArrayList<>( 26 | Arrays.asList( 27 | 10, 5, 20, 7, 30)); 28 | 29 | // Passes the collection and a 30 | // lambda expression which is a functional 31 | // interface 32 | // This lambda expression maps the test 33 | // function of abstract method 34 | printCond(al, x -> x%2 == 0); 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /C-lang Codes/Factorialoflargenumber.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | printf("Enter the value for calculating factorial="); 6 | scanf("%d", &n); 7 | int j = 2; // last multiple of factorial of any number goes upto 2 8 | int a[1000] = {0};// array of 1000 spaces initialized with 0 9 | a[0] = 1; 10 | int len = 1;// length starts with one 11 | int c = 0, num = 0; 12 | while(j <= n) // till j is less than value for which factorial is required 13 | { 14 | c = 0; 15 | num = 0; 16 | while(c < len) 17 | { 18 | a[c] = a[c] * j; 19 | a[c] = a[c] + num; 20 | num = a[c] / 10; 21 | a[c] = a[c] % 10; 22 | c++; 23 | } 24 | while(num != 0) 25 | { 26 | a[len] = num % 10; 27 | num = num / 10; 28 | len++; 29 | } 30 | j++; 31 | } 32 | len--; 33 | printf("\n\nFactorial of %d is below = ", n); 34 | while(len >= 0) 35 | { 36 | printf("%d", a[len]); 37 | len--; 38 | } 39 | return 0; 40 | } 41 | -------------------------------------------------------------------------------- /assets/vendor/owl.carousel/LICENSE: -------------------------------------------------------------------------------- 1 | Copyright (c) 2014 Owl 2 | Modified work Copyright 2016-2018 David Deutsch 3 | 4 | Permission is hereby granted, free of charge, to any person 5 | obtaining a copy of this software and associated documentation 6 | files (the "Software"), to deal in the Software without 7 | restriction, including without limitation the rights to use, 8 | copy, modify, merge, publish, distribute, sublicense, and/or sell 9 | copies of the Software, and to permit persons to whom the 10 | Software is furnished to do so, subject to the following 11 | conditions: 12 | 13 | The above copyright notice and this permission notice shall be 14 | included in all copies or substantial portions of the Software. 15 | 16 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 17 | EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES 18 | OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 19 | NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT 20 | HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, 21 | WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 22 | FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR 23 | OTHER DEALINGS IN THE SOFTWARE. 24 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/test/widget_test.dart: -------------------------------------------------------------------------------- 1 | // This is a basic Flutter widget test. 2 | // 3 | // To perform an interaction with a widget in your test, use the WidgetTester 4 | // utility that Flutter provides. For example, you can send tap and scroll 5 | // gestures. You can also use WidgetTester to find child widgets in the widget 6 | // tree, read text, and verify that the values of widget properties are correct. 7 | 8 | import 'package:flutter/material.dart'; 9 | import 'package:flutter_test/flutter_test.dart'; 10 | 11 | import 'package:showuser/main.dart'; 12 | 13 | void main() { 14 | testWidgets('Counter increments smoke test', (WidgetTester tester) async { 15 | // Build our app and trigger a frame. 16 | await tester.pumpWidget(MyApp()); 17 | 18 | // Verify that our counter starts at 0. 19 | expect(find.text('0'), findsOneWidget); 20 | expect(find.text('1'), findsNothing); 21 | 22 | // Tap the '+' icon and trigger a frame. 23 | await tester.tap(find.byIcon(Icons.add)); 24 | await tester.pump(); 25 | 26 | // Verify that our counter has incremented. 27 | expect(find.text('0'), findsNothing); 28 | expect(find.text('1'), findsOneWidget); 29 | }); 30 | } 31 | -------------------------------------------------------------------------------- /Java Codes/Duplicate character conversation.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | String str = sc.nextLine(); 8 | 9 | if (str.matches("[a-zA-Z ]+")) { 10 | 11 | String output = ""; 12 | 13 | String[] word = str.split(" "); 14 | 15 | for (int i = 0; i < word.length; i++) { 16 | for (int j = 0; j < word[i].length(); j++) { 17 | 18 | int count = 0; 19 | char c = word[i].charAt(j); 20 | 21 | for (int k = 0; k < word[i].length(); k++) { 22 | if (c == word[i].charAt(k)) 23 | count++; 24 | } 25 | 26 | if (count == 1) 27 | output += c; 28 | else 29 | output += Character.toUpperCase(c); 30 | } 31 | output += " "; 32 | } 33 | System.out.println(output); 34 | } else 35 | System.out.println(str + " is an invalid sentence"); 36 | 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_toasts.scss: -------------------------------------------------------------------------------- 1 | .toast { 2 | max-width: $toast-max-width; 3 | overflow: hidden; // cheap rounded corners on nested items 4 | @include font-size($toast-font-size); 5 | color: $toast-color; 6 | background-color: $toast-background-color; 7 | background-clip: padding-box; 8 | border: $toast-border-width solid $toast-border-color; 9 | box-shadow: $toast-box-shadow; 10 | backdrop-filter: blur(10px); 11 | opacity: 0; 12 | @include border-radius($toast-border-radius); 13 | 14 | &:not(:last-child) { 15 | margin-bottom: $toast-padding-x; 16 | } 17 | 18 | &.showing { 19 | opacity: 1; 20 | } 21 | 22 | &.show { 23 | display: block; 24 | opacity: 1; 25 | } 26 | 27 | &.hide { 28 | display: none; 29 | } 30 | } 31 | 32 | .toast-header { 33 | display: flex; 34 | align-items: center; 35 | padding: $toast-padding-y $toast-padding-x; 36 | color: $toast-header-color; 37 | background-color: $toast-header-background-color; 38 | background-clip: padding-box; 39 | border-bottom: $toast-border-width solid $toast-header-border-color; 40 | } 41 | 42 | .toast-body { 43 | padding: $toast-padding-x; // apply to both vertical and horizontal 44 | } 45 | -------------------------------------------------------------------------------- /C++ Codes/Bitonic_String_Maximum_Length.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int bitonicstringmaxlength(int a[], int n) 5 | { 6 | int inc[n]; 7 | int dec[n]; 8 | inc[0] = 1; 9 | dec[n - 1] = 1; 10 | for (int i = 1; i < n; i++) 11 | { 12 | if (a[i - 1] <= a[i]) 13 | { 14 | inc[i]=inc[i-1]+1; 15 | } 16 | else if (a[i - 1] > a[i]) 17 | { 18 | inc[i] = 1; 19 | } 20 | } 21 | for (int i = n - 2; i >= 0; i--) 22 | { 23 | if (a[i] >= a[i+1]) 24 | { 25 | dec[i]=dec[i+1]+1; 26 | } 27 | else if (a[i] < a[i+1]) 28 | { 29 | dec[i] = 1; 30 | } 31 | } 32 | 33 | int max = inc[0] + dec[0] - 1; 34 | for (int i = 0; i < n; i++) 35 | { 36 | if (inc[i] + dec[i] - 1 > max) 37 | { 38 | max = inc[i] + dec[i] - 1; 39 | } 40 | } 41 | return max; 42 | } 43 | int main() 44 | { 45 | int a[1000], n; 46 | int sum = 0; 47 | cin >> n; 48 | for (int i = 0; i < n; i++) 49 | { 50 | cin >> a[i]; 51 | } 52 | 53 | cout< 5 | 6 | #include 7 | #include 8 | 9 | // A runloop that will service events for Flutter instances as well 10 | // as native messages. 11 | class RunLoop { 12 | public: 13 | RunLoop(); 14 | ~RunLoop(); 15 | 16 | // Prevent copying 17 | RunLoop(RunLoop const&) = delete; 18 | RunLoop& operator=(RunLoop const&) = delete; 19 | 20 | // Runs the run loop until the application quits. 21 | void Run(); 22 | 23 | // Registers the given Flutter instance for event servicing. 24 | void RegisterFlutterInstance( 25 | flutter::FlutterEngine* flutter_instance); 26 | 27 | // Unregisters the given Flutter instance from event servicing. 28 | void UnregisterFlutterInstance( 29 | flutter::FlutterEngine* flutter_instance); 30 | 31 | private: 32 | using TimePoint = std::chrono::steady_clock::time_point; 33 | 34 | // Processes all currently pending messages for registered Flutter instances. 35 | TimePoint ProcessFlutterMessages(); 36 | 37 | std::set flutter_instances_; 38 | }; 39 | 40 | #endif // RUNNER_RUN_LOOP_H_ 41 | -------------------------------------------------------------------------------- /Program to find two’s complement of a binary number in C++: -------------------------------------------------------------------------------- 1 | //Program to find two's complement of a binary number 2 | #include 3 | 4 | #define size 6 5 | using namespace std; 6 | 7 | int main() { 8 | char binary[size + 1], one[size + 1], two[size + 1]; 9 | int i, carry = 1, fail = 0; 10 | cout << " Input a " << size << " bit binary number: "; 11 | cin >> binary; 12 | for (i = 0; i < size; i++) { 13 | if (binary[i] == '1') { 14 | one[i] = '0'; 15 | } else if (binary[i] == '0') { 16 | one[i] = '1'; 17 | } else { 18 | cout << "Error! Input the number of assigned bits." << endl; 19 | fail = 1; 20 | break; 21 | } 22 | } 23 | one[size] = '\0'; 24 | 25 | for (i = size - 1; i >= 0; i--) { 26 | if (one[i] == '1' && carry == 1) { 27 | two[i] = '0'; 28 | } else if (one[i] == '0' && carry == 1) { 29 | two[i] = '1'; 30 | carry = 0; 31 | } else { 32 | two[i] = one[i]; 33 | } 34 | } 35 | two[size] = '\0'; 36 | if (fail == 0) { 37 | cout << " The original binary = " << binary << endl; 38 | cout << " After ones complement the value = " << one << endl; 39 | cout << " After twos complement the value = " << two << endl; 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_code.scss: -------------------------------------------------------------------------------- 1 | // Inline code 2 | code { 3 | @include font-size($code-font-size); 4 | color: $code-color; 5 | word-break: break-word; 6 | 7 | // Streamline the style when inside anchors to avoid broken underline and more 8 | a > & { 9 | color: inherit; 10 | } 11 | } 12 | 13 | // User input typically entered via keyboard 14 | kbd { 15 | padding: $kbd-padding-y $kbd-padding-x; 16 | @include font-size($kbd-font-size); 17 | color: $kbd-color; 18 | background-color: $kbd-bg; 19 | @include border-radius($border-radius-sm); 20 | @include box-shadow($kbd-box-shadow); 21 | 22 | kbd { 23 | padding: 0; 24 | @include font-size(100%); 25 | font-weight: $nested-kbd-font-weight; 26 | @include box-shadow(none); 27 | } 28 | } 29 | 30 | // Blocks of code 31 | pre { 32 | display: block; 33 | @include font-size($code-font-size); 34 | color: $pre-color; 35 | 36 | // Account for some code outputs that place code tags in pre tags 37 | code { 38 | @include font-size(inherit); 39 | color: inherit; 40 | word-break: normal; 41 | } 42 | } 43 | 44 | // Enable scrollable blocks of code 45 | .pre-scrollable { 46 | max-height: $pre-scrollable-max-height; 47 | overflow-y: scroll; 48 | } 49 | -------------------------------------------------------------------------------- /Python Codes/shell_sort.py: -------------------------------------------------------------------------------- 1 | # Python program for implementation of Shell Sort 2 | 3 | def shellSort(arr): 4 | 5 | # Start with a big gap, then reduce the gap 6 | n = len(arr) 7 | gap = n/2 8 | 9 | # Do a gapped insertion sort for this gap size. 10 | # The first gap elements a[0..gap-1] are already in gapped 11 | # order keep adding one more element until the entire array 12 | # is gap sorted 13 | while gap > 0: 14 | 15 | for i in range(gap,n): 16 | 17 | # add a[i] to the elements that have been gap sorted 18 | # save a[i] in temp and make a hole at position i 19 | temp = arr[i] 20 | 21 | # shift earlier gap-sorted elements up until the correct 22 | # location for a[i] is found 23 | j = i 24 | while j >= gap and arr[j-gap] >temp: 25 | arr[j] = arr[j-gap] 26 | j -= gap 27 | 28 | # put temp (the original a[i]) in its correct location 29 | arr[j] = temp 30 | gap /= 2 31 | 32 | 33 | # Driver code to test above 34 | arr = [ 212, 334, 154, 42, 13] 35 | 36 | n = len(arr) 37 | print ("Array before sorting:") 38 | for i in range(n): 39 | print(arr[i]), 40 | 41 | shellSort(arr) 42 | 43 | print ("\nArray after sorting:") 44 | for i in range(n): 45 | print(arr[i]), 46 | 47 | # This code is contributed by Nikhar Kesari 48 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_grid.scss: -------------------------------------------------------------------------------- 1 | // Container widths 2 | // 3 | // Set the container width, and override it for fixed navbars in media queries. 4 | 5 | @if $enable-grid-classes { 6 | .container { 7 | @include make-container(); 8 | @include make-container-max-widths(); 9 | } 10 | } 11 | 12 | // Fluid container 13 | // 14 | // Utilizes the mixin meant for fixed width containers, but with 100% width for 15 | // fluid, full width layouts. 16 | 17 | @if $enable-grid-classes { 18 | .container-fluid { 19 | @include make-container(); 20 | } 21 | } 22 | 23 | // Row 24 | // 25 | // Rows contain and clear the floats of your columns. 26 | 27 | @if $enable-grid-classes { 28 | .row { 29 | @include make-row(); 30 | } 31 | 32 | // Remove the negative margin from default .row, then the horizontal padding 33 | // from all immediate children columns (to prevent runaway style inheritance). 34 | .no-gutters { 35 | margin-right: 0; 36 | margin-left: 0; 37 | 38 | > .col, 39 | > [class*="col-"] { 40 | padding-right: 0; 41 | padding-left: 0; 42 | } 43 | } 44 | } 45 | 46 | // Columns 47 | // 48 | // Common styles for small and large grid columns 49 | 50 | @if $enable-grid-classes { 51 | @include make-grid-columns(); 52 | } 53 | -------------------------------------------------------------------------------- /Video Call/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | Video Call 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 |
20 |

👉 Video Call 👈

21 |
22 | 23 |
24 | 25 |
26 | 27 | 28 |
29 | 30 |
31 |
32 |

For Joining Video Call

33 |
34 |
35 | Click Here 36 | 37 |
38 | 39 | 40 |
41 |

42 | For More Information Email - kaushalagr.02@gmail.com 43 |

44 |
45 |

Made with lots of Love by Kaushal Agrawal

46 | 47 |
48 |
49 | 50 | 51 | 52 | 53 | 54 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_progress.scss: -------------------------------------------------------------------------------- 1 | // Disable animation if transitions are disabled 2 | @if $enable-transitions { 3 | @keyframes progress-bar-stripes { 4 | from { background-position: $progress-height 0; } 5 | to { background-position: 0 0; } 6 | } 7 | } 8 | 9 | .progress { 10 | display: flex; 11 | height: $progress-height; 12 | overflow: hidden; // force rounded corners by cropping it 13 | @include font-size($progress-font-size); 14 | background-color: $progress-bg; 15 | @include border-radius($progress-border-radius); 16 | @include box-shadow($progress-box-shadow); 17 | } 18 | 19 | .progress-bar { 20 | display: flex; 21 | flex-direction: column; 22 | justify-content: center; 23 | color: $progress-bar-color; 24 | text-align: center; 25 | white-space: nowrap; 26 | background-color: $progress-bar-bg; 27 | @include transition($progress-bar-transition); 28 | } 29 | 30 | .progress-bar-striped { 31 | @include gradient-striped(); 32 | background-size: $progress-height $progress-height; 33 | } 34 | 35 | @if $enable-transitions { 36 | .progress-bar-animated { 37 | animation: progress-bar-stripes $progress-bar-animation-timing; 38 | 39 | @media (prefers-reduced-motion: reduce) { 40 | animation: none; 41 | } 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /C++ Codes/Flattening of a LinkedList.cpp: -------------------------------------------------------------------------------- 1 | /* Node structure used in the program 2 | 3 | struct Node{ 4 | int data; 5 | struct Node * next; 6 | struct Node * bottom; 7 | 8 | Node(int x){ 9 | data = x; 10 | next = NULL; 11 | bottom = NULL; 12 | } 13 | 14 | }; 15 | */ 16 | Node* merge(Node* a,Node* b){ 17 | Node *temp=new Node(0); 18 | Node* res=temp; 19 | 20 | while(a!=NULL && b!=NULL){ 21 | if(a->data < b->data){ 22 | temp->bottom =a; 23 | temp=temp->bottom; 24 | a=a->bottom; 25 | } 26 | else{ 27 | temp->bottom=b; 28 | temp=temp->bottom; 29 | b=b->bottom; 30 | } 31 | } 32 | 33 | if(a)temp->bottom=a; 34 | else temp->bottom=b; 35 | 36 | return res->bottom; 37 | } 38 | 39 | /* Function which returns the root of 40 | the flattened linked list. */ 41 | Node *flatten(Node *root) 42 | { 43 | // Your code here 44 | if(root==NULL || root->next ==NULL) 45 | return root; 46 | 47 | //go to the last LL 48 | root->next= flatten(root->next); 49 | 50 | //merge 51 | root=merge(root,root->next); 52 | 53 | //merged/flattend LL 54 | return root; 55 | } -------------------------------------------------------------------------------- /Create lexicographic strings: -------------------------------------------------------------------------------- 1 | // Java program to Compare two strings lexicographically 2 | class Compare { 3 | public static int stringCompare(String str1, 4 | String str2) 5 | { 6 | for (int i = 0; i < str1.length() && 7 | i < str2.length(); i++) { 8 | if ((int)str1.charAt(i) == 9 | (int)str2.charAt(i)) { 10 | continue; 11 | } 12 | else { 13 | return (int)str1.charAt(i) - 14 | (int)str2.charAt(i); 15 | } 16 | } 17 | if (str1.length() < str2.length()) { 18 | return (str1.length()-str2.length()); 19 | } 20 | else if (str1.length() > str2.length()) { 21 | return (str1.length()-str2.length()); 22 | } 23 | 24 | else { 25 | return 0; 26 | } 27 | } 28 | 29 | // Driver function 30 | public static void main(String args[]) 31 | { 32 | String string1 = new String("Heyyy"); 33 | String string2 = new String("Coders"); 34 | String string3 = new String("practice coding"); 35 | String string4 = new String("coding"); 36 | 37 | System.out.println(stringCompare(string1, string2)); 38 | System.out.println(stringCompare(string1, string3)); 39 | System.out.println(stringCompare(string2, string1)); 40 | System.out.println(stringCompare(string1, string4)); 41 | System.out.println(stringCompare(string4, string1)); 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /C++ Codes/quicksort.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | void swap(int* a, int* b) 5 | { 6 | int t = *a; 7 | *a = *b; 8 | *b = t; 9 | } 10 | 11 | int partition (int arr[], int low, int high) 12 | { 13 | int pivot = arr[high]; 14 | int i = (low - 1); 15 | for (int j = low; j <= high- 1; j++) 16 | { 17 | 18 | if (arr[j] <= pivot) 19 | { 20 | i++; 21 | swap(&arr[i], &arr[j]); 22 | } 23 | } 24 | swap(&arr[i + 1], &arr[high]); 25 | return (i + 1); 26 | } 27 | 28 | 29 | void quickSort(int arr[], int low, int high) 30 | { 31 | if (low < high) 32 | { 33 | 34 | int pi = partition(arr, low, high); 35 | 36 | quickSort(arr, low, pi - 1); 37 | quickSort(arr, pi + 1, high); 38 | } 39 | } 40 | 41 | 42 | void printArray(int arr[], int size) 43 | { 44 | int i; 45 | for (i=0; i < size; i++) 46 | printf("%d ", arr[i]); 47 | printf("\n"); 48 | } 49 | 50 | 51 | int main() 52 | { 53 | int arr[] = {10, 7, 8, 9, 1, 5}; 54 | int n = sizeof(arr)/sizeof(arr[0]); 55 | quickSort(arr, 0, n-1); 56 | printf("Sorted array: \n"); 57 | printArray(arr, n); 58 | return 0; 59 | } 60 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_mixins.scss: -------------------------------------------------------------------------------- 1 | // Toggles 2 | // 3 | // Used in conjunction with global variables to enable certain theme features. 4 | 5 | // Vendor 6 | @import "vendor/rfs"; 7 | 8 | // Deprecate 9 | @import "mixins/deprecate"; 10 | 11 | // Utilities 12 | @import "mixins/breakpoints"; 13 | @import "mixins/hover"; 14 | @import "mixins/image"; 15 | @import "mixins/badge"; 16 | @import "mixins/resize"; 17 | @import "mixins/screen-reader"; 18 | @import "mixins/size"; 19 | @import "mixins/reset-text"; 20 | @import "mixins/text-emphasis"; 21 | @import "mixins/text-hide"; 22 | @import "mixins/text-truncate"; 23 | @import "mixins/visibility"; 24 | 25 | // // Components 26 | @import "mixins/alert"; 27 | @import "mixins/buttons"; 28 | @import "mixins/caret"; 29 | @import "mixins/pagination"; 30 | @import "mixins/lists"; 31 | @import "mixins/list-group"; 32 | @import "mixins/nav-divider"; 33 | @import "mixins/forms"; 34 | @import "mixins/table-row"; 35 | 36 | // // Skins 37 | @import "mixins/background-variant"; 38 | @import "mixins/border-radius"; 39 | @import "mixins/box-shadow"; 40 | @import "mixins/gradients"; 41 | @import "mixins/transition"; 42 | 43 | // // Layout 44 | @import "mixins/clearfix"; 45 | @import "mixins/grid-framework"; 46 | @import "mixins/grid"; 47 | @import "mixins/float"; 48 | -------------------------------------------------------------------------------- /C-lang Codes/Fractional_Knapsack.c: -------------------------------------------------------------------------------- 1 | //Write a program to implement the Fractional Knapsack algorithm. 2 | 3 | #include 4 | 5 | int n = 5; 6 | int c[6] = {12, 1, 2, 1, 4}; 7 | int v[6] = {4, 2, 2, 1, 10}; 8 | int W = 15; 9 | void simple_fill() { 10 | int cur_w; 11 | float tot_v; 12 | int i, maxi; 13 | int used[10]; 14 | for (i = 0; i < n; ++i) 15 | used[i] = 0; 16 | cur_w = W; 17 | while (cur_w > 0) { 18 | maxi = -1; 19 | for (i = 0; i < n; ++i) 20 | if ((used[i] == 0) && ((maxi == -1) || ((float)v[i]/c[i] > (float)v[maxi]/c[maxi]))) 21 | maxi = i; 22 | used[maxi] = 1; 23 | cur_w -= c[maxi]; 24 | tot_v += v[maxi]; 25 | if (cur_w >= 0) 26 | printf("Added object %d (%d$, %dKg) completely in the bag. Space left: %d.\n", maxi + 1, v[maxi], c[maxi], cur_w); 27 | else { 28 | printf("Added %d%% (%d$, %dKg) of object %d in the bag.\n", (int)((1 + (float)cur_w/c[maxi]) * 100), v[maxi], c[maxi], maxi + 1); 29 | tot_v -= v[maxi]; 30 | tot_v += (1 + (float)cur_w/c[maxi]) * v[maxi]; 31 | } 32 | } 33 | printf("Filled the bag with objects worth %.2f$.\n", tot_v); 34 | } 35 | int main() 36 | { simple_fill(); 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/runner/flutter_window.h: -------------------------------------------------------------------------------- 1 | #ifndef RUNNER_FLUTTER_WINDOW_H_ 2 | #define RUNNER_FLUTTER_WINDOW_H_ 3 | 4 | #include 5 | #include 6 | 7 | #include 8 | 9 | #include "run_loop.h" 10 | #include "win32_window.h" 11 | 12 | // A window that does nothing but host a Flutter view. 13 | class FlutterWindow : public Win32Window { 14 | public: 15 | // Creates a new FlutterWindow driven by the |run_loop|, hosting a 16 | // Flutter view running |project|. 17 | explicit FlutterWindow(RunLoop* run_loop, 18 | const flutter::DartProject& project); 19 | virtual ~FlutterWindow(); 20 | 21 | protected: 22 | // Win32Window: 23 | bool OnCreate() override; 24 | void OnDestroy() override; 25 | LRESULT MessageHandler(HWND window, UINT const message, WPARAM const wparam, 26 | LPARAM const lparam) noexcept override; 27 | 28 | private: 29 | // The run loop driving events for this window. 30 | RunLoop* run_loop_; 31 | 32 | // The project to run. 33 | flutter::DartProject project_; 34 | 35 | // The Flutter instance hosted by this window. 36 | std::unique_ptr flutter_controller_; 37 | }; 38 | 39 | #endif // RUNNER_FLUTTER_WINDOW_H_ 40 | -------------------------------------------------------------------------------- /C++ Codes/11InfixToPostfix.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | #define debug(x){cout<<"x : "< st; 26 | for (int i = 0; i < n; i++) { 27 | if (isOperend(s[i])) { 28 | st.push(s[i]); 29 | ans += st.top(); 30 | 31 | } 32 | else { 33 | if (st.empty())st.push(s[i]); 34 | else if (!isOperend(s[i])) { 35 | 36 | if (pre(s[i]) < pre(st.top())) { 37 | ans += st.top(); 38 | st.pop(); 39 | } 40 | else { 41 | st.push(s[i]); 42 | } 43 | } 44 | } 45 | } 46 | cout << ans; 47 | return ans; 48 | } 49 | 50 | }; 51 | 52 | 53 | int main() { 54 | #ifndef ONLINE_JUDGE 55 | //for getting input from input.txt 56 | freopen("input.txt", "r", stdin); 57 | freopen("output.txt", "w", stdout); 58 | #endif 59 | 60 | string s = "a+b*c-d/e"; 61 | 62 | Solution obj; 63 | obj.convert(s); 64 | 65 | } 66 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_spinners.scss: -------------------------------------------------------------------------------- 1 | // 2 | // Rotating border 3 | // 4 | 5 | @keyframes spinner-border { 6 | to { transform: rotate(360deg); } 7 | } 8 | 9 | .spinner-border { 10 | display: inline-block; 11 | width: $spinner-width; 12 | height: $spinner-height; 13 | vertical-align: text-bottom; 14 | border: $spinner-border-width solid currentColor; 15 | border-right-color: transparent; 16 | // stylelint-disable-next-line property-blacklist 17 | border-radius: 50%; 18 | animation: spinner-border .75s linear infinite; 19 | } 20 | 21 | .spinner-border-sm { 22 | width: $spinner-width-sm; 23 | height: $spinner-height-sm; 24 | border-width: $spinner-border-width-sm; 25 | } 26 | 27 | // 28 | // Growing circle 29 | // 30 | 31 | @keyframes spinner-grow { 32 | 0% { 33 | transform: scale(0); 34 | } 35 | 50% { 36 | opacity: 1; 37 | } 38 | } 39 | 40 | .spinner-grow { 41 | display: inline-block; 42 | width: $spinner-width; 43 | height: $spinner-height; 44 | vertical-align: text-bottom; 45 | background-color: currentColor; 46 | // stylelint-disable-next-line property-blacklist 47 | border-radius: 50%; 48 | opacity: 0; 49 | animation: spinner-grow .75s linear infinite; 50 | } 51 | 52 | .spinner-grow-sm { 53 | width: $spinner-width-sm; 54 | height: $spinner-height-sm; 55 | } 56 | -------------------------------------------------------------------------------- /C-lang Codes/implement a stack.c: -------------------------------------------------------------------------------- 1 | #include 2 | void push(char element, char stack[], int *top, int stackSize){ 3 | if(*top == -1){ 4 | stack[stackSize - 1] = element; 5 | *top = stackSize - 1; 6 | } 7 | else if(*top == 0){ 8 | printf("The stack is already full. \n"); 9 | } 10 | else{ 11 | stack[(*top) - 1] = element; 12 | (*top)--; 13 | } 14 | } 15 | void pop(char stack[], int *top, int stackSize){ 16 | if(*top == -1){ 17 | printf("The stack is empty. \n"); 18 | } 19 | else{ 20 | printf("Element popped: %c \n", stack[(*top)]); 21 | // If the element popped was the last element in the stack 22 | // then set top to -1 to show that the stack is empty 23 | if((*top) == stackSize - 1){ 24 | (*top) = -1; 25 | } 26 | else{ 27 | (*top)++; 28 | } 29 | } 30 | } 31 | int main() { 32 | int stackSize = 4; 33 | char stack[stackSize]; 34 | // A negative index shows that the stack is empty 35 | int top = -1; 36 | push('a', stack, &top, stackSize); 37 | printf("Element on top: %c\n", stack[top]); 38 | push('b',stack, &top, stackSize); 39 | printf("Element on top: %c\n", stack[top]); 40 | pop(stack, &top, stackSize); 41 | printf("Element on top: %c\n", stack[top]); 42 | pop(stack, &top, stackSize); 43 | printf("Top: %d\n", top); 44 | pop(stack, &top, stackSize); 45 | return 0; 46 | } 47 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/mixins/_image.scss: -------------------------------------------------------------------------------- 1 | // Image Mixins 2 | // - Responsive image 3 | // - Retina image 4 | 5 | 6 | // Responsive image 7 | // 8 | // Keep images from scaling beyond the width of their parents. 9 | 10 | @mixin img-fluid { 11 | // Part 1: Set a maximum relative to the parent 12 | max-width: 100%; 13 | // Part 2: Override the height to auto, otherwise images will be stretched 14 | // when setting a width and height attribute on the img element. 15 | height: auto; 16 | } 17 | 18 | 19 | // Retina image 20 | // 21 | // Short retina mixin for setting background-image and -size. 22 | 23 | @mixin img-retina($file-1x, $file-2x, $width-1x, $height-1x) { 24 | background-image: url($file-1x); 25 | 26 | // Autoprefixer takes care of adding -webkit-min-device-pixel-ratio and -o-min-device-pixel-ratio, 27 | // but doesn't convert dppx=>dpi. 28 | // There's no such thing as unprefixed min-device-pixel-ratio since it's nonstandard. 29 | // Compatibility info: https://caniuse.com/#feat=css-media-resolution 30 | @media only screen and (min-resolution: 192dpi), // IE9-11 don't support dppx 31 | only screen and (min-resolution: 2dppx) { // Standardized 32 | background-image: url($file-2x); 33 | background-size: $width-1x $height-1x; 34 | } 35 | @include deprecate("`img-retina()`", "v4.3.0", "v5"); 36 | } 37 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_images.scss: -------------------------------------------------------------------------------- 1 | // Responsive images (ensure images don't scale beyond their parents) 2 | // 3 | // This is purposefully opt-in via an explicit class rather than being the default for all ``s. 4 | // We previously tried the "images are responsive by default" approach in Bootstrap v2, 5 | // and abandoned it in Bootstrap v3 because it breaks lots of third-party widgets (including Google Maps) 6 | // which weren't expecting the images within themselves to be involuntarily resized. 7 | // See also https://github.com/twbs/bootstrap/issues/18178 8 | .img-fluid { 9 | @include img-fluid; 10 | } 11 | 12 | 13 | // Image thumbnails 14 | .img-thumbnail { 15 | padding: $thumbnail-padding; 16 | background-color: $thumbnail-bg; 17 | border: $thumbnail-border-width solid $thumbnail-border-color; 18 | @include border-radius($thumbnail-border-radius); 19 | @include box-shadow($thumbnail-box-shadow); 20 | 21 | // Keep them at most 100% wide 22 | @include img-fluid; 23 | } 24 | 25 | // 26 | // Figures 27 | // 28 | 29 | .figure { 30 | // Ensures the caption's text aligns with the image. 31 | display: inline-block; 32 | } 33 | 34 | .figure-img { 35 | margin-bottom: $spacer / 2; 36 | line-height: 1; 37 | } 38 | 39 | .figure-caption { 40 | @include font-size($figure-caption-font-size); 41 | color: $figure-caption-color; 42 | } 43 | -------------------------------------------------------------------------------- /C++ Codes/mergeinterval.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | vector> merge(vector>& intervals) { 4 | sort(intervals.begin(),intervals.end()); 5 | vector> ans; 6 | int i=0; 7 | int n=intervals.size(),s=-1,e=-1; 8 | while(i{s, e}); 21 | s=intervals[i][0]; 22 | e=intervals[i][1]; 23 | i++; 24 | } 25 | } 26 | } 27 | if(s!=-1){ 28 | ans.push_back(vector{s, e}); 29 | } 30 | return ans; 31 | } 32 | int main(){ 33 | int n; 34 | cin>>n; 35 | vector> intervals(n); 36 | for(int i=0;i>a>>b; 39 | intervals[i].push_back(a); 40 | intervals[i].push_back(b); 41 | } 42 | vector> ans = merge(intervals); 43 | cout<<"Intervals after merge operation are:\n"; 44 | for(int i=0;i which matches the accuracy of two words 3 | data = json.load(open("data.json")) # reading data from json file 4 | 5 | def translate(w): # defined function 6 | w = w.lower() # used lower() method for the input of user 7 | if w in data: 8 | return data[w] # returning wordfrom the json module 9 | elif w.title() in data: 10 | return(data[w.title()]) 11 | elif w.upper() in data: 12 | return(data[w.upper()]) 13 | elif len(get_close_matches(w, data.keys())) > 0: 14 | yn = input(f"Did you mean {get_close_matches(w, data.keys())[0]} instead? Enter Y if Yes, or N if No: " ) 15 | if yn == "Y": 16 | return data[get_close_matches(w, data.keys())[0]] 17 | elif yn =="N": 18 | return "The word doesn't exist. Please check again!" 19 | else: 20 | return "We didn't understand your query" 21 | else: 22 | return "This word doesn't exist.Please check again!" 23 | 24 | word = input("Enter a word: ") 25 | result = translate(word) 26 | if type(result) == list: 27 | for item in result: 28 | print(result) 29 | else: 30 | print(result,end=" ") -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_badge.scss: -------------------------------------------------------------------------------- 1 | // Base class 2 | // 3 | // Requires one of the contextual, color modifier classes for `color` and 4 | // `background-color`. 5 | 6 | .badge { 7 | display: inline-block; 8 | padding: $badge-padding-y $badge-padding-x; 9 | @include font-size($badge-font-size); 10 | font-weight: $badge-font-weight; 11 | line-height: 1; 12 | text-align: center; 13 | white-space: nowrap; 14 | vertical-align: baseline; 15 | @include border-radius($badge-border-radius); 16 | @include transition($badge-transition); 17 | 18 | @at-root a#{&} { 19 | @include hover-focus { 20 | text-decoration: none; 21 | } 22 | } 23 | 24 | // Empty badges collapse automatically 25 | &:empty { 26 | display: none; 27 | } 28 | } 29 | 30 | // Quick fix for badges in buttons 31 | .btn .badge { 32 | position: relative; 33 | top: -1px; 34 | } 35 | 36 | // Pill badges 37 | // 38 | // Make them extra rounded with a modifier to replace v3's badges. 39 | 40 | .badge-pill { 41 | padding-right: $badge-pill-padding-x; 42 | padding-left: $badge-pill-padding-x; 43 | @include border-radius($badge-pill-border-radius); 44 | } 45 | 46 | // Colors 47 | // 48 | // Contextual variations (linked badges get darker on :hover). 49 | 50 | @each $color, $value in $theme-colors { 51 | .badge-#{$color} { 52 | @include badge-variant($value); 53 | } 54 | } 55 | -------------------------------------------------------------------------------- /Python Codes/heap_sort.py: -------------------------------------------------------------------------------- 1 | # Python program for implementation of heap Sort 2 | 3 | # To heapify subtree rooted at index i. 4 | # n is size of heap 5 | def heapify(arr, n, i): 6 | largest = i # Initialize largest as root 7 | l = 2 * i + 1 # left = 2*i + 1 8 | r = 2 * i + 2 # right = 2*i + 2 9 | 10 | # See if left child of root exists and is 11 | # greater than root 12 | if l < n and arr[i] < arr[l]: 13 | largest = l 14 | 15 | # See if right child of root exists and is 16 | # greater than root 17 | if r < n and arr[largest] < arr[r]: 18 | largest = r 19 | 20 | # Change root, if needed 21 | if largest != i: 22 | arr[i],arr[largest] = arr[largest],arr[i] # swap 23 | 24 | # Heapify the root. 25 | heapify(arr, n, largest) 26 | 27 | # The main function to sort an array of given size 28 | def heapSort(arr): 29 | n = len(arr) 30 | 31 | # Build a maxheap. 32 | # Since last parent will be at ((n//2)-1) we can start at that location. 33 | for i in range(n // 2 - 1, -1, -1): 34 | heapify(arr, n, i) 35 | 36 | # One by one extract elements 37 | for i in range(n-1, 0, -1): 38 | arr[i], arr[0] = arr[0], arr[i] # swap 39 | heapify(arr, i, 0) 40 | 41 | # Driver code to test above 42 | arr = [ 14, 19, 11, 53, 16, 74] 43 | heapSort(arr) 44 | n = len(arr) 45 | print ("Sorted array is") 46 | for i in range(n): 47 | print ("%d" %arr[i]), 48 | # This code is contributed by Nikhar Kesari 49 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_alert.scss: -------------------------------------------------------------------------------- 1 | // 2 | // Base styles 3 | // 4 | 5 | .alert { 6 | position: relative; 7 | padding: $alert-padding-y $alert-padding-x; 8 | margin-bottom: $alert-margin-bottom; 9 | border: $alert-border-width solid transparent; 10 | @include border-radius($alert-border-radius); 11 | } 12 | 13 | // Headings for larger alerts 14 | .alert-heading { 15 | // Specified to prevent conflicts of changing $headings-color 16 | color: inherit; 17 | } 18 | 19 | // Provide class for links that match alerts 20 | .alert-link { 21 | font-weight: $alert-link-font-weight; 22 | } 23 | 24 | 25 | // Dismissible alerts 26 | // 27 | // Expand the right padding and account for the close button's positioning. 28 | 29 | .alert-dismissible { 30 | padding-right: $close-font-size + $alert-padding-x * 2; 31 | 32 | // Adjust close link position 33 | .close { 34 | position: absolute; 35 | top: 0; 36 | right: 0; 37 | padding: $alert-padding-y $alert-padding-x; 38 | color: inherit; 39 | } 40 | } 41 | 42 | 43 | // Alternate styles 44 | // 45 | // Generate contextual modifier classes for colorizing the alert. 46 | 47 | @each $color, $value in $theme-colors { 48 | .alert-#{$color} { 49 | @include alert-variant(theme-color-level($color, $alert-bg-level), theme-color-level($color, $alert-border-level), theme-color-level($color, $alert-color-level)); 50 | } 51 | } 52 | -------------------------------------------------------------------------------- /C-lang Codes/Circular Queue.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #define MAX 5 5 | 6 | int front=-1,rear=-1,c_queue[MAX]; 7 | void insert(); 8 | void delete(); 9 | int main(void) 10 | { 11 | int ch; 12 | while(1) 13 | { 14 | printf("\nCircular queue menu is:\n"); 15 | printf("1. insert\n"); 16 | printf("2. delete\n"); 17 | printf("3. exit\n"); 18 | printf("\nEnter your choice (1-3):\n"); 19 | scanf("%d",&ch); 20 | 21 | switch(ch) 22 | { 23 | case 1: insert(); 24 | break; 25 | case 2: delete(); 26 | break; 27 | case 3: exit(0); 28 | default: printf("Wrong Choice!\n"); 29 | 30 | } 31 | } 32 | } 33 | void insert(){ 34 | int val; 35 | if(front==(rear+1)%MAX) 36 | printf("Circular queue is full!\n"); 37 | else 38 | { 39 | if(front==-1) 40 | front=0; 41 | printf("Enter the element to insert in circular queue is:\n"); 42 | scanf("%d",&val); 43 | rear=(rear+1)%MAX; 44 | c_queue[rear]=val; 45 | } 46 | } 47 | void delete(){ 48 | if(front==-1 && rear==-1) 49 | printf("Circular queue is empty!\n"); 50 | else if(front==rear){ 51 | printf("Deleted element from circular queue is: %d\n",c_queue[front]); 52 | front=-1; 53 | rear=-1; 54 | } 55 | else{ 56 | printf("Deleted element from circular queue is: %d\n",c_queue[front]); 57 | front=(front+1)%MAX; 58 | } 59 | } 60 | 61 | -------------------------------------------------------------------------------- /Java Codes/BinaryTreeLevelOrderTraversal.java: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for a binary tree node. 3 | * public class TreeNode { 4 | * int val; 5 | * TreeNode left; 6 | * TreeNode right; 7 | * TreeNode() {} 8 | * TreeNode(int val) { this.val = val; } 9 | * TreeNode(int val, TreeNode left, TreeNode right) { 10 | * this.val = val; 11 | * this.left = left; 12 | * this.right = right; 13 | * } 14 | * } 15 | */ 16 | class Solution { 17 | 18 | public List> levelOrder(TreeNode root) { 19 | Queue q = new LinkedList<>(); // queue to store the nodes 20 | q.add(root); 21 | List> res = new ArrayList<>(); 22 | 23 | if(root == null) return res; 24 | while(q.size()!= 0){ 25 | List branch = new ArrayList<>(); //it stores the root.val at every level 26 | int size = q.size(); 27 | for(int i=0;i(branch)); 34 | } 35 | return res; 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /flutter/show_users_from_api/windows/runner/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | #include "flutter_window.h" 6 | #include "run_loop.h" 7 | #include "utils.h" 8 | 9 | int APIENTRY wWinMain(_In_ HINSTANCE instance, _In_opt_ HINSTANCE prev, 10 | _In_ wchar_t *command_line, _In_ int show_command) { 11 | // Attach to console when present (e.g., 'flutter run') or create a 12 | // new console when running with a debugger. 13 | if (!::AttachConsole(ATTACH_PARENT_PROCESS) && ::IsDebuggerPresent()) { 14 | CreateAndAttachConsole(); 15 | } 16 | 17 | // Initialize COM, so that it is available for use in the library and/or 18 | // plugins. 19 | ::CoInitializeEx(nullptr, COINIT_APARTMENTTHREADED); 20 | 21 | RunLoop run_loop; 22 | 23 | flutter::DartProject project(L"data"); 24 | 25 | std::vector command_line_arguments = 26 | GetCommandLineArguments(); 27 | 28 | project.set_dart_entrypoint_arguments(std::move(command_line_arguments)); 29 | 30 | FlutterWindow window(&run_loop, project); 31 | Win32Window::Point origin(10, 10); 32 | Win32Window::Size size(1280, 720); 33 | if (!window.CreateAndShow(L"showuser", origin, size)) { 34 | return EXIT_FAILURE; 35 | } 36 | window.SetQuitOnClose(true); 37 | 38 | run_loop.Run(); 39 | 40 | ::CoUninitialize(); 41 | return EXIT_SUCCESS; 42 | } 43 | -------------------------------------------------------------------------------- /contact-form/scss/bootstrap/_breadcrumb.scss: -------------------------------------------------------------------------------- 1 | .breadcrumb { 2 | display: flex; 3 | flex-wrap: wrap; 4 | padding: $breadcrumb-padding-y $breadcrumb-padding-x; 5 | margin-bottom: $breadcrumb-margin-bottom; 6 | list-style: none; 7 | background-color: $breadcrumb-bg; 8 | @include border-radius($breadcrumb-border-radius); 9 | } 10 | 11 | .breadcrumb-item { 12 | // The separator between breadcrumbs (by default, a forward-slash: "/") 13 | + .breadcrumb-item { 14 | padding-left: $breadcrumb-item-padding; 15 | 16 | &::before { 17 | display: inline-block; // Suppress underlining of the separator in modern browsers 18 | padding-right: $breadcrumb-item-padding; 19 | color: $breadcrumb-divider-color; 20 | content: $breadcrumb-divider; 21 | } 22 | } 23 | 24 | // IE9-11 hack to properly handle hyperlink underlines for breadcrumbs built 25 | // without `
    `s. The `::before` pseudo-element generates an element 26 | // *within* the .breadcrumb-item and thereby inherits the `text-decoration`. 27 | // 28 | // To trick IE into suppressing the underline, we give the pseudo-element an 29 | // underline and then immediately remove it. 30 | + .breadcrumb-item:hover::before { 31 | text-decoration: underline; 32 | } 33 | // stylelint-disable-next-line no-duplicate-selectors 34 | + .breadcrumb-item:hover::before { 35 | text-decoration: none; 36 | } 37 | 38 | &.active { 39 | color: $breadcrumb-active-color; 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /C-lang Codes/array_no-of-duplicate-elements_&_most-repeating-element.c: -------------------------------------------------------------------------------- 1 | /* Write a program to store random numbers into an array of n integers, where the array must contains some duplicates. Do the following: 2 | a) Find out the total number of duplicate elements. 3 | b) Find out the most repeating element in the array. 4 | */ 5 | 6 | #include 7 | #include 8 | int duplicate(int a[],int n) 9 | { int i,j,count; 10 | count=0; 11 | for(i=0;imaxCount) 32 | maxElement=a[j]; 33 | } 34 | } 35 | } 36 | return maxElement; 37 | } 38 | int main() 39 | { int n,i,c1,c2,count,j; 40 | printf("Enter the size of the array: "); 41 | scanf("%d",&n); 42 | int a[n]; 43 | printf("\nEnter the %d elements of the array: ",n); 44 | for(i=0;i zigZagTraversal(Node* root) 2 | { 3 | //just do level order traversal and add reverse array if flag is false else add the array 4 | dequeq; 5 | q.push_back(root); 6 | vectorv; 7 | v.push_back(root->data); 8 | int flag=1; 9 | 10 | while(!q.empty()){ 11 | int n=q.size(); 12 | 13 | for(int i=0;ileft) { 20 | q.push_front(temp->left); 21 | v.push_back(temp->left->data); 22 | } 23 | if (temp->right) { 24 | q.push_front(temp->right); 25 | v.push_back(temp->right->data); 26 | } 27 | } 28 | else { 29 | Node* temp = q.front(); 30 | q.pop_front(); 31 | if (temp->right) { 32 | q.push_back(temp->right); 33 | v.push_back(temp->right->data); 34 | } 35 | if (temp->left) { 36 | q.push_back(temp->left); 37 | v.push_back(temp->left->data); 38 | } 39 | } 40 | 41 | }flag=1-flag; 42 | 43 | } 44 | 45 | return v; 46 | } 47 | --------------------------------------------------------------------------------