id stringlengths 6 16 | category stringclasses 7
values | source_index int64 0 198 | text stringlengths 201 2.5k | normalized_sha256 stringlengths 64 64 |
|---|---|---|---|---|
code:000 | code | 0 | class ListNode:
def __init__(self,val):
self.next=None
self.val=val
def swapPairs(head):
dummyHead=ListNode(-1)
prev=dummyHead
while True:
if head!=None:
next=head.next
newNext=prev.next
prev.next=head
head.nex... | b40e7afdb3912cbe855ff6b8d041942b8d3983d6827bf573b24691746c4d56b7 |
code:001 | code | 1 | num1 = float(input('Enter first number'))
oprtr = str(input('Enter operator (+,-,*,/)'))
num2 = float(input('Enter second number'))
if oprtr=='+'or'+':
result = num1 + num2
print ('The Result Is',result )
elif oprtr=='-'or'-':
result = num1 - num2
print ('The Result Is',result )
elif oprtr=='*'or'*... | 77796575699989a6330a57ec574bec932bd6fd683b9880f8fb584e6b28ae0862 |
code:002 | code | 2 | def findPathExists(root,u,v):
queue = collections.deque([root]);
seen = {root};
while queue:
curr =queue.popleft();
children =curr.children;
if curr==u:
break ;
elif curr==v:
return True;
for c... | 9c6e8ef4367569ce6cbc4c2ddc143bbb004e55d99ada349763c89873d854dc86 |
code:003 | code | 3 | matrix=[[1,2],[3,4]]
identityMatrix=[]
inverseMatrix=[]
transposeMatrix=[]
for row in matrix:
newRow=[]
for column in row:
newColumn=column**-1
newRow.append(newColumn)
inverseMatrix.append(newRow)
for row in zip(*matrix):
new... | dd49e45413ba3fde1b336648b888af8087c49fde60f4b7ed24275521a8c57188 |
code:004 | code | 4 | from itertools import product
# Function to check first character of every permutation
def isValidFirstChar(string):
# Iterate over characters of string
for c in string:
# If found digit then return false
if ord(c)<ord("9"):
return False
# Else return true
return True... | f35f19974af989a64f2e90dfefd8e49cdb894e2138a249ee62357148ef3347b6 |
code:005 | code | 5 | class Student:
def __init__(self, name,rollNo,age,city,phoneNumber ):
self.__name=name;
self.__rollNo=rollNo;
self.__age=age;
self.__city=city;
self.__phoneNumber=phoneNumber;
@property
def Name(self):
return self.__name;
@Name... | 5d57d4df5c8488e4957147493a3387cf9568d935e273267137c421879f5d98f0 |
code:006 | code | 6 | from itertools import permutations
string="abc"
print('The permutation of',string,'are:')
for p in sorted(permutations(string)):
print(*p)
Output :
The permutation of abc are:
a b c
b a c
c a b
a c b
c b a
b c a | be02b4e12f8b1a2e02a3cb845fb0a9f3ca89a3c326d55bfa93ed10c26d485fdd |
code:008 | code | 8 | def decToHexadecimal(number):
hexValues="0123456789ABCDEF"
result=""
remainder=0
while number>0:
remainder=int(number%16)
result+=hexValues[remainder]
number//=16
return "".join(reversed(result)) | 3c2ede33c4c55f36b093c9a32de4f779c376b52ae6645d0bfe89d125d08901da |
code:009 | code | 9 | def fibo(n):
'''Returns the nth element of the Fibonacci Sequence'''
if n <= 1:
return n
elif n==2:
return 1
else:
return fibo(n-1)+fibo(n-2)
print(fibo(input())) | 8dca98bd0db6eed1373fd5d8ca5843b653d88f163a4f8d8188560e86e52c48b2 |
code:010 | code | 10 | def titleCase(sentence):
strArr=[]
for char in sentence:
if char==" ":
strArr.append("")
else:
strArr[-1]+=char.upper()
return "".join([word+" " for word in strArr[:-1]]) + strArr[-1].capitalize() | d6461fb4831186e098610004d4f5d35127303a29d02a6cf3800c1f74704421a4 |
code:012 | code | 12 | class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res;
if (!numRows)return res;
res.resize(numRows);
res[0].emplace_back(1);
for (size_t r = 1;r!= numRows;++r)
{
size_t c = 0;
res[r].reserve(c + 1u);
... | 23b7a50663696084a7bab6f03957cdc9c9f8cc604ccd368ebd2a107f5f71f5af |
code:014 | code | 14 | num1 = float(input())
oprtr = input()
num2 = float(input())
if oprtr == "+":
ans = num1+num2
elif oprtr == "-":
ans = num1-num2
elif oprtr == "*":
ans = num1*num2
else:
ans = num1//num2
print("%f"%ans) | ad6083cf39ed63832730bc5ca6d7e25094f1bd8738fd76f9fa917395d73973fb |
code:015 | code | 15 | def fibo(num):
"""This function prints the nth Fibonacci Number"""
a = 0
b = 1
count = 0
while count < num:
print(b)
a, b = b, a + b
count += 1
fibo(10); | 545fa64c74e2b7d4ff17344924da420ba10ce72b48d95e6a4bb90c112710f84f |
code:016 | code | 16 | def make_matrix(rows, cols, char='x'):
"""Returns a matrix of size rows x cols filled with 'char'"""
result = ''
for row in range(rows):
line = ''.join(['%s'%char]*cols)+'\n'
result += line
return result[:-1]
print(make_matrix(3, 4), end='')
# Output:
# xxx
# xxx
# xxx | 9267143dd7b3f20a5e531aa314de601225039178e47cf639eae8256f8f2e5cf2 |
code:017 | code | 17 | from random import randrange
evenNumbers=[]
while len(evenNumbers)<5:
tempNumber=randrange(low=10,high=21,step=2)
if tempNumber%2==0:
evenNumbers.append(tempNumber)
print(*evenNumbers,) | 606721610a06ed5f41878b14a5fabb2876176862582ff945479b2d75be323666 |
code:018 | code | 18 | package com.company;
/**
* Created by Sagar on 10/09/2017.
*/
public class MultiplicationTable {
public static void main(String args[]) throws Exception {
Scanner sc = new Scanner(System.in);
int n =sc.nextInt();
for(int i=1;i<=10;i++)
{
System.out.print("\t"+i+"\t... | 1967793640c1bad781b81ea8fcf29064bce5739145012844d009674becbcd1ac |
code:019 | code | 19 | class Solution():
def minDepth(root):
if root is None:
return 0
if root.left is None and root.right is None:
return 1
if root.left is None:
return 1 + minDepth(root.right)
if root.right is None:
return 1 + minDepth(roo... | 63b1ab93ad56f5c5e5791715ed557e37a02e46927870e41489923ff5cadddcf7 |
code:020 | code | 20 | import pandas as pd
from sklearn import linear_model
df = pd.read_csv('/content/drive/MyDrive/Colab Notebooks/Netflix Dataset.csv') # read dataset into dataframe
X = df[['release_year','runtime','rating']] # features matrix
y = df['revenue'] # target vector
regressor = linear_model.LinearRegression() # in... | 9e1711ec5412d1f0b903876bc778493eb2b7866bb7e16d8c2b2af801edd24a88 |
code:021 | code | 21 | class Rectangle():
def __init__(self,width,height):
self.__width=width;self.__height=height;
@property
def width(self):
return self.__width
@property
def height(self):
return self.__height
def getArea(self):
return (... | 9419f070496a469c6f8b956f1370a5148d1ec183805ab92db1ecf754ec3adf2a |
code:022 | code | 22 | import math
# Function returns True if num is Palindrome otherwise False
def checkPalindromeNumber(num):
# Converting Number to String
strNum = str(num);
lengthOfStrNum = len(strNum)
# If Length Of String Is Even Then Check From Middle Character To End And Reverse Word Else Do Not Change
... | 7b4e0a978e730e6ddc5850d9ab8d8d596796a353e2aac556867bb0211265d801 |
code:023 | code | 23 | import re
# Complete the substrCount function below.
def substrCount(n, s):
count = 0
startPos = endPos = None
pattern = r'[aeiou]'
for m in re.finditer(pattern, s):
if startPos!=None and endPos!=None:
if ((m.star... | a6af280342804e49df296f3ce51601476288554b2cc9f315ef5f59bf8811a0e0 |
code:024 | code | 24 | from pyspark import SparkContext
sc = SparkContext("local", "First App")
# Load and parse the data
data = sc.textFile("/home/ubuntu/Desktop/ml-latest-small/ratings.csv").map(lambda x:x.split(",")).cache()
header = data.first()
data = data.filter(lambda row:(row!= header))
movies = data.map(lambda p:[p[1],p[2]])
users =... | a323a0a79b56ec0b66fac94697e202f01dc19a37e0e14d948b25c8e953935450 |
code:025 | code | 25 | romanNumerals={1:'I', 4:'IV', 5:'V',9:'IX',10:'X',40:'XL',50:'L',90:'XC',100:'C',400:'CD',500:'D',900:'CM',1000:'M'}
def convertRomanToDecimal(numberString):
decimalNumber=0
index=0
while index<len(numberString)-1:
firstDigit=romanNumerals[int(numberString[index]+numberString[index+1])]
secon... | b6d3742200abe52f674114fcd7110da7e66633b943de80879857ae802766647c |
code:026 | code | 26 | def fibo_series():
f1 = 0
f2 = 1
count = int(input())
res = ""
for _ in range(count - 1):
temp = f1
f1 = f2
f2 = temp + f2
res += str(f1)+"\n"
return res[:-1]
print(fibo_series()) | 12ab63bd54acfb8960813ac752d2a9bd1d24cff5094d8dcc12ba4cacdc462111 |
code:027 | code | 27 | class Solution:
def coinChange(self, coins: List[int], amount: int) -> int:
dp=[amount+1]*(amount+1)
dp[0]=0
for j in range(1,amount+1):
minCoins=dp[-j]
for k in coins:
if j>=k:
minCoins=min(minCoins,dp[j-k]+1)
... | e6135dd6cae2bf77906da7f247425b95b484621af2fb6984a4f91661ad970a7d |
code:028 | code | 28 | import string
import secrets
# define all possible chars
chars = string.ascii_letters + string.digits + "!@#$%^&*()-+"
while True:
# generate secret key
generated_key = ''.join(secrets.choice(chars) for i in range(8))
if len(set(generated_key)) < 3:
continue
break
print("Genera... | 77a93bc1047709879fa5bd056f8ca33559e8e0f75c1f0f1d4ae494c94190df04 |
code:029 | code | 29 | def getCostOfManufacture(materialsNeededDict, numWorkersPerMaterialType):
costs = {materialName: round(((numWorkers * preparationTime)/workerSpeed), 2)
for ((materialName, numWorkers), preparationTime)
in zip(materialsNeededDict.items(), preparationsTimes)}
return sum(costs.... | c0305ff8f73dbc6434f4258ce7dbd2134e61ccc1cc325ed409a75ca406ca6867 |
code:030 | code | 30 | def checkPalindromicNumber(num):
numStr=""+str(num)#convert to str
revNum=""
for char in range((len(numStr))//2,-1,-1):
revNum+=numStr[char]#reverse
if revNum==numStr:
return True
return False
if __name__ == '... | 605d0d917cd0987af0a86f165610005c1f77479bc422a4e101bece2bb3e5b174 |
code:031 | code | 31 | from collections import defaultdict
def findLongestSubstringWithoutRepeatingCharacters(str):
# Fill this in.
d={}
start=-1
end=-1
maxLength=float('-inf')
for i in range(len(str)):
c= str[i]
if c in d:
start=max(start,d[c])
d[c]=i
currentM... | 77254ee34730863aa01915a78395248041274fd85ddf2e2651931a5c979d6e7e |
code:033 | code | 33 | def fibonacciSequenceGenerator(number):
if number == 0:
yield 0
elif number <= 2:
yield 1
else:
previousNumber = 1
currentNumber = 1
for counter in range(2, number):
nextNumber = previousNumber + currentNumber
previousNumber = curr... | 6f4f44b95c8f4abdb7b669c4e4265b8eaf7cd1b9bd0677542c57e6d2c4963e21 |
code:034 | code | 34 | import math
celsius = [0, -273.15, 100, 40, 15, 10, 0]
fahrenheit = []
# Use map() to apply a lambda expression over each element in celsius[]
fahrenheit = list(map(lambda x : round((((x * 9) / 5) + 32)), celsius))
# Print out value using format method
for i in range(len(celsius)):
print("{} degree Celcius is {}... | 25935bb01ec5053a0348774ad325d15642f2ca86f7a056495dfc705652858395 |
code:036 | code | 36 | import numpy as np
np.random.seed(None)
class Solution:
def generateRandomWords(self, dictSize, minLen, maxLen, count):
# Generate Random Words From Dictionary
randDict = self._generateRandDict(dictSize, minLen, maxLen)
# Select Count Random Words
selectedWords = self._sele... | bcd31faf7cb4e5e7ff182cd795cb35136f337ae39cbec6d2f142a465f62c0f36 |
code:037 | code | 37 | number=-12345;
reverseNum="";
while abs(number)!=0:
remainder=abs(number)%10;
reverseNum=remainder+reverseNum;
number/=10;
if number<0:
reverseNum="-"+reverseNum;
print "\nReverse Value Of %d Is:%s\n"%(number,reverseNum) | e609fdeba1ed5aa3f37210348081dfc3bc7a00b65eaf0a697e8b4f773ee1b44a |
code:038 | code | 38 | def longestSubstringBetweenKAndLCharacters(string,k,l):
maxLength = float('-inf')
subString=''
for i in range(len(string)):
tempSubStr = ''
j = i
currLength = 0
while j < min([len(string),i+l]):
tempSubStr+=string[j]
... | 05638a0a9132771425e0bc44287f38bb63a058fae75b66b94a74f03b4def2b41 |
code:039 | code | 39 | class Rect():
def __init__(self, lenghth,width ):
self.__length=lenght
self.__width=width
@property
def getLength(self):
return self.__length
@getLength.setter
def setLenth(self,value):
self.__length=value
@property
def getWidth(self):
return self.__wi... | 5bad104c5e3c26eb78066d71630c9089b4ee27bd64d2ab0c601a9fa056d30236 |
code:040 | code | 40 | def findVowelsOrConsonantsInString(inputString:str)->list:
vowels=['a','e','o','u'];
result=[];
for letter in inputString:
if letter in vowels:
result.append("vowel");
else:
result.append("consonant");
return result;
findVowelsOrConsonantsInString("Hello wor... | 3a6bde10b1f82767ac7b85594ff494f8100451971fc4e2020f1ac682062245fb |
code:043 | code | 43 | import math
from operator import truediv
# Function to calculate result from operation
def calc_result():
try:
num1 = float(num1_entry.get())
op = oper_entry.get()
num2 = float(num2_entry.get())
res = ""
if op == "+":
res = str... | 361917f40327199b79889c6df7a0aacc1a8ac1ebd78714ae7610bdaafa630eda |
code:044 | code | 44 | import operator
from functools import reduce
class Calculator:
def calculate(self, expression ):
tokens = map(str.strip,expression.split(','))
ops = {'+' :operator.add, '-' :operator.sub, '*' :operator.mul }
return str(reduce(ops['*' ],map(lambda token:token if token!='-' else '-1',tokens... | 737548b7a2804a1e0d28c10c5de1b61421227c69bc69162687af0fbed574017f |
code:045 | code | 45 | class Stack{
private final int[] arr;
public int top=-1;//top points to last element inserted
public Stack(final int capacity){//constructor
this.arr=new int[capacity];
}//end constructor
public boolean isEmpty(){
return top==-1?true:false;
}//end isEmpty
public int size(){
... | 23ee12fe580041d067c557849902aa434883a7f0e45792554bfeb70c94ef55a8 |
code:046 | code | 46 | def reverseInteger(x):
sign = ''
if x >= 0:
sign = '+'
else:
sign = '-'
x *= (-1)
revX = []
while x > 9:
digit = x % 10
revX.append(digit)
x //= 10
revX.append(int(str(sign)+''.join(map(str,revX))))
return revX[-1]
reverseInteger(-123) | 0c04fb1bafe99249c1db67d99917400aea2a7723361d10e542056811f2d7cd5d |
code:047 | code | 47 | import sys
def lcs(X, Y, m, n ):
# table[m+1][n+1]
LCSuff[m+1][n+1]= [None]*(m+1);
""" Following steps build L[m+1 x n+1] in bottom
up fashion. Note that L[i][j] contains length
of LCS of X[0..i-1] and Y[0..j-1]."""
for i in range(m+1):
for j in range(n+1):
... | ce112345614d76193961a58a3743a6040cdef7f2f8215801ac7944b0a447df75 |
code:048 | code | 48 | from random import randint
suits=['Heart','Diamond','Club','Spade']
ranks=['A', 'K', 'Q', 'J', 'T', '9', '8', '7', '6', '5', '4', '3', '2' ]
deck=[]
for suit in suits:
for rank in ranks:
card={'suit':suit,'rank':rank}
deck.append(card)
random.shuffle(deck)
print('Shuffled Deck:') ... | d3d045e4471b0f256eaab0dd4309ba49e703d9a33f56ab8dbe78cfed1fed5ec4 |
code:049 | code | 49 | function OddNumberFromToN(n){
var arr=[];
//loop through array using for loop
for(var i=1;i<=n;i++){
//if condition satisfies push element into array
if((i%2)!=0){
arr.push(i);
}
}
console.log("Odd Numbers From To N",arr);
}
//call above function passing value as argument... | 79fe8329c9c4f45dda328210c2b3b54a417950c5190e24f251e4a15f480b978c |
code:050 | code | 50 | dict={1:'one',2:'two'}
minValue=float('-inf'); maxValue= float('+inf')
for key in dict:
minValue=min(key,minValue)
maxValue=max(key,maxValue)
difference=maxValue-minValue
print(f'Difference Between Max And Min Value:{difference}') | 0c2c5b137c0b369ec0a95500ef42fad436628b4888465805e3e600c7f6dba129 |
code:052 | code | 52 | class StackUsingArray {
final int MAXSIZE = 100;
int topOfStack=-1;//top of stack pointer
int []stackArr={};//actual stack array
/* Constructor */
public StackUsingArray(){
stackArr =new int[MAXSIZE];
}
/** Push element onto stack*/
public void push(int value){
if((to... | 9d0166c07fa1659e2acb2d5fa72fb3f4ef50ebb28775e584efa0b0d2362734c2 |
code:054 | code | 54 | class Student():
def __init__(self, rollno, name, marks):
self.__rollno = rollno
self.__name = name
self.__marks = marks
@property
def RollNo(self):
return str(self.__rollno).zfill(8)
@property
def Name(self):
return self.__name
@property
def Marks(... | 1b9026397c84d45cb3ecb6b4f08c392ae35166103e64a03dfb38ed5b9ae61c0e |
code:055 | code | 55 | class Calculator:
def __init__(self,*args,**kwargs):
self.__numbers=list(*args)
pass
@property
def numbers(self)->tuple:
return tuple([float(_f) for _f in self.__numbers])
def summation(self):
return sum(self.numbers)
def substraction(self):
... | bbfcd07fd0a182f766ae0ae91e0f6edc89c5675cd4cccef287e610e437789f2e |
code:056 | code | 56 | def isPrime(num):
if num <= 1 :
return "Not Prime"
elif num < 9:
return ("Prime Number")
else:
for x in range(2,int((num/2)+1)):
if ((num %x)==0):
return "Not Prime"
return "Prime Number"
if __name__=="__main__":
num = int(input("Enter a number... | 8aec2d7eba66ba7e1eac7b4cd2078720ea18c46c8a455aa1b61133ce116f980f |
code:057 | code | 57 | import pandas as pd
df = pd.read_csv("netflix_titles.csv") # read csv into dataframe df
print("\n",df["show_id"].unique()[0:5],"...\n")# display first five rows of column "show id"
print("\n",len(df),"rows x ",len(df.columns)," columns \n")# number of rows & columns in dataset | 21a71037a8516fdf180dc5df844dadb262b204c92974f0c19aa4290ac8903b0b |
code:058 | code | 58 | import re
def validateIpAddr(ipaddr):
ipPattern="^(?:(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.){3}(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)$"
matchObject=re.match(ipPattern,ipaddr)
if matchObject!= None:
return True
else:
return False | 2e1b27c838818cbb01dce3d6bb0dcdfc6ff09a931bb9e7b6924d17b19841e96d |
code:059 | code | 59 | def multiplyWithoutMultiplyOperator(a,b):
result=0
# Iterate till b becomes zero
while b > 0:
# If odd then add a with carry
if b % 2 == 1:
result += a
# Addition of above step with previous summation
temp = ((result&a)<<1)+(result^a);
# Update a after adding its double... | 24a8c13bc22fe11fc963fc41c739f41edab24851cffb0fb133968c25188a8d8c |
code:060 | code | 60 | from dataclasses import dataclass
@dataclass
class City:
name: str
lat: float
lon: float
pop: int #population
area: int #area in km^2
neighbours=[] #list of neighbouring cities
city1=City("London",51.5,-0.1,8615246,156190);
city2=City("Paris",48.85,2.35,2249975,105110);
city3=City("New Yor... | 4b3735767c8a11ac4dcea23bee7067712c971644f70a94a8c35d534372f1b9e8 |
code:061 | code | 61 | def has_n(string, char):
count=0
for letter in string:
if letter==char:
count += 1
if count == len(string)-count+1 :
return True
else:
return False
has_n('<NAME>', 'l'); | 30b649d47dd7949d753d69d17d9b242f19474d2e058dff1d02df9e8e5ffcf588 |
code:064 | code | 64 | def check_substring(string1, string2):
# Iterate through all characters of first string
for i in range (len(string1)):
j = 0
# Check if pattern character matches with string
# starting from index 'i'
while (j < len(string2)):
if (string1[i]!= string2... | 9d3e2e81fd049b0b37e10eab60a41b866999169a8127a9d7bfd22f240a57402f |
code:065 | code | 65 | # Definition for a Node.
class Node:
def __init__(self, val=" ", left=None, right=None):
self.val = val
self.left = left
self.right = right
def get_longest_path(rootNode)->str:
# Base Case - Leaf Nodes
if rootNode.left is None and rootNode.right is None :
return st... | c5701c3b1bef8bf63f4dddbc622b8c5c4a57ab8622164879951c933306f05107 |
code:066 | code | 66 | def evalRPN(tokens):
st=[]
op=['+', '-', '*', '/'];
for tkn in tokens:
try:
val=int(tkn)
st.append(val)
except ValueError:
b=st[-1]
a=st[-2]
st.remove(a)
st.remove(b)
res=eval(str(a)+tkn+str(b))
s... | 03fac6bf54e65e74dc9370e5337c93a7b558b37110eedec2915474cb838be3de |
code:067 | code | 67 | import math
def checkPalindromicNumber(n):
# Converting n to String
s = str(n)
l = len(s)//2
# Checking Palindromicity
flag = True
for i in range(l + 1):
if int(s[-i])!= int(s[i]):
flag = False
return flag
def... | f3e6645a5437e6948c0f21e87d2927c83893376e0e48e221239ab79da2f4caac |
code:068 | code | 68 | def checkDuplicateChar(strg):
# Initialize empty dictionary
freqMap = {}
# Traverse through entire string
for key in strg:
# Increment frequency map
freqMap[key] = freqMap.get(key, 0) + 1
# Traverse through keys of frequency map
for val in fr... | 0e2758066df8d96f00d933bb4f65f6daca6ae34ba8bea8a4c67dafff24c01c9a |
code:069 | code | 69 | # Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution():
def checkBalanced(self, root):
# Fill out your logic here!
height=self._getHeight(root)-1
return True if abs(h... | d567adfbe063731f4644ef369cdc8fb5c2d671e0b2106a7157edf750a99b5954 |
code:072 | code | 72 | class Student():
def __init__(self,_name,_rollno,_marks):
self.__name=_name;
self.__rollno=_rollno;
self.__marks=_marks;
@property
def marks(self):
return self.__marks
@marks.setter
def marks(self,newmark):
self.__marks=newmark
@property
def rollno(self):
return self.... | a7b3f64e4f6fe57e63118b88bfcb325b26a541e9adfad666c0094aafab74f073 |
code:074 | code | 74 | class Solution():
def checkPermutation(self,s,t):
if len(set([*s,*t]))!= (len(s)*2):
return False
else:
return sorted(list(s+t))==sorted(list((s+t)))
if __name__=='__main__':
solu=Solution()
s='hello'
t='lllohe'
ans=sol... | 2c03f57edd9e000b006e353eda61cf26600124f4042846def831166f8cb7bf06 |
code:075 | code | 75 | WITH empInfo AS (SELECT FirstName, LastName, Salary FROM Employee)
SELECT ei.firstName, ei.lastName, ei.salary, m.firstname mgrFirstname,m.lastname mgrLastName FROM EmpInfo ei LEFT OUTER JOIN Manager m ON ei.ManagerSSN=m.managerSSN; | 66e69e93c47188abe1847baa90adc79122f031fc0e2202c1f4a921d85919ec06 |
code:076 | code | 76 | def isprime(number):
if number > 1:
for n in range(2,int(math.sqrt(number))+1):
if number%n==0:
break
else:
return True
else:
return False
print ('Is Prime? ',end='')
userInput = eval(input())
result = isprime(userInput)
if result == True:
print ("True... | f054861474bf31c9b72fec253e72a0df4a67e806705dbc0d8e8fd0dead68ee0e |
code:078 | code | 78 | from collections import Counter
S=input()
c=Counter([x for x in S])
print(*(list(map(str,(c['a'], c['b'],c['c'],c['d'],c['e'],c['f'],c['g'],c['h'],c['i'],c['j'],c['k'],c['l'],c['m'],c['n'],c['o'],c['p'],c['q'],c['r'],c['s'],c['t'],c['u'],c['v'],c['w'],c['x'],c['y'],c['z']))))) | 8972121cf426f2f0daf4082525f7d07af900cdc45dfec62ab34007e0ee54b253 |
code:079 | code | 79 | from collections import deque
# Stack implementation using Queue
class MyStack:
q1 = deque([])
# Push element x onto stack
def push(self,x):
self.q1.append(x)
# Removes the element on top of the stack
def pop(self):
size = len(self.q1)
while size > 1... | 77afb44ec4fa38dabc1a9f16276dce2a91a3d9397f950291c35f5038bb836e37 |
code:080 | code | 80 | def checkIfAllCharactersOccurEvenNumberOfTimesExceptOneCharacter(str):
freq={}
for ch in str:
if ch in freq:
freq[ch]+=1
else:
freq[ch]=1
flag=False
for key,value in freq.items():
... | 81d6ada22ebefad76d60a6b7df0076ac363a1cf576fa5dbd87d0aad45516b2e1 |
code:081 | code | 81 | def oneEditDistance(S,T):
m=len(S);n=len(T)
diff=m+n-abs(m-n)
if (diff>1):
return False
flag=False
#if lengths differ by more than 1 character,
#then check if first characters match
#(this step reduces problem size bc... | f33dc53b89664ceec0d66ed628dbefd770b252d5a673d48cea1a88d75972f023 |
code:082 | code | 82 | import math
n = int(input("Enter number "))
for num in range(1,n+1):
if num > 1:
for i in range(2,num//2):
if (num % i)==0:
break
else:
print(num) | 66b102aad815a7e12e40dbd919bcc6cecaad3cb67d0c008508486a3b8da69bd3 |
code:084 | code | 84 | from itertools import groupby
def getMaxConsecutiveOnesCount(binaryNumberSequence):
countOfMaxConsecutiveOnes = []
indexFirstOccurrence =[]
indexLastOccurrence =[]
for key,group in groupby(binaryNumberSequence):
tempGroup = ''.join(map(str,list(group)))
coun... | b0cff111b0aa49b534adf77a42a24b1cbd498b144c1ede3156c71d7f0d9db0ae |
code:085 | code | 85 | import pandas as pd
df = pd.DataFrame({'ProjectID': ["ABC","DEF"],
'HoursSpentOnCoding': [10, 20]})
df["Total"] = df["HoursSpentOnCoding"].apply(lambda x: float("{0:.2f}".format((float(x)/8))))
df["Percentage"] = round(((df["Total"])/(df["Total"].sum())) * 100).astype(str)+'%'
df[['ProjectID',"HoursS... | df219b2ee85d730881b4bc4c3c4f9b19306ec64113f4c6d4567bc353a7f178f6 |
code:086 | code | 86 | def generateMatrix(rows):
if int(rows)==int():
raise Exception('Rows Must Be Integer Value.')
elif float().is_integer() == False :
raise Exception('Rows Must Be An Integer Value.')
else:
mtrx=[]
for i in range(int()):
row=[i+j*int()+1 for j in range()]
mtrx.append(row)
r... | e1ee381c21b41cc5898e29298484d89039cc58451bfd8b26f8e16479547aa0fe |
code:087 | code | 87 | import random,string #Importing Random module and String Module
length=int(raw_input("Enter Password Length Between 8 To 16 Characters:")) #Taking Input From User Of Desired Password Length
while True:
if ((length>=8)&(length<=16)):
break;
else:
length=int(raw_input("Invalid Choice! Enter Again"))
... | eded65b21d53fc2b2ac0ca19b47379a7256ce13a59000a5c74cbd7481f1900aa |
code:088 | code | 88 | # Class definition
class Rectangle():
# Constructor
def __init__(self, leng, breth):
self.__length = leng
self.__breath = breth
# Method to calculate Area
def get_area(self):
return self.__length*self.__breath
# Method to calculate Perimeter
def get_perimeter(self):
retur... | d3dfef0f26bbebb14349b22ae0edf39c91e849264636b43328af4d1cc40d6ecf |
code:090 | code | 90 | capitalizeWord = (word)=>{
if(!(typeof word ==='string')){throw Error("Invalid Argument")}
if(word===''){ throw Error("Empty String")}
if(/[^a-zA-Z]/gi.test(word)){throw Error("Non Alphabetic Characters Found")}
return word.charAt(0).toUpperCase()+word.slice(1)
} | c898ac39b0003669b8f30fb6281cffeed4dd3a2a495e6adc26a9c5cfdf52a02a |
code:091 | code | 91 | import collections
class Stack:
def __init__(self):
self._stack = []
def push(self, value):
self._stack.append(value)
def peek(self):
return self._stack[-1]
def pop(self):
return self._stack.pop(-1)
def size(self):
return len(self._stack)
class ... | 5f57325907bec72445b8db5a9f211dac34eb5fd5ba675ae4a5df6516f29c5759 |
code:092 | code | 92 | def calculate(a,b,oprtr):
if oprtr=="add":
c=a+b
d=str(c)+" "+"+"+" "+ str(a)+","+" "+str(b)
return d
elif oprtr=="substract":
e=(a-b)
f=str(e)+" "+"-"+" "+ str(a)+","+" "+str(b)
return f
if __name__=="__main__":
n1=float(input('Enter First ... | 1ec7e4935f99118953ce1004fd3c2e20323f7742ea75c5c66ba50fb6924bc28f |
code:093 | code | 93 | function findMissingElement(arr) {
// Write your code here.
let len = arr.length+1;
const rangeArr = Array.from({length :len},(_,index)=> index).slice(1)//[1,2,...n], n=rangeArr.length
console.log("Range Arr",rangeArr,"Length:",len,'\n')//[1,2,...,n]
return [...new Set(rangeArr)].filter((ele)=>(... | 4208975a906ae6ea6cb22bd9aa9170237763cb19b894a769a9c252c33c2fd322 |
code:094 | code | 94 | def primeNumbersLessThanN(n):
primes=[]
for p in range(2,n):
flag=False
for q in range(2,(p//2)):
if((p%q)==0):
break
else:
flag=True
if(flag==True):
primes.append(p)
return primes
primes=primeNumbersLessThanN(100)
pr... | 2f23b1500ff27f7286a4b4df30060e59ed1843e27553955cec0ab245758446a5 |
code:095 | code | 95 | first_name = raw_input("Enter your first name:")
middle_initial = raw_input("Enter your Middle Initial:")
last_name = raw_input("Enter Your Last Name")
full_name = str(first_name)+" "+str(middle_initial+"."+" ")+" "+str(last_name)
print full_name | 93a210f37d0dc6f15ded6cfd9ddd34c4306ec6e07da6b67d77a0afa6b8aa6c96 |
code:096 | code | 96 | import itertools
def getPairsSumToK(k, arr):
result = []
# Sort the Array so that smaller values are picked first
sortedArr = sorted(set(arr))
# Iterate through the array once again
for numA in sortedArr:
diffB = abs(numA - k)
# Since B must always be great... | 5113df7a20047484e43d288cee9b2d0416c1e1f885a6975463113f2c9bd1b6d3 |
code:097 | code | 97 | stringOne = input()
stringTwo = input()
sortedStringOne = ''.join(sorted(list(stringOne)))
sortedStringTwo = ''.join(sorted(list(stringTwo)))
if sortedStringOne!= sortedStringTwo:
print("Not Anagrams.")
else:
print("Anagrams!") | fbef708827007b3e90f824ae9e5d89501a70f4b0d9de65a1264d2be7061d3e48 |
code:098 | code | 98 | def gcd(m,n):
# Base Case
if m == n :
return m
elif m > n :
return gcd(m - n, n)
else :
return gcd(m, n - m)
if __name__=="__main__":
T = int(raw_input().strip())
while(T>0):
MN = raw_input().split()
... | 75ea3e21be04bb70f60f8a23a30b3a13ebd99451cc9ec944964c07ec103158f6 |
code:099 | code | 99 | class Person():
# Constructor method
def __init__(self,name,age ):
self.__name = name
self.__age = age
# Setter methods
@property
def Name(self):
return self.__name
@Name.setter
def Name(self, value):
self.__name =value
@property ... | 301a004261828e9e3a881691a9229889565737f6afc3dd7a138f5d19cc9d966e |
code:100 | code | 100 | def getSum(lst):
s = 0
for x in lst:
s+=x
return s
# Driver Code
lst=[int(ele) for ele in input().split()]
print ("The Sum Of Elements In List Is:",getSum(lst)) | f46388e6fe48b76261df841b0cc1e18448ee91f31dbec936b9e6d3f6f92379a8 |
code:101 | code | 101 | # Recursive Function to calculate Factorial
def fact(x):
if x == 1:
return 1
elif x > 1:
return (x * fact(x - 1))
num = int(input())
print("Factorial of", num,"is ", end="")
print(fact(num)) | a069297bc0ec1057ac00249b43a0b530f2a56224d807a9cc9b36bc670d15466d |
code:102 | code | 102 | class person:
def __init__ (self,*args,**kwargs):
super().__init__(*args,**kwargs);
self._name="";
self._age=-1;
self._gender="NA";
self._country="India";
def setName(self,_name):
self._name=_name;
def getName(self):
return self._name;
def setAge(s... | 48b13ea7ab242f4db6bbaf0df7cea9e7e5160c053ba9975250b90093c4048e04 |
code:103 | code | 103 | def GCD(num_one, num_two):
"""Return the greatest common denominator between `num_one` and `num_two`."""
# Base Case
if num_one < num_two:
temp = num_one
num_one = num_two
num_two = temp
# Recursive case
difference = abs(num_one - num_two)
if difference!= 0:
... | d5380c925648c00a6ae600cec4225d91eb947d4604259b8a3b0d898bd910a25e |
code:105 | code | 105 | import pandas as pd
fibonacciNumbers=[]
for i in range(N+1):
if i==0 |i==1:
fibonacciNumbers.append(i)
elif i>1:
fibonacciNumbers.append(fibonacciNumbers[-1]+fibonacciNumbers[-2])
pd.DataFrame({'Fibonacci Numbers':fibonacciNumbers}).head(N) | 3c53b6d5abfa1ca6c6fb470f1338f94d0f7d37031396c77c34cee1ec974efb72 |
code:106 | code | 106 | # Function to print all Prime Numbers smaller than or equal to N
def findPrimesUptoN(n):
# Create a boolean array "prime[0..n]" and initialize
# all entries it as true. A value in prime[i] will finally
# be false if i is Not a prime, else True.
p= [True]*(n+1)
p[0]=p[1]=False
... | 7d88a6373c61d5256e5e150b2edee9e9b3bda234e8e23dd71e68f3495198b7a4 |
code:107 | code | 107 | class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class Solution:
def reverseIterative(headNode : 'ListNode'):
prev_node = headNode
curr_node = headNode.next
while curr_node!= None:
tempNext = c... | 5540da78a203f6278ff1cecd7e8c4c99f88ed22f8dc9f32620d41f475a7e9528 |
code:108 | code | 108 | import string
string.ascii_lowercase
def checkPangram(sentence):
alpha = {chr(x).lower() for x in range(ord('A'), ord('Z') + 1)}
s = ''
for ch in sentence:
if chr(ch).isalpha():
s += chr(ch).lower()
return bool(set(alpha) <= set(s))
checkPangram("... | cf1b66053ff5907be1883a358487050493036d93f2bf1ff29916d98a38f9830a |
code:109 | code | 109 | import secrets
import string
alphabet = string.ascii_letters
digits = string.digits
symbols = '!@#$%^&*'
all = ''.join(secrets.choice(alphabet + digits + symbols))
password = "".join(secrets.sample(all, 8)).replace('\n','').strip()
print ("Password: {}".format(password)) | 52ac608c6a79cf49a32da5cb27bbae53d8d39c8c39484f8f30ea9cc9bd73559c |
code:111 | code | 111 | def check_permutation(str1, str2):
# If length of both strings is different then they
# cannot be permutations
if len(str1)!=len(str2):
return False
# Count frequency of all characters from first string
freq = {}
for ch in str1 :
# Increment character count only w... | bc3ce099f4db8b2e0d0c72b6713248a57d311e37c1f848a5a10da6660a1283f1 |
code:113 | code | 113 | import re
paragraph = 'The quick brown fox jumps over the lazy dog.'
word = 'the'
count = len([m.start() for m in re.finditer('\\b'+re.escape(word)+'\\b', paragraph)])
print(f"Word '{word}' appears {count} time{'s'*(count > 1)} in the provided paragraph.") | 9baf4c840df15f4a1dd03f0419e4282105ac9502453694224ed2dccde611026d |
code:115 | code | 115 | class Solution:
def restoreIpAddresses(self, s: str) -> List[str]:
ans=[]
self.helper([],s,ans)
return ans
# helper function which takes prefix as parameter alongwith remaining part of ipaddress
def helper(self,prefix,ipaddr,ans):
# base case when length of... | b5a82e16a999918c8d750117bbedeb7109939e2a72528358a05c1930f9a67963 |
code:117 | code | 117 | Yield statements are used to pause execution until next time they’re called. When resumed, the generator resumes right after last executed line. Yield statements are useful whenever you want to iterate over something but don't know exactly how much iterations need to occur beforehand. | d0a8b890afdc460564ee85bd3ba453daf92ac9b596271f501d5e3d546e8609be |
code:118 | code | 118 | def count_substring(string,sub_string):
count=start=0
while start<len(string):
pos=string.find(sub_string,start)
if pos!=-1:
count+=1
start=pos+1
else:break
return count
count_substring("abcda","a") | 510e9b6664873e596c447fb7bf0e2998de9bccda723db38a886255abda18219a |
code:119 | code | 119 | from collections import Counter
# Function to check if there
# is any permutation of str2[]
# in str1[]. This function mainly
# uses count()
def searchAnagram(str1, str2):
# Create counter objects
cntStr1 = Counter(str1)
cntStr2 = Counter(str2)
# Check if every character of
... | b8dc5e6a18f12ceeb959006d6710b1f2180704b6b8b26d5f04e0aa6db336631c |
code:121 | code | 121 | # Function to get all combination of size k out of N elements
import itertools as itertool
def getAllCombinationsOfSizeKOutofNElements(k, n):
result=[]
def helper(arr, index, data, k, n ):
if len(data) == k:
result.append([item for item in arr])
return
... | a17ca3dcbcf16fc0511d8b7efe97e7d410519fb9a9b5bd46f65e312e038276e6 |
code:122 | code | 122 | for letterA in ['a','b','c']:
print('a'+letterA+'*', end='') # prints abc*, ab*, ac*, b*, c*
for letterB in ['a','b','c']:
print('ab'+letterB+'*',end='')#prints abca*, abcb*,...
for letterC in ['a','b','c']:
print('abc'+letterC+'*',end='')#prints abcac*,...
print... | 71abef3e83ffc96ccb0f0fe736f0745a038e8e7e82b4a9d8dc34de341b0958cb |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 12