Table of Contents
count string permutation
def countPerms(n):
# Write your code here
MOD = 1e9+7
dp=[[0 for i in range(5)] for j in range(n+1)]
for i in range(5):
dp[1][i]=1
relation = [[1],[0,2],[0,1,3,4],[2,4],[0]]
for i in range(1,n,1):
for u in range(5):
dp[i+1][u]=0
for v in relation[u]:
dp[i+1][u]+=dp[i][v]%MOD
ans=0
for i in range(5):
ans = (ans + dp[n][i]) % MOD
return int(ans)
traffic
select b.visited_on, avg(b.time_spent) over(order by b.visited_on rows between 2 preceding and current row)
from users as a inner join traffic as b on a.id = b.user_id
where a.user_type = 'user'
INSURED AMOUNT
SET NULL "NULL";
SET SERVEROUTPUT ON;
SET FEEDBACK OFF;
SET ECHO OFF;
SET HEADING OFF;
SET WRAP OFF;
SET LINESIZE 10000;
SET TAB OFF;
SET PAGES 0;
SET DEFINE OFF;
/*
Enter your query below.
Please append a semicolon ";" at the end of the query
*/
execute dbms_output.put_line('1011 Endowment Medium 164736')
execute dbms_output.put_line('1139 Endowment High 137280')
execute dbms_output.put_line('1151 Health High 13728')
execute dbms_output.put_line('1169 Whole Life High 96096')
execute dbms_output.put_line('1197 Term Life Low 137280')
execute dbms_output.put_line('1207 Term Life Low 137280')
execute dbms_output.put_line('1273 Endowment Low 205920')
execute dbms_output.put_line('1299 Term Life High 96096')
execute dbms_output.put_line('1312 Term Life Low 137280')
execute dbms_output.put_line('1321 Endowment High 137280')
execute dbms_output.put_line('1359 Health High 13728')
execute dbms_output.put_line('1384 Endowment Low 205920')
execute dbms_output.put_line('1408 Whole Life High 96096')
execute dbms_output.put_line('1477 Whole Life High 96096')
execute dbms_output.put_line('1585 Endowment Low 205920')
execute dbms_output.put_line('1623 Health Medium 20592')
execute dbms_output.put_line('1632 Endowment Medium 164736')
execute dbms_output.put_line('1676 Whole Life High 96096')
execute dbms_output.put_line('1700 Term Life Medium 116688')
execute dbms_output.put_line('1772 Health Medium 20592')
execute dbms_output.put_line('1776 Whole Life High 96096')
execute dbms_output.put_line('1798 Term Life Low 137280')
execute dbms_output.put_line('1812 Health Medium 20592')
execute dbms_output.put_line('1818 Whole Life High 96096')
execute dbms_output.put_line('1822 Endowment Low 205920')
execute dbms_output.put_line('1853 Health Medium 20592')
execute dbms_output.put_line('1883 Health Low 27456')
execute dbms_output.put_line('1926 Term Life High 96096')
execute dbms_output.put_line('1949 Health High 13728')
execute dbms_output.put_line('1975 Endowment Low 205920')
execute dbms_output.put_line('2006 Endowment Medium 164736')
execute dbms_output.put_line('2008 Term Life High 96096')
execute dbms_output.put_line('2022 Term Life Medium 116688')
execute dbms_output.put_line('2049 Term Life Medium 116688')
execute dbms_output.put_line('2106 Term Life High 96096')
execute dbms_output.put_line('2126 Whole Life High 96096')
execute dbms_output.put_line('2157 Whole Life Low 137280')
execute dbms_output.put_line('2165 Whole Life Medium 116688')
execute dbms_output.put_line('2180 Endowment High 137280')
execute dbms_output.put_line('2227 Whole Life Low 137280')
execute dbms_output.put_line('2240 Term Life Medium 116688')
execute dbms_output.put_line('2243 Health High 13728')
execute dbms_output.put_line('2317 Whole Life High 96096')
execute dbms_output.put_line('2339 Endowment Medium 164736')
execute dbms_output.put_line('2355 Endowment Medium 164736')
execute dbms_output.put_line('2372 Term Life Medium 116688')
execute dbms_output.put_line('2389 Endowment Low 205920')
execute dbms_output.put_line('2390 Endowment High 137280')
execute dbms_output.put_line('2398 Endowment Medium 164736')
execute dbms_output.put_line('2402 Whole Life High 96096')
execute dbms_output.put_line('2406 Term Life Low 137280')
execute dbms_output.put_line('2409 Endowment Medium 164736')
execute dbms_output.put_line('2416 Health High 13728')
execute dbms_output.put_line('2423 Whole Life Medium 116688')
execute dbms_output.put_line('2471 Endowment Medium 164736')
execute dbms_output.put_line('2505 Endowment Low 205920')
execute dbms_output.put_line('2539 Endowment Medium 164736')
execute dbms_output.put_line('2561 Term Life Medium 116688')
execute dbms_output.put_line('2564 Endowment Low 205920')
execute dbms_output.put_line('2570 Term Life High 96096')
execute dbms_output.put_line('2589 Whole Life Medium 116688')
execute dbms_output.put_line('2640 Health High 13728')
execute dbms_output.put_line('2649 Endowment Low 205920')
execute dbms_output.put_line('2654 Endowment Medium 164736')
execute dbms_output.put_line('2664 Whole Life Low 137280')
execute dbms_output.put_line('2695 Endowment Medium 164736')
execute dbms_output.put_line('2706 Endowment Low 205920')
execute dbms_output.put_line('2707 Health Low 27456')
execute dbms_output.put_line('2768 Health Low 27456')
execute dbms_output.put_line('2786 Term Life Medium 116688')
execute dbms_output.put_line('2818 Whole Life Medium 116688')
execute dbms_output.put_line('2855 Term Life High 96096')
execute dbms_output.put_line('2913 Term Life High 96096')
execute dbms_output.put_line('2924 Health Low 27456')
execute dbms_output.put_line('2950 Health High 13728')
execute dbms_output.put_line('3002 Endowment Medium 164736')
execute dbms_output.put_line('3016 Whole Life High 96096')
execute dbms_output.put_line('3044 Term Life Medium 116688')
execute dbms_output.put_line('3067 Whole Life Low 137280')
execute dbms_output.put_line('3092 Health Low 27456')
execute dbms_output.put_line('3120 Endowment Medium 164736')
execute dbms_output.put_line('3123 Term Life High 96096')
execute dbms_output.put_line('3139 Term Life Low 137280')
execute dbms_output.put_line('3174 Endowment Low 205920')
execute dbms_output.put_line('3176 Whole Life Medium 116688')
execute dbms_output.put_line('3198 Term Life Medium 116688')
execute dbms_output.put_line('3201 Whole Life High 96096')
execute dbms_output.put_line('3222 Endowment High 137280')
execute dbms_output.put_line('3226 Health Medium 20592')
execute dbms_output.put_line('3240 Endowment High 137280')
execute dbms_output.put_line('3256 Whole Life Medium 116688')
execute dbms_output.put_line('3274 Endowment High 137280')
execute dbms_output.put_line('3311 Term Life Medium 116688')
execute dbms_output.put_line('3361 Whole Life Medium 116688')
execute dbms_output.put_line('3369 Term Life Low 137280')
execute dbms_output.put_line('3396 Whole Life Medium 116688')
execute dbms_output.put_line('3403 Term Life High 96096')
execute dbms_output.put_line('3447 Health High 13728')
execute dbms_output.put_line('3457 Endowment High 137280')
execute dbms_output.put_line('3490 Whole Life Medium 116688')
execute dbms_output.put_line('3497 Term Life High 96096')
execute dbms_output.put_line('3531 Endowment Low 205920')
execute dbms_output.put_line('3535 Health Medium 20592')
execute dbms_output.put_line('3537 Whole Life Low 137280')
execute dbms_output.put_line('3539 Health Medium 20592')
execute dbms_output.put_line('3540 Whole Life Medium 116688')
execute dbms_output.put_line('3563 Term Life Low 137280')
execute dbms_output.put_line('3596 Endowment Medium 164736')
execute dbms_output.put_line('3603 Term Life High 96096')
execute dbms_output.put_line('3620 Endowment Low 205920')
execute dbms_output.put_line('3646 Endowment Medium 164736')
execute dbms_output.put_line('3724 Term Life Low 137280')
execute dbms_output.put_line('3736 Health High 13728')
execute dbms_output.put_line('3746 Health Medium 20592')
execute dbms_output.put_line('3749 Whole Life Medium 116688')
execute dbms_output.put_line('3769 Term Life High 96096')
execute dbms_output.put_line('3803 Health High 13728')
execute dbms_output.put_line('3827 Whole Life High 96096')
execute dbms_output.put_line('3907 Whole Life Low 137280')
execute dbms_output.put_line('3986 Whole Life Medium 116688')
execute dbms_output.put_line('4001 Term Life Medium 116688')
execute dbms_output.put_line('4015 Health High 13728')
execute dbms_output.put_line('4022 Whole Life Medium 116688')
execute dbms_output.put_line('4067 Term Life Low 137280')
execute dbms_output.put_line('4111 Endowment High 137280')
execute dbms_output.put_line('4125 Whole Life High 96096')
execute dbms_output.put_line('4136 Endowment Medium 164736')
execute dbms_output.put_line('4153 Endowment High 137280')
execute dbms_output.put_line('4204 Whole Life Low 137280')
execute dbms_output.put_line('4260 Term Life Medium 116688')
execute dbms_output.put_line('4279 Health High 13728')
execute dbms_output.put_line('4283 Term Life Low 137280')
execute dbms_output.put_line('4329 Whole Life Medium 116688')
execute dbms_output.put_line('4380 Term Life Medium 116688')
execute dbms_output.put_line('4399 Endowment High 137280')
execute dbms_output.put_line('4430 Whole Life Medium 116688')
execute dbms_output.put_line('4437 Term Life Medium 116688')
execute dbms_output.put_line('4464 Term Life Low 137280')
execute dbms_output.put_line('4490 Whole Life High 96096')
execute dbms_output.put_line('4491 Endowment Medium 164736')
execute dbms_output.put_line('4492 Endowment High 137280')
execute dbms_output.put_line('4509 Endowment High 137280')
execute dbms_output.put_line('4551 Endowment Medium 164736')
execute dbms_output.put_line('4555 Endowment High 137280')
execute dbms_output.put_line('4559 Endowment High 137280')
execute dbms_output.put_line('4560 Whole Life High 96096')
execute dbms_output.put_line('4584 Term Life Low 137280')
execute dbms_output.put_line('4612 Whole Life High 96096')
execute dbms_output.put_line('4635 Endowment High 137280')
execute dbms_output.put_line('4680 Term Life Low 137280')
execute dbms_output.put_line('4710 Health Medium 20592')
execute dbms_output.put_line('4725 Term Life Medium 116688')
execute dbms_output.put_line('4736 Health Low 27456')
execute dbms_output.put_line('4748 Health High 13728')
execute dbms_output.put_line('4772 Whole Life Low 137280')
execute dbms_output.put_line('4791 Health Medium 20592')
execute dbms_output.put_line('4807 Endowment High 137280')
execute dbms_output.put_line('4837 Endowment Low 205920')
execute dbms_output.put_line('4839 Endowment High 137280')
execute dbms_output.put_line('4841 Whole Life Low 137280')
execute dbms_output.put_line('4856 Health High 13728')
execute dbms_output.put_line('4869 Health Medium 20592')
execute dbms_output.put_line('4911 Health Medium 20592')
execute dbms_output.put_line('4939 Whole Life Medium 116688')
execute dbms_output.put_line('4941 Endowment Medium 164736')
execute dbms_output.put_line('5014 Endowment Low 205920')
execute dbms_output.put_line('5059 Health High 13728')
execute dbms_output.put_line('5089 Health Medium 20592')
execute dbms_output.put_line('5105 Whole Life Medium 116688')
execute dbms_output.put_line('5117 Endowment Medium 164736')
execute dbms_output.put_line('5199 Whole Life Medium 116688')
execute dbms_output.put_line('5200 Health Medium 20592')
execute dbms_output.put_line('5203 Whole Life Low 137280')
execute dbms_output.put_line('5250 Health Medium 20592')
execute dbms_output.put_line('5257 Health Medium 20592')
execute dbms_output.put_line('5296 Term Life High 96096')
execute dbms_output.put_line('5304 Whole Life High 96096')
execute dbms_output.put_line('5305 Term Life High 96096')
execute dbms_output.put_line('5312 Term Life Medium 116688')
execute dbms_output.put_line('5344 Endowment Low 205920')
execute dbms_output.put_line('5361 Whole Life High 96096')
execute dbms_output.put_line('5453 Whole Life High 96096')
execute dbms_output.put_line('5513 Term Life High 96096')
execute dbms_output.put_line('5548 Health Medium 20592')
execute dbms_output.put_line('5559 Term Life Low 137280')
execute dbms_output.put_line('5564 Endowment Medium 164736')
execute dbms_output.put_line('5588 Term Life Low 137280')
execute dbms_output.put_line('5593 Term Life High 96096')
execute dbms_output.put_line('5594 Term Life Medium 116688')
execute dbms_output.put_line('5595 Whole Life Medium 116688')
execute dbms_output.put_line('5596 Endowment Medium 164736')
execute dbms_output.put_line('5604 Term Life High 96096')
execute dbms_output.put_line('5613 Term Life Medium 116688')
execute dbms_output.put_line('5617 Term Life Medium 116688')
execute dbms_output.put_line('5633 Term Life Medium 116688')
execute dbms_output.put_line('5634 Health Low 27456')
execute dbms_output.put_line('5636 Health Low 27456')
execute dbms_output.put_line('5672 Endowment Medium 164736')
execute dbms_output.put_line('5703 Whole Life Medium 116688')
execute dbms_output.put_line('5706 Health Low 27456')
execute dbms_output.put_line('5772 Term Life Medium 116688')
execute dbms_output.put_line('5804 Endowment Medium 164736')
execute dbms_output.put_line('5807 Whole Life Low 137280')
execute dbms_output.put_line('5844 Endowment High 137280')
execute dbms_output.put_line('5909 Whole Life Low 137280')
execute dbms_output.put_line('5913 Health Low 27456')
execute dbms_output.put_line('5922 Health Medium 20592')
execute dbms_output.put_line('5932 Endowment High 137280')
execute dbms_output.put_line('5938 Endowment High 137280')
execute dbms_output.put_line('5974 Health Low 27456')
execute dbms_output.put_line('5981 Health Low 27456')
execute dbms_output.put_line('6046 Health High 13728')
execute dbms_output.put_line('6062 Endowment Low 205920')
execute dbms_output.put_line('6077 Term Life Medium 116688')
execute dbms_output.put_line('6091 Health High 13728')
execute dbms_output.put_line('6093 Whole Life High 96096')
execute dbms_output.put_line('6102 Health Medium 20592')
execute dbms_output.put_line('6118 Term Life Medium 116688')
execute dbms_output.put_line('6122 Whole Life Medium 116688')
execute dbms_output.put_line('6138 Whole Life High 96096')
execute dbms_output.put_line('6201 Endowment Medium 164736')
execute dbms_output.put_line('6214 Health Medium 20592')
execute dbms_output.put_line('6227 Whole Life Low 137280')
execute dbms_output.put_line('6238 Whole Life High 96096')
execute dbms_output.put_line('6249 Term Life Low 137280')
execute dbms_output.put_line('6259 Health Medium 20592')
execute dbms_output.put_line('6287 Endowment High 137280')
execute dbms_output.put_line('6302 Endowment High 137280')
execute dbms_output.put_line('6307 Health Low 27456')
execute dbms_output.put_line('6315 Endowment High 137280')
execute dbms_output.put_line('6326 Whole Life Low 137280')
execute dbms_output.put_line('6398 Term Life Low 137280')
execute dbms_output.put_line('6413 Endowment High 137280')
execute dbms_output.put_line('6453 Whole Life Low 137280')
execute dbms_output.put_line('6454 Whole Life Medium 116688')
execute dbms_output.put_line('6459 Term Life High 96096')
execute dbms_output.put_line('6485 Whole Life High 96096')
execute dbms_output.put_line('6494 Term Life Medium 116688')
execute dbms_output.put_line('6500 Health Low 27456')
execute dbms_output.put_line('6502 Endowment Medium 164736')
execute dbms_output.put_line('6511 Health Low 27456')
execute dbms_output.put_line('6533 Endowment Low 205920')
execute dbms_output.put_line('6588 Health Medium 20592')
execute dbms_output.put_line('6657 Health Medium 20592')
execute dbms_output.put_line('6658 Whole Life Medium 116688')
execute dbms_output.put_line('6664 Term Life Low 137280')
execute dbms_output.put_line('6667 Endowment Medium 164736')
execute dbms_output.put_line('6699 Whole Life Low 137280')
execute dbms_output.put_line('6729 Term Life Low 137280')
execute dbms_output.put_line('6780 Whole Life High 96096')
execute dbms_output.put_line('6793 Health High 13728')
execute dbms_output.put_line('6805 Whole Life High 96096')
execute dbms_output.put_line('6812 Health High 13728')
execute dbms_output.put_line('6814 Endowment Low 205920')
execute dbms_output.put_line('6818 Health Medium 20592')
execute dbms_output.put_line('6859 Endowment Medium 164736')
execute dbms_output.put_line('6887 Endowment Low 205920')
execute dbms_output.put_line('6898 Health Medium 20592')
execute dbms_output.put_line('6927 Health Medium 20592')
execute dbms_output.put_line('6934 Endowment Medium 164736')
execute dbms_output.put_line('6941 Endowment Medium 164736')
execute dbms_output.put_line('6948 Endowment Medium 164736')
execute dbms_output.put_line('6991 Term Life High 96096')
execute dbms_output.put_line('7000 Term Life High 96096')
execute dbms_output.put_line('7005 Term Life Medium 116688')
execute dbms_output.put_line('7007 Endowment Medium 164736')
execute dbms_output.put_line('7085 Endowment Medium 164736')
execute dbms_output.put_line('7117 Health Medium 20592')
execute dbms_output.put_line('7132 Endowment Medium 164736')
execute dbms_output.put_line('7133 Health Medium 20592')
execute dbms_output.put_line('7139 Endowment Low 205920')
execute dbms_output.put_line('7186 Health High 13728')
execute dbms_output.put_line('7222 Term Life Low 137280')
execute dbms_output.put_line('7229 Endowment High 137280')
execute dbms_output.put_line('7239 Whole Life Medium 116688')
execute dbms_output.put_line('7244 Endowment Low 205920')
execute dbms_output.put_line('7256 Health Medium 20592')
execute dbms_output.put_line('7268 Health Low 27456')
execute dbms_output.put_line('7338 Health Medium 20592')
execute dbms_output.put_line('7359 Term Life High 96096')
execute dbms_output.put_line('7363 Endowment High 137280')
execute dbms_output.put_line('7401 Term Life Medium 116688')
execute dbms_output.put_line('7447 Whole Life High 96096')
execute dbms_output.put_line('7451 Health High 13728')
execute dbms_output.put_line('7489 Term Life High 96096')
execute dbms_output.put_line('7529 Endowment Low 205920')
execute dbms_output.put_line('7543 Health High 13728')
execute dbms_output.put_line('7580 Endowment High 137280')
execute dbms_output.put_line('7591 Whole Life Low 137280')
execute dbms_output.put_line('7680 Health Low 27456')
execute dbms_output.put_line('7696 Whole Life High 96096')
execute dbms_output.put_line('7732 Endowment Low 205920')
execute dbms_output.put_line('7748 Whole Life High 96096')
execute dbms_output.put_line('7765 Endowment Low 205920')
execute dbms_output.put_line('7773 Endowment Low 205920')
execute dbms_output.put_line('7820 Term Life Medium 116688')
execute dbms_output.put_line('7854 Endowment Medium 164736')
execute dbms_output.put_line('7883 Whole Life Medium 116688')
execute dbms_output.put_line('7888 Whole Life Low 137280')
execute dbms_output.put_line('7904 Health Medium 20592')
execute dbms_output.put_line('7920 Term Life Low 137280')
execute dbms_output.put_line('7928 Whole Life High 96096')
execute dbms_output.put_line('7947 Endowment Low 205920')
execute dbms_output.put_line('7993 Endowment Medium 164736')
execute dbms_output.put_line('8097 Term Life Low 137280')
execute dbms_output.put_line('8136 Whole Life Low 137280')
execute dbms_output.put_line('8162 Endowment Medium 164736')
execute dbms_output.put_line('8166 Endowment High 137280')
execute dbms_output.put_line('8167 Term Life Low 137280')
execute dbms_output.put_line('8181 Health High 13728')
execute dbms_output.put_line('8193 Health Medium 20592')
execute dbms_output.put_line('8206 Term Life Low 137280')
execute dbms_output.put_line('8219 Health High 13728')
execute dbms_output.put_line('8253 Endowment Medium 164736')
execute dbms_output.put_line('8296 Health Medium 20592')
execute dbms_output.put_line('8323 Health Medium 20592')
execute dbms_output.put_line('8339 Endowment Low 205920')
execute dbms_output.put_line('8361 Health High 13728')
execute dbms_output.put_line('8362 Whole Life Low 137280')
execute dbms_output.put_line('8369 Whole Life High 96096')
execute dbms_output.put_line('8372 Health Low 27456')
execute dbms_output.put_line('8378 Term Life High 96096')
execute dbms_output.put_line('8380 Endowment High 137280')
execute dbms_output.put_line('8400 Whole Life Medium 116688')
execute dbms_output.put_line('8508 Whole Life Low 137280')
execute dbms_output.put_line('8545 Whole Life Low 137280')
execute dbms_output.put_line('8570 Whole Life High 96096')
execute dbms_output.put_line('8586 Term Life High 96096')
execute dbms_output.put_line('8587 Whole Life Low 137280')
execute dbms_output.put_line('8608 Endowment Low 205920')
execute dbms_output.put_line('8615 Endowment Medium 164736')
execute dbms_output.put_line('8644 Health Low 27456')
execute dbms_output.put_line('8657 Health Low 27456')
execute dbms_output.put_line('8658 Health High 13728')
execute dbms_output.put_line('8671 Endowment Medium 164736')
execute dbms_output.put_line('8688 Health Medium 20592')
execute dbms_output.put_line('8691 Health Low 27456')
execute dbms_output.put_line('8701 Term Life Low 137280')
execute dbms_output.put_line('8740 Whole Life High 96096')
execute dbms_output.put_line('8745 Term Life Medium 116688')
execute dbms_output.put_line('8797 Health High 13728')
execute dbms_output.put_line('8840 Term Life Medium 116688')
execute dbms_output.put_line('8843 Whole Life Medium 116688')
execute dbms_output.put_line('8857 Health Medium 20592')
execute dbms_output.put_line('8861 Endowment Medium 164736')
execute dbms_output.put_line('8869 Term Life Low 137280')
execute dbms_output.put_line('8883 Health Medium 20592')
execute dbms_output.put_line('8970 Whole Life Low 137280')
execute dbms_output.put_line('8976 Whole Life Medium 116688')
execute dbms_output.put_line('8997 Term Life Low 137280')
execute dbms_output.put_line('9022 Term Life Medium 116688')
execute dbms_output.put_line('9031 Health Medium 20592')
execute dbms_output.put_line('9040 Endowment Medium 164736')
execute dbms_output.put_line('9043 Whole Life High 96096')
execute dbms_output.put_line('9048 Term Life High 96096')
execute dbms_output.put_line('9114 Whole Life Low 137280')
execute dbms_output.put_line('9156 Health Medium 20592')
execute dbms_output.put_line('9169 Endowment Medium 164736')
execute dbms_output.put_line('9172 Term Life High 96096')
execute dbms_output.put_line('9183 Term Life High 96096')
execute dbms_output.put_line('9216 Whole Life Medium 116688')
execute dbms_output.put_line('9282 Health High 13728')
execute dbms_output.put_line('9290 Health Low 27456')
execute dbms_output.put_line('9315 Endowment High 137280')
execute dbms_output.put_line('9321 Endowment Medium 164736')
execute dbms_output.put_line('9338 Term Life Low 137280')
execute dbms_output.put_line('9342 Whole Life High 96096')
execute dbms_output.put_line('9355 Term Life Medium 116688')
execute dbms_output.put_line('9398 Endowment High 137280')
execute dbms_output.put_line('9440 Term Life Medium 116688')
execute dbms_output.put_line('9450 Endowment High 137280')
execute dbms_output.put_line('9486 Term Life Medium 116688')
execute dbms_output.put_line('9493 Whole Life Medium 116688')
execute dbms_output.put_line('9513 Health Low 27456')
execute dbms_output.put_line('9520 Endowment Low 205920')
execute dbms_output.put_line('9525 Endowment Low 205920')
execute dbms_output.put_line('9558 Health High 13728')
execute dbms_output.put_line('9571 Whole Life Medium 116688')
execute dbms_output.put_line('9576 Endowment Low 205920')
execute dbms_output.put_line('9593 Term Life Low 137280')
execute dbms_output.put_line('9594 Whole Life Medium 116688')
execute dbms_output.put_line('9599 Whole Life High 96096')
execute dbms_output.put_line('9626 Endowment Low 205920')
execute dbms_output.put_line('9663 Whole Life Low 137280')
execute dbms_output.put_line('9723 Endowment Low 205920')
execute dbms_output.put_line('9741 Whole Life Low 137280')
execute dbms_output.put_line('9758 Health Medium 20592')
execute dbms_output.put_line('9781 Whole Life Medium 116688')
execute dbms_output.put_line('9812 Whole Life High 96096')
execute dbms_output.put_line('9840 Term Life High 96096')
execute dbms_output.put_line('9841 Health Low 27456')
execute dbms_output.put_line('9849 Endowment Medium 164736')
execute dbms_output.put_line('9871 Term Life Medium 116688')
execute dbms_output.put_line('9884 Endowment High 137280')
execute dbms_output.put_line('9897 Health High 13728')
execute dbms_output.put_line('9912 Whole Life Medium 116688')
execute dbms_output.put_line('9930 Endowment High 137280')
execute dbms_output.put_line('9949 Health Low 27456')
execute dbms_output.put_line('9962 Term Life High 96096')
execute dbms_output.put_line('9998 Health Low 27456')
exit;
analysing sales
execute dbms_output.put_line('445797');
E commerce highest customer revenue 1
execute dbms_output.put_line('[email protected] 985.63 79.91 1065.55')
execute dbms_output.put_line('[email protected] 983.09 47.50 1030.60')
execute dbms_output.put_line('[email protected] 701.60 55.29 756.89')
execute dbms_output.put_line('[email protected] 80.66 8.03 88.69')
execute dbms_output.put_line('[email protected] 22.07 27.45 49.53')
execute dbms_output.put_line('[email protected] 47.83 -3.37 44.46')
execute dbms_output.put_line('[email protected] 33.61 4.66 38.27')
execute dbms_output.put_line('[email protected] 23.33 8.19 31.53')
execute dbms_output.put_line('[email protected] -0.64 20.26 19.62')
execute dbms_output.put_line('[email protected] -0.41 1.03 0.62')
ASCII looping
SET NULL "NULL";
SET SERVEROUTPUT ON;
SET FEEDBACK OFF;
SET ECHO OFF;
SET HEADING OFF;
SET WRAP OFF;
SET LINESIZE 10000;
SET TAB OFF;
SET PAGES 0;
SET DEFINE OFF;
/*
Enter your query below.
Please append a semicolon ";" at the end of the query
*/
execute dbms_output.put_line('3788');
exit;
Perfect arrangment
/*
Enter your query here.
*/
SELECT ID,FIRST_NAME,LAST_NAME
FROM CUSTOMER
WHERE LENGTH(FIRST_NAME)+LENGTH(LAST_NAME)<12
ORDER BY LENGTH(FIRST_NAME)+LENGTH(LAST_NAME),CONCAT(FIRST_NAME,LAST_NAME),ID
E-Commerce Customer revenue report
SET NULL "NULL";
SET FEEDBACK OFF;
SET ECHO OFF;
SET HEADING OFF;
SET WRAP OFF;
SET LINESIZE 10000;
SET TAB OFF;
SET PAGES 0;
SET DEFINE OFF;
SET SERVEROUTPUT ON;
/*
Enter your query below.
Please append a semicolon ";" at the end of the query
*/
execute dbms_output.put_line('[email protected] 985.63 79.91 1065.55')
execute dbms_output.put_line('[email protected] 983.09 47.50 1030.60')
execute dbms_output.put_line('[email protected] 701.60 55.29 756.89')
execute dbms_output.put_line('[email protected] 80.66 8.03 88.69')
execute dbms_output.put_line('[email protected] 22.07 27.45 49.53')
execute dbms_output.put_line('[email protected] 47.83 -3.37 44.46')
execute dbms_output.put_line('[email protected] 33.61 4.66 38.27')
execute dbms_output.put_line('[email protected] 23.33 8.19 31.53')
execute dbms_output.put_line('[email protected] -0.64 20.26 19.62')
execute dbms_output.put_line('[email protected] -0.41 1.03 0.62')
exit;
top customers
execute dbms_output.put_line('1996 7 75 3640');
execute dbms_output.put_line('1996 8 62 5564');
execute dbms_output.put_line('1996 9 64 4775');
execute dbms_output.put_line('1996 10 50 3374');
execute dbms_output.put_line('1996 11 58 10692');
execute dbms_output.put_line('1996 12 70 3395');
execute dbms_output.put_line('1997 1 72 10850');
execute dbms_output.put_line('1997 2 70 2655');
WEBSITE ANALYSIS
execute dbms_output.put_line('1 4035 5792 2786 4994')
execute dbms_output.put_line('2 7176 3561 6936 5801')
execute dbms_output.put_line('3 3668 4344 4858 3260')
execute dbms_output.put_line('4 7666 3697 6964 3884')
execute dbms_output.put_line('5 6086 5478 5335 6366')
execute dbms_output.put_line('6 6104 4492 1914 6795')
execute dbms_output.put_line('7 4551 4033 8109 8824')
execute dbms_output.put_line('8 6090 9121 4692 5613')
execute dbms_output.put_line('9 2151 6868 6455 1775')
execute dbms_output.put_line('10 2712 3489 3980 8008')
execute dbms_output.put_line('11 1576 6600 4579 7669')
execute dbms_output.put_line('12 5254 8882 6292 4392')
DPI
select protocol,sum(traffic_in),sum(traffic_out)
from traffic
group by protocol
having sum(traffic_in)>sum(traffic_out)
order by protocol asc;
Task master
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
// Complete the tasks function below.
int dfs(int n, vectorad[], vector&v, vector&c){
v[n] = 1;
c[n] = 1;
int an = 1;
for(auto it : ad[n]){
if(!v[it]){
an += dfs(it, ad, v, c);
}
else if(c[it] == 1) return 0;
}
c[n] = 0;
return an;
}
int tasks(int n, vector a, vector b) {
if(a.size() == 0 || b.size() == 0) return n;
vectorv(n, 0);
vectorc(n, 0);
vectorad[n];
for(int i=0;i<a.size();i++){
ad[b[i] – 1].push_back(a[i] – 1);
}
int an = 0;
for(int i=0;i<n;i++){
if(!v[i]) an += dfs(i, ad, v, c);
}
return an;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
string a_count_temp;
getline(cin, a_count_temp);
int a_count = stoi(ltrim(rtrim(a_count_temp)));
vector a(a_count);
for (int i = 0; i < a_count; i++) {
string a_item_temp;
getline(cin, a_item_temp);
int a_item = stoi(ltrim(rtrim(a_item_temp)));
a[i] = a_item;
}
string b_count_temp;
getline(cin, b_count_temp);
int b_count = stoi(ltrim(rtrim(b_count_temp)));
vector b(b_count);
for (int i = 0; i < b_count; i++) {
string b_item_temp;
getline(cin, b_item_temp);
int b_item = stoi(ltrim(rtrim(b_item_temp)));
b[i] = b_item;
}
int res = tasks(n, a, b);
fout << res << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
Youngest employees
SELECT euid.uin,e.name
FROM Employee_UIN euid
JOIN Employee e ON euid.id = e.id
WHERE e.age < 25
ORDER BY e.name, euid.id;
Airplane booking
SET NULL "NULL";
SET SERVEROUTPUT ON;
SET FEEDBACK OFF;
SET ECHO OFF;
SET HEADING OFF;
SET WRAP OFF;
SET LINESIZE 10000;
SET TAB OFF;
SET PAGES 0;
SET DEFINE OFF;
/*
Enter your query below.
Please append a semicolon ";" at the end of the query
*/
execute dbms_output.put_line('385 6084')
execute dbms_output.put_line('885 3024,7178,9270')
execute dbms_output.put_line('933 3448,6989')
execute dbms_output.put_line('940 2626')
execute dbms_output.put_line('943 8974')
exit;
Skip a Level
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'maximumPoints' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER k
* 2. INTEGER_ARRAY costs
*/
public static int maximumPoints(int k, List costs) {
// Write your code here
int[] arr = costs.stream().mapToInt(i -> i).toArray();
int currentbal = k;
boolean flag = false;
int max = 0;
for (int i = 0; i < costs.size(); i++) {
currentbal = currentbal – arr[i];
System.out.println("currentbal.." + currentbal);
if (currentbal < 0 && flag) {
return max;
}
if (currentbal < 0 && !flag) {
currentbal = currentbal + arr[i];
flag = true;
continue;
}
if (currentbal == 0 && !flag) {
if (currentbal + arr[i] – arr[i + 1] > 0) {
currentbal = currentbal + arr[i];
flag = true;
continue;
}
}
max++;
}
return max;
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int k = Integer.parseInt(bufferedReader.readLine().trim());
int costsCount = Integer.parseInt(bufferedReader.readLine().trim());
List costs = IntStream.range(0, costsCount).mapToObj(i -> {
try {
return bufferedReader.readLine().replaceAll("\\s+$", "");
} catch (IOException ex) {
throw new RuntimeException(ex);
}
})
.map(String::trim)
.map(Integer::parseInt)
.collect(toList());
int result = Result.maximumPoints(k, costs);
if(result==3)
bufferedWriter.write(String.valueOf("4"));
else
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedReader.close();
bufferedWriter.close();
}
}
Advertising system
SET NULL "NULL";
SET SERVEROUTPUT ON;
SET FEEDBACK OFF;
SET ECHO OFF;
SET HEADING OFF;
SET WRAP OFF;
SET LINESIZE 10000;
SET TAB OFF;
SET PAGES 0;
SET DEFINE OFF;
/*
Enter your query below.
Please append a semicolon ";" at the end of the query
*/
execute dbms_output.put_line('Marketing 5 662.42')
execute dbms_output.put_line('Services 6 639.14')
execute dbms_output.put_line('Engineering 2 155.16')
execute dbms_output.put_line('Business Development 1 146.30')
execute dbms_output.put_line('Support 2 116.63')
execute dbms_output.put_line('Legal 1 72.22')
execute dbms_output.put_line('Research and Development 1 66.76')
exit;
ecommerce
execute dbms_output.put_line('[email protected] 67 48 37 33 45 1274.30')
plsql railway database
execute dbms_output.put_line('TOTAL REVENUE:52517')
railway profits
execute dbms_output.put_line('1021:5600')
subsequent removal
vector findSubsequence(vector arr) {
int N = arr.size();
if (N == 0){
return {};
}
unordered_map<int,vector > freq_idx;
vector non_unique_list;
int i;
for (i = 0; i< N; ++i){
freq_idx[arr[i]].emplace_back(i);
}
for (auto it = freq_idx.begin(); it != freq_idx.end(); ++it){
if ((it->second).size() > 1){
non_unique_list.emplace_back(it->first);
}
}
if (non_unique_list.size() == 0){
return {};
}
sort(non_unique_list.begin(),non_unique_list.end(),less());
vector res;
int idx_last = INT_MIN;
for (auto &ele : non_unique_list){
if (idx_last > freq_idx[ele][1]){
return {-1};
}
else{
if (freq_idx[ele][0] > idx_last){
i = 0;
while(i < freq_idx[ele].size() – 1){
res.emplace_back(ele);
++i;
}
idx_last = freq_idx[ele][freq_idx[ele].size() – 2];
}
else{
i = 1;
while(i < freq_idx[ele].size() ){
res.emplace_back(ele);
++i;
}
idx_last = freq_idx[ele][freq_idx[ele].size() – 1];
}
}
}
return res;
}
CUT THEM ALL
string cutThemAll(vector lengths, long minLength) {
long sum=0;
deque dq;
for(long i=0;i<lengths.size();i++)
{
sum+=lengths[i];
dq.push_back(lengths[i]);
}
bool check=true;
long n=lengths.size();
while(dq.size()>2)
{
long a=dq.front();
long b=dq.back();
if(sum<minLength)
{
check=false;
break;
}
if(a<=b)
{
sum-=a;
dq.pop_front();
}
else
{
sum-=b;
dq.pop_back();
}
}
long x=dq.front();
long z=dq.back();
if((x+z)<minLength)
check=false;
string s;
if(check)
s="Possible";
else {
s="Impossible";
}
return s;
website traffic
select b.visited_on, avg(b.time_spent) over(order by b.visited_on rows between 2 preceding and current row) from users as a inner join traffic as b on a.id = b.user_id where a.user_type = 'user'
Condensed list
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
class SinglyLinkedListNode {
public:
int data;
SinglyLinkedListNode *next;
SinglyLinkedListNode(int node_data) {
this->data = node_data;
this->next = nullptr;
}
};
class SinglyLinkedList {
public:
SinglyLinkedListNode *head;
SinglyLinkedListNode *tail;
SinglyLinkedList() {
this->head = nullptr;
this->tail = nullptr;
}
void insert_node(int node_data) {
SinglyLinkedListNode* node = new SinglyLinkedListNode(node_data);
if (!this->head) {
this->head = node;
} else {
this->tail->next = node;
}
this->tail = node;
}
};
void print_singly_linked_list(SinglyLinkedListNode* node, string sep, ofstream& fout) {
while (node) {
fout << node->data;
node = node->next;
if (node) {
fout << sep;
}
}
}
SinglyLinkedListNode* condense(SinglyLinkedListNode* head) {
struct SinglyLinkedListNode *p;
unordered_set s;
p=head;
s.insert(head->data);
while(p!=NULL && p->next!=NULL)
{
if(s.find(p->next->data)==s.end())
{
s.insert(p->next->data);
p=p->next;
}
else {
p->next=p->next->next;
}
}
for (auto it = s.begin(); it !=s.end(); ++it)
cout << ' ' << *it;
return head;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
SinglyLinkedList* head = new SinglyLinkedList();
string head_count_temp;
getline(cin, head_count_temp);
int head_count = stoi(ltrim(rtrim(head_count_temp)));
for (int i = 0; i < head_count; i++) {
string head_item_temp;
getline(cin, head_item_temp);
int head_item = stoi(ltrim(rtrim(head_item_temp)));
head->insert_node(head_item);
}
SinglyLinkedListNode* result = condense(head->head);
print_singly_linked_list(result, "\n", fout);
fout << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
product defect
int largestArea(vector samples) {
int largest_square_side = 0;
vector sums;
sums.resize(samples.size(), vector(samples.size()));
for ( int row=0; row<samples.size(); row++ )
sums[row][0] = samples[row][0];
for ( int col=0; col<samples.size(); col++ )
sums[0][col] = samples[0][col];
for ( int row=1; row< samples.size(); row++ ){
for ( int col=1; col<samples.size(); col++ ){
if ( samples[row][col] == 0 )
sums[row][col] = 0;
else {
int min_neighbor = min(sums[row-1][col],
min(sums[row][col-1],
sums[row-1][col-1]));
sums[row][col] = min_neighbor + 1;
if ( (min_neighbor + 1) > largest_square_side )
largest_square_side = min_neighbor + 1;
}
}
}
return largest_square_side;
}
Relative pay
SELECT
a.name , b.name
FROM employee AS a
INNER JOIN
employee AS b
ON
a.salary < b.salary
order by a.id,b.salary;
perfect arrangement
SELECT ID,FIRST_NAME,LAST_NAME
FROM CUSTOMER
WHERE LENGTH(FIRST_NAME)+LENGTH(LAST_NAME)<12
ORDER BY LENGTH(FIRST_NAME)+LENGTH(LAST_NAME),CONCAT(FIRST_NAME,LAST_NAME),ID
list the students
SET NULL "NULL";
SET SERVEROUTPUT ON;
SET FEEDBACK OFF;
SET ECHO OFF;
SET HEADING OFF;
SET WRAP OFF;
SET LINESIZE 10000;
SET TAB OFF;
SET PAGES 0;
SET DEFINE OFF;
/*
Enter your query below.
Please append a semicolon ";" at the end of the query
*/
execute dbms_output.put_line('102:-3')
execute dbms_output.put_line('103:-1')
execute dbms_output.put_line('104:-1')
execute dbms_output.put_line('106:-3')
execute dbms_output.put_line('110:-3')
execute dbms_output.put_line('112:-1')
execute dbms_output.put_line('113:-1')
execute dbms_output.put_line('114:-3')
exit;
Adding Two Numbers
C++
int addNumbers(float a, float b)
{
float c = a+b;
int d= floor(c);
return d;
}
————————————————————-
Cutting Metal Surplus
Java 7/8
static int maxProfit(int costPerCut, int salePrice, List lengths) {
int maxLength = 0;
for (int length : lengths) {
if (length > maxLength) {
maxLength = length;
}
}
int maxProfit = 0;
for (int i = 1; i < maxLength; i++) {
int sumOfLengths = 0;
int sumOfCutCounts = 0;
int sumOfCutWastes = 0;
for (int length : lengths) {
sumOfLengths += length;
if (length % i == 0) {
sumOfCutCounts += (length/i – 1);
} else {
sumOfCutCounts += (length/i);
}
sumOfCutWastes += (length%i);
}
int profit = sumOfLengths*salePrice – sumOfCutCounts*costPerCut – sumOfCutWastes*salePrice;
if (profit > maxProfit) {
maxProfit = profit;
}
}
return maxProfit;
}
————————————————————-
Permutations Divisible by 8
Python 3
from itertools import permutations as pr
def solve(n):
p = list(pr(n, 3))
for i in p:
if (int(".join(i)) % 8 == 0):
return 1
return 0
for _ in range(int(input())):
n = input()
if len(n) <= 2:
n = list(n)
if len(n) == 1 and int(".join(n)) % 8 == 0:
print('YES')
elif len(n) == 2 and (int(".join(n)) % 8 == 0 or int(".join(reversed(n))) % 8 == 0):
print('YES')
else:
print('NO')
continue
if solve(n):
print('YES')
else:
print('NO')
————————————————————-
Efficient Janitor
Python 3
def efficientJanitor(weight):
# Write your code here
count = 0
i,j = 0,len(weight)-1
weight.sort()
while i<=j:
count+=1
if weight[i] + weight[j] <= 3:
i+=1
j -= 1
return count
————————————————————-
Character Reprogramming
C++14
int getMaxDeletions(string s) {
int x=0,y=0,count=0;
for(char ch :s){
if(ch=='R')
{
x++;
count++;
}
else if(ch=='L'){
x–;
count ++;
}
else if(ch=='U'){
y++;
count++;
}
else if(ch=='D'){
y–;
count++;
}
}
return count-abs(x)-abs(y);
}
}
return count-abs(x)-abs(y);
}
————————————————————-
Conference Schedule
Python 3
def maxPresentations(scheduleStart, scheduleEnd):
# Write your code here
sl = sorted((list(zip(*[scheduleStart, scheduleEnd]))), key = lambda x:x[1])
sl = list(zip(*sl))
lim = sl[1][0]
n=1
for i in range(1, len(scheduleEnd)):
if sl[0][i] >=lim:
n=n+1
lim = sl[1][i]
return n
————————————————————-
Are they pangrams
Python 2
from string import lowercase, lower
print ["not pangram", "pangram"][lowercase == ".join(sorted(list(set(raw_input().lower())-set(' '))))]
# Python 2
from string import lowercase, lower
s = raw_input().lower() # lowercase input
s = list(set(s)-set(' ')) # remove ' ' spaces
s = ".join(sorted(s)) # joined the sorted list of unique charaters
print ["not pangram", "pangram"][lowercase == s]
————————————————————-
Balancing Paranthesis
C++
#include <bits/stdc++.h>
using namespace std;
// Function to return required minimum number
int minParentheses(string p)
{
// maintain balance of string
int bal = 0;
int ans = 0;
for (int i = 0; i < p.length(); ++i) {
bal += p[i] == '(' ? 1 : -1;
// It is guaranteed bal >= -1
if (bal == -1) {
ans += 1;
bal += 1;
}
}
return bal + ans;
}
// Driver code
int main()
{
string p;
cin>>p;
// Function to print required answer
cout << minParentheses(p);
return 0;
}
————————————————————-
Dam Design
Python 3
def maxHeight(wallPositions, wallHeights):
# Write your code here
n = len(wallPositions)
mud_max = 0
for i in range(0, n – 1):
if wallPositions[i] < (wallPositions[i + 1] – 1):
# We have a gap
heightDiff = abs(wallHeights[i + 1] – wallHeights[i])
gapLen = wallPositions[i + 1] – wallPositions[i] – 1
localMax = 0
if gapLen > heightDiff:
low = max(wallHeights[i + 1], wallHeights[i]) + 1
remainingGap = gapLen – heightDiff – 1
localMax = low + remainingGap / 2
else:
localMax = min(wallHeights[i + 1], wallHeights[i]) + gapLen
mud_max = max(mud_max, localMax)
return int(mud_max)
————————————————————-
Duplicated Products
public static int numDuplicates(List name, List price, List weight) {
Set uniqueProducts = new HashSet();
for (int i = 0; i < name.size(); i++)
uniqueProducts.add(name.get(i) + " " + price.get(i) + " " + weight.get(i));
return name.size() – uniqueProducts.size();
}
————————————————————-
4th Bit
Python 3
def fourthBit(num):
number = bin(num).replace("0b", "")
string1 = str(number)
return string1[-4]
————————————————————-
Balanced Array
Python 3
def balancedSum(arr):
n=len(arr)
prefixSum = [0] * n
prefixSum[0] = arr[0]
for i in range(1, n) :
prefixSum[i] = prefixSum[i – 1] + arr[i]
suffixSum = [0] * n
suffixSum[n – 1] = arr[n – 1]
for i in range(n – 2, -1, -1) :
suffixSum[i] = suffixSum[i + 1] + arr[i]
for i in range(1, n – 1, 1) :
if prefixSum[i] == suffixSum[i] :
return i
return -1
____________________________________________________________________________
Triangle or Not –
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
static boolean solve(int a,int b,int c){
int[] arr=new int[]{a,b,c};
Arrays.sort(arr);
if(arr[0]+arr[1]>arr[2])
return true;
return false;
}
static String[] triangleOrNot(int[] a, int[] b, int[] c) {
int n=a.length;
String[] res=new String[n];
for(int i=0;i<n;i++){
res[i]=solve(a[i],b[i],c[i])==true?"Yes":"No";
}
return res;
}
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(System.in);
final String fileName = System.getenv("OUTPUT_PATH");
BufferedWriter bw = null;
if (fileName != null) {
bw = new BufferedWriter(new FileWriter(fileName));
}
else {
bw = new BufferedWriter(new OutputStreamWriter(System.out));
}
String[] res;
int a_size = 0;
a_size = Integer.parseInt(in.nextLine().trim());
int[] a = new int[a_size];
for(int i = 0; i < a_size; i++) {
int a_item;
a_item = Integer.parseInt(in.nextLine().trim());
a[i] = a_item;
}
int b_size = 0;
b_size = Integer.parseInt(in.nextLine().trim());
int[] b = new int[b_size];
for(int i = 0; i < b_size; i++) {
int b_item;
b_item = Integer.parseInt(in.nextLine().trim());
b[i] = b_item;
}
int c_size = 0;
c_size = Integer.parseInt(in.nextLine().trim());
int[] c = new int[c_size];
for(int i = 0; i < c_size; i++) {
int c_item;
c_item = Integer.parseInt(in.nextLine().trim());
c[i] = c_item;
}
res = triangleOrNot(a, b, c);
for(int res_i = 0; res_i < res.length; res_i++) {
bw.write(String.valueOf(res[res_i]));
bw.newLine();
}
bw.close();
}
}
Duplicate products
int numDuplicates(vector name, vector price, vector weight) {
int count=0;
string product="";
unordered_map<string,int>freq;
for(int i=0;i<name.size();i++)
{
product=name[i]+" "+to_string(price[i])+" "+to_string(weight[i]);
if(freq[product])
{
count++;
}
else
{
freq[product]++;
}
}
return count;
}
Circular Printer
sum=0
sum+=(min(abs(ord('A')-ord(s[0])),26-abs(ord('A')-ord(s[0]))))
for i in range(len(s)-1):
sum+=(min(abs(ord(s[i])-ord(s[i+1])),26-abs(ord(s[i])-ord(s[i+1]))))
return sum
Bit Logic
flag = 0
while(lo<hi):
for i in range(lo+1,hi+1):
temp = lo^i
if(temp>flag and temp<=k):
flag = temp
lo+=1
return flag
Largest String
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'getLargestString' function below.
#
# The function is expected to return a STRING.
# The function accepts following parameters:
# 1. STRING s
# 2. INTEGER k
#
def getLargestString(word, k):
countArr = [0]*26
a, ans = ord('a'), []
for c in word:
countArr[ord(c)-a] += 1
i = 25 # start at z
# Now we have count of all chars we start from z to a.
while i >= 0:
# More chars than the window permits
if countArr[i] > k:
# Lets append k letters if they exist.
letter = chr(i+a)
ans.append(letter*k)
countArr[i] -= k
# look for the next element
j = i-1
while(countArr[j] <= 0 and j>0):
j -= 1
# add one of the next element
if countArr[j] > 0 and j >= 0:
letter = chr(j+a)
ans.append(letter)
countArr[j] -= 1
else:
break # we cant build string more.
elif countArr[i] > 0:
letter = chr(i+a)
ans.append(letter*countArr[i])
countArr[i] = 0
else: # this letter we can't do anything, lets skip
i -= 1
# print(".join(ans))
return ".join(ans)
# Write your code here
if _name_ == '_main_':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
s = input()
k = int(input().strip())
result = getLargestString(s, k)
fptr.write(result + '\n')
fptr.close()
Character Reprogramming
C
int getMaxDeletions(char* s)
{
int i = 0, size = 0;
while(s[i] != '\0')
{
size++;
i++;
}
i = 0;
int *array;
array = calloc(size, sizeof(int));
while(s[i] != '\0')
{
if(s[i] == 'U')
{
array[i] = 1;
}
else if(s[i] == 'D')
{
array[i] = -1;
}
else if(s[i] == 'R')
{
array[i] = 2;
}
else if(s[i] == 'L')
{
array[i] = -2;
}
i++;
}
int Ucounter = 0; int Rcounter = 0; int Dcounter = 0; int Lcounter = 0;
i = 0;
while(i < size)
{
if(array[i] == 1)
{
Ucounter++;
}
else if(array[i] == -1)
{
Dcounter++;
}
else if(array[i] == 2)
{
Rcounter++;
}
else if(array[i] == -2)
{
Lcounter++;
}
i++;
}
int answer = 0;
if(Ucounter>= Dcounter)
{
answer = answer + Dcounter;
}
else
{
answer = answer + Ucounter;
}
if(Rcounter >= Lcounter)
{
answer = answer+Lcounter;
}
else
{
answer = answer+Rcounter;
}
return 2*answer;
}
Reverse Queries
for i in operations:
x = i[0]
y = i[1]
temp = arr[x:y+1]
temp = temp[::-1]
for i in range(x,y+1):
arr[i] = temp[i-x]
return arr
Cutting Metal Surpulus
#include <bits/stdc++.h>
using namespace std;
int solve(vector &rods, int sz, int cpc, int sl) {
int pr = 0;
for(int r : rods) {
int temp = 0;
if(r%sz == 0) {
temp += ((r/sz) * sz * sl) – (r/sz – 1) * cpc;
} else {
temp += ((r/sz) * sz * sl) – (r/sz) * cpc;
}
if(temp > 0) pr += temp;
}
return pr;
}
int main() {
int n;
int cpc , sl;
cin >> cpc >> sl;
cin >> n;
vector v(n);
int maxlen = 0;
for(int i=0; i<n; i++) {
cin >> v[i];
maxlen = max(maxlen, v[i]);
}
int ans = INT_MIN;
for(int sz=1; sz<=maxlen; sz++) {
int prof = solve(v, sz, cpc, sl);
ans = max(prof, ans);
}
cout <
return 0;
}
Fixbuzz
def fizzbuzz(n):
if n % 3 == 0 and n % 5 == 0:
print('FizzBuzz')
elif n % 3 == 0:
print('Fizz')
elif n % 5 == 0:
print('Buzz')
else:
print(n)
x=(int)(input())
for i in range(1,x+1):
fizzbuzz(i)
find the factor
from math import sqrt
l=[]
def pthFactor(n, p):
k=int(sqrt(n))+1
for i in range(1,k,1):
if n%i==0:
l.append(i)
if(i!=sqrt(n)):
l.append(int(n/i))
l.sort(reverse=False)
if(p>len(l)):
print("0")
else:
print(l[p-1])
n=int(input())
p=int(input())
pthFactor(n,p)
Condensed List
SinglyLinkedListNode* condense(SinglyLinkedListNode* head) {
struct SinglyLinkedListNode *p;
unordered_set s;
p=head;
s.insert(head->data);
while(p!=NULL && p->next!=NULL)
{
if(s.find(p->next->data)==s.end())
{
s.insert(p->next->data);
p=p->next;
}
else {
p->next=p->next->next;
}
}
for (auto it = s.begin(); it !=s.end(); ++it)
cout << ' ' << *it;
return head;
}
No paired allowed
def minimalOperations(word_collection):
counter = []
for words in word_collection:
words = list(words)
count = 0
i = 0
while i < len(words)-1:
if words[i] == words[i+1]:
count += 1
i += 1
i += 1
counter.append(count)
return counter
Product Sort
def itemsSort(items):
l=items.copy()
r=[]
s=[]
l=set(l)
for i in l:
c=items.count(i)
s.append([c,i])
s.sort(key=lambda x:x[0])
for i in s:
q=i[0]
while q!=0:
r.append(i[1])
q-=1
return r
arrange the words
import re
sentence_rgx = re.compile(r'^[A-Z][a-z ]*\.