index.html | Owner: cody | Views: 181 | Comments: 0 | Open/ Source 12.45 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Menu Example</title> <link rel
index.html | Owner: cody | Views: 181 | Comments: 0 | Open/ Source 12.45 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Menu Example</title> <link rel
LeetCode - Valid Word - Python | Owner: abh | Views: 50 | Comments: 0 | Open/ Source 244 Bclass Solution: def isValid(self, w: str, vo="aoeuiAOEUI", co="pyfgcrldhtnsqjkxbmwvzPYFGCRLDHTNSQJKXBMWVZ", n="7531902468")
index.html | Owner: cody | Views: 102 | Comments: 0 | Open/ Source 1.13 KB<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>C
index.html | Owner: cody | Views: 181 | Comments: 0 | Open/ Source 1.62 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
MySQL-Databases-Connection.php | Owner: djdj | Views: 83 | Comments: 0 | Open/ Source 534 B<?php //Database Connection /*There are two ways to connect to My SQL Database 1. MySQLi extension (for use only m
1.txt | Owner: coderai | Views: 180 | Comments: 0 | Open/ Source 1.26 KBCoderAI is a powerful tool that enhances the coding experience by providing assistance and guidance to developers. Its benefits
Post-Method.php | Owner: djdj | Views: 184 | Comments: 0 | Open/ Source 413 B<?php if($_SERVER['REQUEST_METHOD'] == 'POST'){//if (isset($_POST)){ $name = $_POST['name']; $email = $_POST
Mc | Owner: djdj | Views: 513 | Comments: 0 | Open/ Source 6.4 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 167 | Comments: 0 | Open/ Source 784 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge">
LeetCode - Sort Array by Increasing Frequency - Python | Owner: abh | Views: 97 | Comments: 0 | Open/ Source 465 Bclass Solution: def frequencySort(self, nums: List[int]) -> List[int]: freq = [] for n in set(nums):
index_socials.html | Owner: cody | Views: 208 | Comments: 0 | Open/ Source 3.37 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Login 03</title> <meta name=
index.html | Owner: cody | Views: 194 | Comments: 0 | Open/ Source 900 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 120 | Comments: 0 | Open/ Source 543 B<!DOCTYPE html> <html> <head> <meta charset="utf-8" /> <meta http-equiv="X-UA-Compatible" content="IE=edge" /> <ti
LeetCode - Two Out of Three - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 829 Bfunc contain(nums []int, target int) bool { for _, n := range nums { if n == target { return true
index.html | Owner: cody | Views: 114 | Comments: 0 | Open/ Source 1.38 KB<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>E
index.html | Owner: cody | Views: 208 | Comments: 0 | Open/ Source 948 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge">
LeetCode - Find the Number of Good Pairs - Go | Owner: abh | Views: 44 | Comments: 0 | Open/ Source 254 Bfunc numberOfPairs(nums1 []int, nums2 []int, k int) int { var count int for _, i := range nums1 { for _, j :=
index.html | Owner: cody | Views: 233 | Comments: 0 | Open/ Source 2.52 KB<!DOCTYPE html> <html lang="en" > <head> <meta charset="UTF-8"> <title>Call App</title> <link rel="stylesheet" href="./sty
yas.html | Owner: abh | Views: 360 | Comments: 0 | Open/ Source 686 B<!--You are star--> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <center> <div id="main"> <h1
index.html | Owner: cody | Views: 101 | Comments: 0 | Open/ Source 2.49 KB<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>C
LeetCode - N-ary Tree Preorder Traversal - Go | Owner: abh | Views: 47 | Comments: 0 | Open/ Source 340 B/** * Definition for a Node. * type Node struct { * Val int * Children []*Node * } */ func preorder(root
index.html | Owner: cody | Views: 175 | Comments: 0 | Open/ Source 1.1 KB<!DOCTYPE html> <html lang="en" > <head> <meta charset="UTF-8"> <title>Color Game</title> <link rel="stylesheet" href="htt
LeetCode - Faulty Keyboard - Go | Owner: abh | Views: 37 | Comments: 0 | Open/ Source 374 Bfunc reverse(s string) string { var rev string for i:=len(s)-1; i>=0; i-- { rev += string(s[i]) } r
is_divisible_by.py | Owner: abh | Views: 627 | Comments: 0 | Open/ Source 115 Bdef is_divisible_by(num, div): return num % div != 0 def is_divisible_by(num, div): return num / div == 0
Q29_Divide_Two_Integers.py | Owner: djdj | Views: 237 | Comments: 0 | Open/ Source 222 Bclass Solution { function divide($dividend, $divisor) { if(intval($dividend/$divisor) > 2**31-1){ return
index.html | Owner: cody | Views: 40 | Comments: 0 | Open/ Source 1.19 KB<!DOCTYPE html> <html> <head> <!-- If you are serving your web app in a path other than the root, change the href valu
LeetCode - Count Largest Group - Python | Owner: abh | Views: 55 | Comments: 0 | Open/ Source 526 Bclass Solution: def countLargestGroup(self, n: int) -> int: groups = {} l = 0 for i in range(1,
index.html | Owner: cody | Views: 143 | Comments: 0 | Open/ Source 1.55 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 105 | Comments: 0 | Open/ Source 595 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>G
LeetCode - Largest Positive Integer That Exists With Its Negative - Python | Owner: abh | Views: 169 | Comments: 0 | Open/ Source 274 Bclass Solution: def findMaxK(self, nums: List[int]) -> int: nums.sort() l = -1 for n in nums:
LeetCode - Find Pivot Index - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 263 Bfunc pivotIndex(nums []int) int { var sum int for _, n := range nums { sum += n } var ls int = 0
index.html | Owner: cody | Views: 100 | Comments: 0 | Open/ Source 516 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>P
LeetCode - Divide an Array Into Subarrays With Minimum Cost I - Python | Owner: abh | Views: 51 | Comments: 0 | Open/ Source 211 Bclass Solution: def minimumCost(self, nums: List[int]) -> int: c = nums[0] nums = nums[1:] s = m
hello-world.kt | Owner: demo | Views: 296 | Comments: 0 | Open/ Source 45 Bfun main() { println("Hello, World!") }
index.html | Owner: cody | Views: 110 | Comments: 0 | Open/ Source 422 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>P
Buttons | Owner: cody | Views: 241 | Comments: 0 | Open/ Source 1.15 KB<!DOCTYPE html> <html> <head> <style> body { font-family: 'Arial', sans-serif; display: flex; a
LeetCode - Counter II - JavaScript | Owner: abh | Views: 117 | Comments: 0 | Open/ Source 633 B/** * @param {integer} init * @return { increment: Function, decrement: Function, reset: Function } */ var createCounter
index.html | Owner: cody | Views: 164 | Comments: 0 | Open/ Source 1.35 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 168 | Comments: 0 | Open/ Source 704 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge">
index.html | Owner: cody | Views: 171 | Comments: 0 | Open/ Source 933 B<html> <head> <link rel="stylesheet" href="css/bootstrap.min.css"> <link rel="stylesheet" href="css/main.css
dakshbadal1379 | Owner: dakshbadal1379 | Views: 110 | Comments: 0 | Open/ Source 2.87 KB<!DOCTYPE html> <html> <head> <title>Register</title> <link rel="icon" type="image/x-icon" href="download.png"> <link re
excel.html | Owner: cody | Views: 77 | Comments: 0 | Open/ Source 1.48 KB<!DOCTYPE html> <html> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=
Flower For You | Owner: abh | Views: 580 | Comments: 0 | Open/ Source 31.69 KBframes = [ """ :+*+=. .::::
Something Special | Owner: djdj | Views: 4 | Comments: 0 | Open/ Source 6.12 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in
If-else.php | Owner: djdj | Views: 164 | Comments: 0 | Open/ Source 776 B<?php $a = 5; $b = 2000; $c = 2016; if($a > 2){ echo "a is greater than 2\n"; } else{
split.html | Owner: cody | Views: 178 | Comments: 0 | Open/ Source 397 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>split</title> </head> <body> <div> <nav> <h1
index.html | Owner: cody | Views: 124 | Comments: 0 | Open/ Source 429 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>S
material-ui.html | Owner: cody | Views: 180 | Comments: 0 | Open/ Source 1.36 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Input 01</title> <meta name=
LeetCode - Fibonacci Number - Rust | Owner: abh | Views: 274 | Comments: 1 | Open/ Source 354 Bimpl Solution { pub fn fib(n: i32) -> i32 { if (n == 0){ return 0; } if (n == 1){
encrypt_rot13.py | Owner: abh | Views: 253 | Comments: 0 | Open/ Source 266 Bdef encrypt_rot13(text): cipher = "" for char in text: if char.isalpha(): offset = 65 if char.isuppe
Definitely.html | Owner: dakshbadal1379 | Views: 244 | Comments: 0 | Open/ Source 1.25 KB<!DOCTYPE html><html lang="en"><head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-sc
index.html | Owner: cody | Views: 186 | Comments: 0 | Open/ Source 2.32 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"> <title>Dropdown Menu 01</title> <link
Post-Method.php | Owner: djdj | Views: 249 | Comments: 0 | Open/ Source 413 B<?php if($_SERVER['REQUEST_METHOD'] == 'POST'){//if (isset($_POST)){ $name = $_POST['name']; $email = $_POST
Hik | Owner: amar | Views: 54 | Comments: 0 | Open/ Source 8.97 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, init
tribute.html | Owner: tanishkak | Views: 370 | Comments: 0 | Open/ Source 4.14 KB<!DOCTYPE html> <html> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width i
index.html | Owner: cody | Views: 181 | Comments: 0 | Open/ Source 560 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 180 | Comments: 0 | Open/ Source 1.1 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge">
Session.php | Owner: djdj | Views: 206 | Comments: 0 | Open/ Source 219 B<?php //session //session use for the verification of the user session_start(); $_SESSION['username'] = 'SabkaCo
index.html | Owner: cody | Views: 116 | Comments: 0 | Open/ Source 892 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>S
Associative-Array.php | Owner: djdj | Views: 55 | Comments: 0 | Open/ Source 873 B<?php //Numeric Array or Index Array $arr = array('ram','shiv','kumar','arjun'); echo $arr[0]; echo $arr[1];
LeetCode - Check If N and Its Double Exist - Python | Owner: abh | Views: 81 | Comments: 0 | Open/ Source 297 Bclass Solution: def checkIfExist(self, arr: List[int]) -> bool: for i in range(len(arr)): for j in ra
index.html | Owner: cody | Views: 171 | Comments: 0 | Open/ Source 5.71 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 234 | Comments: 0 | Open/ Source 693 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
NAVIGATIONBAR.HTML | Owner: dakshbadal1379 | Views: 257 | Comments: 0 | Open/ Source 1.2 KB<!DOCTYPE html> <html> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1">
index_socials.html | Owner: cody | Views: 165 | Comments: 0 | Open/ Source 838 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Accordion FAQ</title> <link rel="stylesheet" href=
is_even.py | Owner: abh | Views: 172 | Comments: 0 | Open/ Source 959 BTESTCASES = [ { "positional": (2,), "keyword": {}, "return": True, "msg": "", }, {
LeetCode - Time Needed to Rearrange a Binary String - Python | Owner: abh | Views: 251 | Comments: 0 | Open/ Source 200 Bclass Solution: def secondsToRemoveOccurrences(self, s: str) -> int: secs = 0 while "01" in s:
5.txt | Owner: coderai | Views: 183 | Comments: 0 | Open/ Source 1003 B**Twitter:** * To tag a user on Twitter, simply type the @ symbol followed by their username. For example, to tag the user @co
index.html | Owner: cody | Views: 204 | Comments: 0 | Open/ Source 4.44 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Login Example</title> <meta na
LeetCode - Crawler Log Folder - Go | Owner: abh | Views: 31 | Comments: 0 | Open/ Source 313 Bfunc minOperations(logs []string) int { depth := 0 for _, o := range logs { if o == "../" { if d
NIOS Sr.Secondary (Block-2) | Owner: light | Views: 74 | Comments: 0 | Open/ Source 5.03 KB<html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0">
Q43_Multiply_Strings.py | Owner: djdj | Views: 212 | Comments: 0 | Open/ Source 104 Bdef multiply(self, num1, num2): num1 = int(num1) num2 = int(num2) a = num1 * num2 return str(a)
20.txt | Owner: coderai | Views: 174 | Comments: 0 | Open/ Source 1.16 KB* **Username:** @coderai * **Bio:** AI-powered coding assistant that helps developers write better code faster. * **Repositorie
LeetCode - Longest Strictly Increasing or Strictly Decreasing Subarray - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 524 Bfunc longestMonotonicSubarray(nums []int) int { l := 0 le := 0 ci := 0 for _, v := range nums { i
Todolist.html | Owner: tanishkak | Views: 351 | Comments: 0 | Open/ Source 771 B<!DOCTYPE html> <html> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width i
index.html | Owner: cody | Views: 109 | Comments: 0 | Open/ Source 1.28 KB<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>B
26.txt | Owner: coderai | Views: 145 | Comments: 0 | Open/ Source 1.22 KB* **Coding:** You can ask Coder AI questions like "How do I write a function to sort a list of numbers?" or "Can you help me de
signup 01 | Owner: cody | Views: 197 | Comments: 0 | Open/ Source 3.5 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Signup</title> <meta
rb.html | Owner: djdj | Views: 288 | Comments: 0 | Open/ Source 109 B<h1>This feature is not available.</h1><br> <h1 style="color=red;">jaldhi hi is feature ko laya jayega </h1>
nav.php | Owner: djdj | Views: 195 | Comments: 0 | Open/ Source 3.12 KB<?php session_start(); ?> <nav class="navbar navbar-expand-lg navbar-dark bg-dark"> <a class="navbar-brand" href="">SabkaCod
Instructions For Quiz | Owner: djdj | Views: 308 | Comments: 0 | Open/ Source 585 B<h1>Instruction For Quiz</h1> <ol> <li>Each questions carries equal marks.</li> <li>To answer the questions write only the op
index.html | Owner: cody | Views: 119 | Comments: 0 | Open/ Source 1019 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>M
24.txt | Owner: coderai | Views: 154 | Comments: 0 | Open/ Source 1.08 KB- **Q&A:** Answering questions on various topics. - **Text Generation:** Creating original text, such as stories, articles, po
index.html | Owner: cody | Views: 179 | Comments: 0 | Open/ Source 4.33 KB<!-- Based on Product Landing Page by Brad Traversy (2019) see: https://www.youtube.com/watch?v=61R5kn_kYwY --> <!DOCTYPE html>
27.txt | Owner: coderai | Views: 151 | Comments: 0 | Open/ Source 1.52 KBCoder AI is a comprehensive AI-powered platform designed to simplify and enhance software development. Our platform offers a wi
index.html | Owner: cody | Views: 109 | Comments: 0 | Open/ Source 362 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>P
Q595_Big_Countries.sql | Owner: djdj | Views: 250 | Comments: 0 | Open/ Source 88 Bselect name,population,area from World where area >= 3000000 or population >= 25000000;
index.html | Owner: dakshbadal1379 | Views: 141 | Comments: 0 | Open/ Source 3.21 KB<!DOCTYPE html> <html lang="en"> <head> <!-- Design by foolishdeveloper.com --> <title>Glassmorphism login Form Tutori
Front Page | Owner: djdj | Views: 502 | Comments: 0 | Open/ Source 1.73 MB<html xmlns="http://www.w3.org/1999/xhtml"><head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta h
LeetCode - Search a 2D Matrix - Python | Owner: abh | Views: 370 | Comments: 0 | Open/ Source 200 Bclass Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: for row in matrix:
Important topics | Owner: djdj | Views: 707 | Comments: 0 | Open/ Source 3.82 KB<head> <title>Imp Quetions</title> <meta name="viewport" content="width=device-width, initial-scale=1.0"> </head> <style> t
qcfc.py | Owner: abh | Views: 346 | Comments: 2 | Open/ Source 2.36 KB#quiz ans cheker for college #07/10/2023 def ans(): return open("ans.txt").read().split("\n")[:-1] def std(no):
| Owner: itintern | Views: 49 | Comments: 0 | Open/ Source 10.57 KB<html lang="en"><head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0">
Q1068_Product_Sales_Analysis_I.sql | Owner: djdj | Views: 272 | Comments: 0 | Open/ Source 103 Bselect product_name,year,price from sales inner join product on sales.product_id = product.product_id;
index.html | Owner: cody | Views: 117 | Comments: 0 | Open/ Source 2.23 KB<!DOCTYPE html> <html> <head> <meta charset="utf-8" /> <meta http-equiv="X-UA-Compatible" content="IE=edge" /> <ti
index.html | Owner: cody | Views: 112 | Comments: 0 | Open/ Source 674 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>3
index.html | Owner: cody | Views: 87 | Comments: 0 | Open/ Source 758 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>B
ALISHAMATHUR007 | Owner: djdj | Views: 4 | Comments: 0 | Open/ Source 2.75 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width,
index.html | Owner: cody | Views: 180 | Comments: 0 | Open/ Source 1.14 KB<!--index.html--> <!DOCTYPE html> <html lang="en"> <head> <title>Maths Game</title> <meta charset="utf-8"> <meta na
LeetCode - Max Consecutive Ones - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 264 Bfunc findMaxConsecutiveOnes(nums []int) int { m := 0 cc := 0 for _, n := range nums { if n != 1 {
Q182_Duplicate_Emails.sql | Owner: djdj | Views: 256 | Comments: 0 | Open/ Source 65 Bselect email from person group by email having count(email) > 1;
index.html | Owner: cody | Views: 165 | Comments: 0 | Open/ Source 861 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <met
LeetCode - Maximum Score After Splitting a String - Python | Owner: abh | Views: 64 | Comments: 0 | Open/ Source 301 Bclass Solution: def maxScore(self, s: str) -> int: maxscore = 0 for i in range(1, len(s)): l
index.html | Owner: cody | Views: 143 | Comments: 0 | Open/ Source 341 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta name="viewport" content="width=device-width, in
median.py | Owner: abh | Views: 247 | Comments: 0 | Open/ Source 288 Bdef median(series): s = series.copy() s.sort() n = len(s) if n % 2 == 1: return s[n // 2] return (s[
file-upload.html | Owner: abh | Views: 238 | Comments: 0 | Open/ Source 258 B<!-- file-uplaod.html --> <form action="/action/upload" method="POST" enctype="multipart/form-data"> <input type="file" name="fi
45.txt | Owner: coderai | Views: 178 | Comments: 0 | Open/ Source 1.3 KBThe user's GitHub account includes a number of projects that are related to natural language processing and machine learning. T
Q507_Perfect_Number.py | Owner: djdj | Views: 248 | Comments: 0 | Open/ Source 246 Bbool checkPerfectNumber(int num){ int i,s=0; for(i=1;i<num/2+1;i++) { if(num%i==0){ s=s+i;
OTP Generator.html | Owner: shubh | Views: 266 | Comments: 0 | Open/ Source 467 B<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initia
webpage3.html | Owner: demo | Views: 254 | Comments: 0 | Open/ Source 1.93 KB<!DOCTYPE html> <html> <head> <title>JavaScript Demo Page</title> <style> body { font-family:
35.txt | Owner: coderai | Views: 158 | Comments: 0 | Open/ Source 1.63 KB* **Writing:** I can help you write stories, poems, songs, and other creative content. I can also help you with writing tasks s
effect.html | Owner: tanishkak | Views: 398 | Comments: 0 | Open/ Source 1.41 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in
43.txt | Owner: coderai | Views: 168 | Comments: 0 | Open/ Source 1.82 KB**Key Features:** * **Error Reduction:** Flags coding errors for early detection and resolution, ensuring code stability. * **
img2.html | Owner: djdj | Views: 7 | Comments: 0 | Open/ Source 2.14 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in
| Owner: djdj | Views: 147 | Comments: 0 | Open/ Source 1.78 KB<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in
index.html | Owner: cody | Views: 123 | Comments: 0 | Open/ Source 386 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>P
arithmetic_operation.py | Owner: djdj | Views: 218 | Comments: 0 | Open/ Source 87 Ba = int(input()) b = int(input()) print(a+b) print(a-b) print(a*b)
LeetCode - Guess Number Higher or Lower - Go | Owner: abh | Views: 51 | Comments: 0 | Open/ Source 543 B/** * Forward declaration of guess API. * @param num your guess * @return -1 if num is higher than the picked nu
PY0B T4 | Owner: itintern | Views: 3 | Comments: 0 | Open/ Source 5.61 KB<html lang="en"><head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0">
health.html | Owner: djdj | Views: 0 | Comments: 0 | Open/ Source 314.07 KB<html><head> <script src="https://code.jquery.com/jquery-3.6.0.min.js" integrity="sha256-/xUj+3OJU5yExlq6GSYGSHk7tPXikynS7o
LeetCode - Strictly Palindromic Number - Go | Owner: abh | Views: 33 | Comments: 0 | Open/ Source 61 Bfunc isStrictlyPalindromic(n int) bool { return false }
LeetCode - Shuffle an Array - Python | Owner: abh | Views: 74 | Comments: 0 | Open/ Source 495 Bfrom random import shuffle class Solution: def __init__(self, nums: List[int]): self.list = nums sel
gcd.py | Owner: abh | Views: 272 | Comments: 0 | Open/ Source 138 Bdef gcd(a, b): if b == 0: return a return gcd(b, a % b) def gcd(a, b): while b: a, b = b, a % b
average.py | Owner: abh | Views: 281 | Comments: 0 | Open/ Source 315 Bdef average(*nums): s = 0 c = 0 for n in nums: s += n c += 1 return s / c def average(*nums):
index.html | Owner: cody | Views: 119 | Comments: 0 | Open/ Source 780 B<!DOCTYPE html> <html> <head> <meta charset='utf-8'> <meta http-equiv='X-UA-Compatible' content='IE=edge'> <title>P
|