-
Kafka Binary files : http://kafka.apache.org/downloads.html
-
Atleast 2 AWS machines : AWS EMR or EC2 will be preferable
-
A Kafka Manager Utility to watch up the Cluster : https://cwiki.apache.org/confluence/display/KAFKA/Ecosystem
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package streaming | |
import ( | |
"bufio" | |
"fmt" | |
"io" | |
"log" | |
"os" | |
) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<iostream> | |
#include<cstring> | |
using namespace std; | |
int main() | |
{ | |
int t,i=0; | |
cin>>t; | |
while(i<t){ | |
int n; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import "fmt" | |
type bst struct { | |
rootValue int | |
leftNode *bst | |
rightNode *bst | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def minion_game(string): | |
# your code goes here | |
kevin = 0 | |
stuart = 0 | |
for i in range(0,len(string)): | |
if string[i] in ['A','E','I','O','U']: | |
kevin += len(string)-i | |
else: | |
stuart += len(string)-i | |
if kevin == stuart: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def removeOccuranceFromList(val, lst): | |
return list(filter((val).__ne__, lst)) | |
#struat start with constant | |
def struatMinnion(word): | |
totalCount = 0 | |
vowel = ['A','E','I','O','U'] | |
finalList = [word[i:j] for i in range(len(word)) for j in range(i,len(word)+1) if word[i] not in vowel and word[i:j] != ''] | |
#print("Struat ", finalList) | |
for value in finalList: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import "fmt" | |
//Create prototype | |
//LL container which going to store list | |
type LL struct { | |
list *linklist | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def getLongestNumber(number): | |
binSize = str(len(bin(number))-2) | |
finalStringPrint = ("%"+binSize+"s %"+str(binSize) | |
+"s %"+str(binSize)+"s %"+str(binSize)+"s") | |
return finalStringPrint | |
def print_formatted(number): | |
printStateMent = getLongestNumber(number) | |
#print(printStateMent) | |
for i in range(0,number): |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import ( | |
"context" | |
"fmt" | |
"github.com/go-redis/redis/v8" | |
) | |
var ( |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if __name__ == '__main__': | |
n = int(input()) | |
student_marks = {} | |
for _ in range(n): | |
name, *line = input().split() | |
scores = list(map(float, line)) | |
student_marks[name] = scores | |
query_name = input() | |
print("{0:.2f}".format(sum(student_marks[query_name])/len(student_marks[query_name]))) |
NewerOlder