prasadsawant5 Goto Github PK

-alternating-characters

Shashank likes strings in which consecutive characters are different. For example, he likes ABABA, while he doesn't like ABAA. Given a string containing characters A and B only, he wants to change it into a string he likes. To do this, he is allowed to delete the characters in the string. Your task is to find the minimum number of required deletions.

activation_functions

aind-cv-facialkeypoints

aind-sudoku

appsflyer

bable-back-end

Back end for bable

car-tracking

chill

contrail-segmentation

deepfake-detection

DeepFake

dlss

dogs-vs-cats

eclass

edsr

esrgan

esrgan-tf2

ESRGAN (Enhanced Super-Resolution Generative Adversarial Networks, published in ECCV 2018) implemented in Tensorflow 2.0+. This is an unofficial implementation. With Colab.

face_generation

fcnd-backyard-flyer

fcnd-controls-cpp

fcnd-estimation-cpp

fcnd-motion-planning

find-digit

find-digits

Problem Statement You are given an integer N. Find the digits in this number that exactly divide N (division that leaves 0 as remainder) and display their count. For N=24, there are 2 digits (2 & 4). Both of these digits exactly divide 24. So our answer is 2. Note If the same number is repeated twice at different positions, it should be counted twice, e.g., For N=122, 2 divides 122 exactly and occurs at ones' and tens' position. So for this case, our answer is 3. Division by 0 is undefined. Input Format The first line contains T (the number of test cases), followed by T lines (each containing an integer N). Constraints 1≤T≤15 0<N<1010 Output Format For each test case, display the count of digits in N that exactly divide N in a separate line. Sample Input 2 12 1012 Sample Output 2 3 Explanation 2 digits in the number 12 divide it exactly. The first digit, 1, divides it exactly in twelve parts, and the second digit, 2 divides 12 equally in six parts. 1 divides 1012 exactly (and it occurs twice), and 2 also divides it exactly. Division by 0 is undefined, therefore it will not be counted.

fintech

first-neural-network

football-api

game_review

guest_prediction

halloween-party

Problem Statement Alex is attending a Halloween party with his girlfriend, Silvia. At the party, Silvia spots the corner of an infinite chocolate bar (two dimensional, infinitely long in width and length). If the chocolate can be served as only 1 x 1 sized pieces and Alex can cut the chocolate bar exactly K times, what is the maximum number of chocolate pieces Alex can cut and give Silvia? Input Format The first line contains an integer T, the number of test cases. T lines follow. Each line contains an integer K. Output Format T lines; each line should contain an integer that denotes the maximum number of pieces that can be obtained for each test case. Constraints 1≤T≤10 2≤K≤107 Note: Chocolate must be served in 1 x 1 sized pieces. Alex can't relocate any of the pieces, nor can he place any piece on top of another. Sample Input #00 4 5 6 7 8 Sample Output #00 6 9 12 16 Explanation The explanation below is for the first two test cases. The rest of them follow a similar logic. For the first test-case where K=5, you need 3 horizontal and 2 vertical cuts.

handshake

At the annual meeting of Board of Directors of Acme Inc, every one starts shaking hands with everyone else in the room. Given the fact that any two persons shake hand exactly once, Can you tell the total count of handshakes?