{{ message }}

Instantly share code, notes, and snippets.

🎯
Focusing

# Gopesh Neptune998

🎯
Focusing
Created Aug 3, 2020
View Code.py
 def fun(): return "Hello" fun()
Created Aug 4, 2020
View code.ino
 def fun(): return "Hemmo"
Created Aug 7, 2020
View reverse_string.js
 function reverseString(s) { try{ console.log(s.split('').reverse().join('')); } catch(e){ console.log(e.message); console.log(s); } }
Created Aug 7, 2020
View factorial.js
 function factorial(n){ if(n===0){ return 1; } else{ return n* factorial(n-1); } }
Created Aug 7, 2020
View area_perimeter_circle.js
 function main() { // Write your code here. Read input using 'readLine()' and print output using 'console.log()'. const PI = Math.PI; var s = readLine(); // Print the area of the circle: console.log(PI*parseFloat(s)*parseFloat(s)); // Print the perimeter of the circle: console.log(2*PI*parseFloat(s));
Created Aug 8, 2020
View second_largest.js
 function getSecondLargest(arr) { let max = -Infinity, result = -Infinity; for (const value of arr) { const next_ele = Number(value) if (next_ele > max) { [result, max] = [max, next_ele] // save previous max } else if (next_ele < max && next_ele > result)
Last active Aug 8, 2020
View class_rectangle_extend_square.js
 // Use rectangle class to find the area of Square. class Rectangle { constructor(w, h) { this.w = w; this.h = h; } } // Rectangle class Method to find the area. Rectangle.prototype.area = function() { return(this.w*this.h);
Created Aug 9, 2020
View Polygon_class.js
 /* * Implement a Polygon class with the following properties: * 1. A constructor that takes an array of integer side lengths. * 2. A 'perimeter' method that returns the sum of the Polygon's side lengths. */ class Polygon { constructor(sides) { this.sides = sides; }
Created Aug 12, 2020
View Bubble_sort.py
 # Bubble sort def bubble_sort(arr, itr): lgth = len(arr) for i in range(lgth): for j in range(lgth-i-1): if arr[j]>arr[j+1]: arr[j],arr[j+1] = arr[j+1],arr[j] print("Iteration:",i,arr) itr+=1
Last active Aug 13, 2020
Insertion Sort
View insertion_sort.py
 # Insertion sort def Insertion_sort(arr, itr): lgth = len(arr) for i in range(1,lgth): x,j = arr[i],i-1 while j>=0 and arr[j]>x: arr[j+1] = arr[j] j-=1 arr[j+1] = x print("Iteration:",i,arr)