Are you over 18 and want to see adult content?
More Annotations
![A complete backup of minyakdhabpower.blogspot.com](https://www.archivebay.com/archive2/fae7b90c-21ee-4b2c-bfbc-688ecb58cea3.png)
A complete backup of minyakdhabpower.blogspot.com
Are you over 18 and want to see adult content?
![A complete backup of iainabernethy.co.uk](https://www.archivebay.com/archive2/fdc7b45f-71a3-45b8-a723-68ba6c2acf30.png)
A complete backup of iainabernethy.co.uk
Are you over 18 and want to see adult content?
![A complete backup of lesraffineurs.com](https://www.archivebay.com/archive2/b3de2619-cf2e-49e7-a5eb-7928af67ed57.png)
A complete backup of lesraffineurs.com
Are you over 18 and want to see adult content?
![A complete backup of ladypopular.com.hr](https://www.archivebay.com/archive2/386996a3-9fab-4db2-857b-afe3eadf59c4.png)
A complete backup of ladypopular.com.hr
Are you over 18 and want to see adult content?
![A complete backup of nationalfolkfestival.com](https://www.archivebay.com/archive2/e10948e9-1d0c-4386-9135-006797ca20e3.png)
A complete backup of nationalfolkfestival.com
Are you over 18 and want to see adult content?
Favourite Annotations
![A complete backup of alfalfapedia.net](https://www.archivebay.com/archive2/c89abea0-939d-4c3f-8872-bfc4b824f062.png)
A complete backup of alfalfapedia.net
Are you over 18 and want to see adult content?
![A complete backup of printablepaper.net](https://www.archivebay.com/archive2/793381c1-0e9e-4b9b-872e-395be3e02568.png)
A complete backup of printablepaper.net
Are you over 18 and want to see adult content?
![A complete backup of carlsbadcravings.com](https://www.archivebay.com/archive2/4bc5436e-a53c-480b-92ac-8c19a65804ea.png)
A complete backup of carlsbadcravings.com
Are you over 18 and want to see adult content?
![A complete backup of terrengsykkel.no](https://www.archivebay.com/archive2/6df324c8-fd05-4414-a892-d320329dbab7.png)
A complete backup of terrengsykkel.no
Are you over 18 and want to see adult content?
![A complete backup of vore-station.net](https://www.archivebay.com/archive2/13d18477-fba8-4c10-bc07-badfc1efd60e.png)
A complete backup of vore-station.net
Are you over 18 and want to see adult content?
![A complete backup of 1mobilemovies.com](https://www.archivebay.com/archive2/78cac2de-cf84-44ed-8f5d-67a27ffb7c88.png)
A complete backup of 1mobilemovies.com
Are you over 18 and want to see adult content?
Text
KISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.UNCERTAIN STEPS
Uncertain Steps contest : Code Vita Season 8 Round 1 The question is just an extension of standard DP question (No of ways to jump from nth step to 0th step if jumping 1 or 2 steps is allowed ) Lets assume we have 2 possibilities of jumps at position n i.e., jump to n-1COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but HACKER RANK ARCHIVES Clock Delay Source: Hour Rank 28 The question is simple , we will take 4 inputs initial hour and minutes and final hour and minutes . And another input is time in hours , and we need to add to initial time and find the difference . #include using namespace std; void fun () { int. kishore varma | in Hacker Rank, Programming.MARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldBOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .QUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
KISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.UNCERTAIN STEPS
Uncertain Steps contest : Code Vita Season 8 Round 1 The question is just an extension of standard DP question (No of ways to jump from nth step to 0th step if jumping 1 or 2 steps is allowed ) Lets assume we have 2 possibilities of jumps at position n i.e., jump to n-1COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but HACKER RANK ARCHIVES Clock Delay Source: Hour Rank 28 The question is simple , we will take 4 inputs initial hour and minutes and final hour and minutes . And another input is time in hours , and we need to add to initial time and find the difference . #include using namespace std; void fun () { int. kishore varma | in Hacker Rank, Programming.MARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldBOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .QUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
PROGRAMMING ARCHIVES Roman Iteration contest : CodeVita Season 8 This question is straight forward , do the things mentioned in the question #include usingnamespace std
MARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldFINDING SUM
Finding Sum Source : Mock Code Vita 2 Overview : This question seemed quite easy when seen but implementing brings down to lot of concepts . first of all lets say we are given an array of integers a0,a1,a2,..an-1 . All we need to do is Find subsets of size 3 whosesum is divisible
CHEF AND THE RIGHT TRIANGLES Chef and The Right Triangles. The Chef is given a list of N triangles. Each triangle is identified by the coordinates of its three corners in the 2-D cartesian plane. His job is to figure out how many of the given triangles are right triangles. A right triangle is a COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
SETUP WORK ENVIRONIMENT Setup Work Environiment To improve programming skill , one should need to do hard work , and also smart work . When it comes to Programming Choosing the right Editor matters a lot . There are a lot of Text Editors , of which , the best one’s are Brackets , Atom , SublimeText
BOMBER MAN GAME
Bomber man Game This is one of the most irritating questions that’s left in my todo . Yeah of course such kind of questions make you learn new things . And learning new Things is always fun ( sometimes frustrating ) . link to question : interesting thing is how to savestates . because
SPELL BOB | KISHORE VARMA Spell Bob source : AUG18B | CodeChef Chef likes to play with cards a lot. Today, he’s playing a game with three cards. Each card has a letter written on the top face and another (possibly identical) letter written on the bottom face. Chef can arbitrarily reorder the cardsand/or flip any of
FOREST FIRE
Forest Fire source : Code vita Round 1 ( 2017 ) Roco is an island near Africa which is very prone to forest fire. Forest fire is such that it destroys the complete forest. Not a single tree is left. This island has been cursed by God , and the curse is that whenever a CODE VITA 2018 ROUND-1 CODE VITA 2018. Source : Round 1 | CODEVITA | SET 1 | SET 2 & SET 3. The most waited contest is finally over and the questions asked are . Note : images present here may not have clarity , its just to save loading time . Please click on image to view it with full clarity and also for downlaod . Note : if solution exists for a particularKISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma PROGRAMMING ARCHIVES Roman Iteration contest : CodeVita Season 8 This question is straight forward , do the things mentioned in the question #include usingnamespace std
FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) butMARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldQUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.BOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
EVEN FIBONACCI NUMBERS Even Fibonacci numbers : Problem 2 | Project Euler. Fibonacci numbers : Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . By considering the terms in the Fibonacci sequence whose values do not exceed four millionKISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma PROGRAMMING ARCHIVES Roman Iteration contest : CodeVita Season 8 This question is straight forward , do the things mentioned in the question #include usingnamespace std
FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) butMARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldQUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.BOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
EVEN FIBONACCI NUMBERS Even Fibonacci numbers : Problem 2 | Project Euler. Fibonacci numbers : Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . By considering the terms in the Fibonacci sequence whose values do not exceed four million HACKER RANK ARCHIVES Clock Delay Source: Hour Rank 28 The question is simple , we will take 4 inputs initial hour and minutes and final hour and minutes . And another input is time in hours , and we need to add to initial time and find the difference . #include using namespace std; void fun () { int. kishore varma | in Hacker Rank, Programming.MY SUGGESTIONS
Programming My sincere Suggestions to those who started and also to those who are getting started in programming . Please stop participating in contests , well dont take it literally . People have different Situations , and this is for those who are in SETUP WORK ENVIRONIMENT Setup Work Environiment To improve programming skill , one should need to do hard work , and also smart work . When it comes to Programming Choosing the right Editor matters a lot . There are a lot of Text Editors , of which , the best one’s are Brackets , Atom , SublimeText
UNCERTAIN STEPS
Uncertain Steps contest : Code Vita Season 8 Round 1 The question is just an extension of standard DP question (No of ways to jump from nth step to 0th step if jumping 1 or 2 steps is allowed ) Lets assume we have 2 possibilities of jumps at position n i.e., jump to n-1 CHEF AND THE RIGHT TRIANGLES Chef and The Right Triangles. The Chef is given a list of N triangles. Each triangle is identified by the coordinates of its three corners in the 2-D cartesian plane. His job is to figure out how many of the given triangles are right triangles. A right triangle is a COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
PROJECT EULER ARCHIVES Maximum path sum II source: Project Euler Well initially question kind of looked terrible , but it’s just summing up the maximum value frombottom to top ,
CODEVITA SEASON 8
Codevita Season 8 Round 1. These are the questions given in codevita 2019 round 1, i will post remaining questions soon. Note : Added Solutions to these questions , check link after question.FOREST FIRE
Forest Fire source : Code vita Round 1 ( 2017 ) Roco is an island near Africa which is very prone to forest fire. Forest fire is such that it destroys the complete forest. Not a single tree is left. This island has been cursed by God , and the curse is that whenever a SPELL BOB | KISHORE VARMA Spell Bob source : AUG18B | CodeChef Chef likes to play with cards a lot. Today, he’s playing a game with three cards. Each card has a letter written on the top face and another (possibly identical) letter written on the bottom face. Chef can arbitrarily reorder the cardsand/or flip any of
KISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma PROGRAMMING ARCHIVES Roman Iteration contest : CodeVita Season 8 This question is straight forward , do the things mentioned in the question #include usingnamespace std
FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) butMARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldQUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.BOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
EVEN FIBONACCI NUMBERS Even Fibonacci numbers : Problem 2 | Project Euler. Fibonacci numbers : Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . By considering the terms in the Fibonacci sequence whose values do not exceed four millionKISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma PROGRAMMING ARCHIVES Roman Iteration contest : CodeVita Season 8 This question is straight forward , do the things mentioned in the question #include usingnamespace std
FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) butMARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldQUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.BOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
EVEN FIBONACCI NUMBERS Even Fibonacci numbers : Problem 2 | Project Euler. Fibonacci numbers : Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . By considering the terms in the Fibonacci sequence whose values do not exceed four million HACKER RANK ARCHIVES Clock Delay Source: Hour Rank 28 The question is simple , we will take 4 inputs initial hour and minutes and final hour and minutes . And another input is time in hours , and we need to add to initial time and find the difference . #include using namespace std; void fun () { int. kishore varma | in Hacker Rank, Programming.MY SUGGESTIONS
Programming My sincere Suggestions to those who started and also to those who are getting started in programming . Please stop participating in contests , well dont take it literally . People have different Situations , and this is for those who are in SETUP WORK ENVIRONIMENT Setup Work Environiment To improve programming skill , one should need to do hard work , and also smart work . When it comes to Programming Choosing the right Editor matters a lot . There are a lot of Text Editors , of which , the best one’s are Brackets , Atom , SublimeText
UNCERTAIN STEPS
Uncertain Steps contest : Code Vita Season 8 Round 1 The question is just an extension of standard DP question (No of ways to jump from nth step to 0th step if jumping 1 or 2 steps is allowed ) Lets assume we have 2 possibilities of jumps at position n i.e., jump to n-1 CHEF AND THE RIGHT TRIANGLES Chef and The Right Triangles. The Chef is given a list of N triangles. Each triangle is identified by the coordinates of its three corners in the 2-D cartesian plane. His job is to figure out how many of the given triangles are right triangles. A right triangle is a COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
PROJECT EULER ARCHIVES Maximum path sum II source: Project Euler Well initially question kind of looked terrible , but it’s just summing up the maximum value frombottom to top ,
CODEVITA SEASON 8
Codevita Season 8 Round 1. These are the questions given in codevita 2019 round 1, i will post remaining questions soon. Note : Added Solutions to these questions , check link after question.FOREST FIRE
Forest Fire source : Code vita Round 1 ( 2017 ) Roco is an island near Africa which is very prone to forest fire. Forest fire is such that it destroys the complete forest. Not a single tree is left. This island has been cursed by God , and the curse is that whenever a SPELL BOB | KISHORE VARMA Spell Bob source : AUG18B | CodeChef Chef likes to play with cards a lot. Today, he’s playing a game with three cards. Each card has a letter written on the top face and another (possibly identical) letter written on the bottom face. Chef can arbitrarily reorder the cardsand/or flip any of
KISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) butUNCERTAIN STEPS
Uncertain Steps contest : Code Vita Season 8 Round 1 The question is just an extension of standard DP question (No of ways to jump from nth step to 0th step if jumping 1 or 2 steps is allowed ) Lets assume we have 2 possibilities of jumps at position n i.e., jump to n-1MARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldQUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.BOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .CODE CHEF ARCHIVES
Chef-jumping source : OJUMPS | CodeChef This morning Chef wants to jump a little. In a few minutes he will arrive at the point 0. Then he will perform a lot of jumps in such a sequence: 1-jump, 2-jump, 3-jump, 1-jump, 2-jump, 3-jump, 1-jump, and so on. 1-jump means thatif Chef is at the
MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
KISHORE VARMA
Collision Course. Collision Course Contest : CodeVita Season 8 This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) but we know that this vehicle is moving at. kishore varma FARMER FEB | KISHORE VARMA Farmer Feb has three fields with potatoes planted in them. He harvested x potatoes from the first field, y potatoes from the second field and is yet to harvest potatoes from the third field. Feb is very superstitious and believes that if the sum of potatoes he harvests from the three fields is a prime number. he’ll make a huge profit.COLLISION COURSE
Collision Course. Contest : CodeVita Season 8. This question is quite simple , Given vehicles at position (x,y) and it will go through (0,0) and it may collide but not change direction as specified in the question. s = distance between (x,y) and (0,0) = sqrt (x*x+y*y) butUNCERTAIN STEPS
Uncertain Steps contest : Code Vita Season 8 Round 1 The question is just an extension of standard DP question (No of ways to jump from nth step to 0th step if jumping 1 or 2 steps is allowed ) Lets assume we have 2 possibilities of jumps at position n i.e., jump to n-1MARATHON WINNER
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the worldQUEEN'S ATTACK II
Queen’s Attack II. Source : Hackerrank | Implementation. We are given a n*n Chess Board and the location of Queen on chess board . We need to find The possible number of attacks for the queen from the given position . Once queen enters a block on its path further path should be ignored including the block . Without any blocks.BOB AND SUBARRAY
Bob and Subarray. Bob has an array having n integers. Bob wants to determine the addition of Bitwise of all the subarrays present in the array. Note : Subarray of an array is a contiguous block of elements containing any number of elements from the array. Note : Bitwise OR of a subarray containing a single element will be the element itself .CODE CHEF ARCHIVES
Chef-jumping source : OJUMPS | CodeChef This morning Chef wants to jump a little. In a few minutes he will arrive at the point 0. Then he will perform a lot of jumps in such a sequence: 1-jump, 2-jump, 3-jump, 1-jump, 2-jump, 3-jump, 1-jump, and so on. 1-jump means thatif Chef is at the
MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10. COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
PROGRAMMING ARCHIVES Roman Iteration contest : CodeVita Season 8 This question is straight forward , do the things mentioned in the question #include usingnamespace std
HACKER RANK ARCHIVES Clock Delay Source: Hour Rank 28 The question is simple , we will take 4 inputs initial hour and minutes and final hour and minutes . And another input is time in hours , and we need to add to initial time and find the difference . #include using namespace std; void fun () { int. kishore varma | in Hacker Rank, Programming.FINDING SUM
Finding Sum Source : Mock Code Vita 2 Overview : This question seemed quite easy when seen but implementing brings down to lot of concepts . first of all lets say we are given an array of integers a0,a1,a2,..an-1 . All we need to do is Find subsets of size 3 whosesum is divisible
CHEF AND THE RIGHT TRIANGLES Chef and The Right Triangles. The Chef is given a list of N triangles. Each triangle is identified by the coordinates of its three corners in the 2-D cartesian plane. His job is to figure out how many of the given triangles are right triangles. A right triangle is a SETUP WORK ENVIRONIMENT Setup Work Environiment To improve programming skill , one should need to do hard work , and also smart work . When it comes to Programming Choosing the right Editor matters a lot . There are a lot of Text Editors , of which , the best one’s are Brackets , Atom , SublimeText
COUNTING PRETTY NUMBERS Counting Pretty Numbers contest : LTIME61 source : NUM239 This question is fairly simple , all we need to do is given some range queries and find the count of numbers which have 2 or 3 or 9 as last digit in numbers in given range . #include int main(int argc, charconst *argv) { int
MULTIPLE OF 3
Multiple of 3. source : Multiple of 3. Question looked quite terrific , but doing some math and after simplification , solution is straight forward . Main pain in this problem is simplification . given , d0 , d1 and number of digits . d2= (d0 + d1)%10. let d0+d1 = s. d2=s%10.BOMBER MAN GAME
Bomber man Game This is one of the most irritating questions that’s left in my todo . Yeah of course such kind of questions make you learn new things . And learning new Things is always fun ( sometimes frustrating ) . link to question : interesting thing is how to savestates . because
FOREST FIRE
Forest Fire source : Code vita Round 1 ( 2017 ) Roco is an island near Africa which is very prone to forest fire. Forest fire is such that it destroys the complete forest. Not a single tree is left. This island has been cursed by God , and the curse is that whenever aSTRING ROTATION
kishore varma View all posts by kishore varma I would like to be a hacker and programmer.i wish i could change the world Skip to navigation Skip to contentKISHORE VARMA
Search for: __
* Blog –
* Technology
* Movies
* personal
* Quotes
* Programming –
* Project Euler
* Hacker Rank
* Code Chef
* Setup Work Environiment* About
__ Search for: __
July 31, 2019
Leave a
comment
CODEVITA SEASON 8
Codevita Season 8 Round 1 These are the questions given in codevita 2019 round 1, i will post remaining questions soon. Uncertain Steps VM Fitment Collision Course Marathon Winner Roman Iteration Salary Paidkishore varma | in
contests ,
Programming Read More March 7, 2019 Leave acomment
AWS
AWS Create an instance of your choice . SSH into that machine using the .pem file you got. ssh -i “file.pem” servername We want the following Software on the server . Apache web server PHP and its packages mysql phpmyadmin sudo apt install apache2 -y sudo apt install mysql-server -y sudo apt install php-pear php-fpm… kishore varma | in Blog, Technology
, Tutorials
Read More
February 24, 2019
Leave a comment
BOMBER MAN GAME
Bomber man Game This is one of the most irritating questions that’s left in my todo . Yeah of course such kind of questions make you learn new things . And learning new Things is always fun ( sometimes frustrating ) . link to question : interesting thing is how to savestates . because…
kishore varma | in HackerRank , Programming
Read More
February 23, 2019
Leave a
comment
N QUEEN PROBLEM
I used to be afraid of this problem and now I would like to share my approach to solve it . lets keep track of queens whose positions are fixed . let s={position of all valid queens till now} . let qx ,qy be position of queen q on board . let lx ,ly be…kishore varma | in
Programming Read MoreFebruary 15, 2019
Leave a comment
WRITE YOUR OWN PRINTF IN C Write your own printf in c Some basics of function calling . void fun(int a,int b,int c) Here while calling function fun registers are saved onto stack and esp is loaded into ebp. arguments are pushed onto stack , esp gets decremented return address is pushed onto stack , so esp gets decremented again esp… kishore varma | in CLanguage ,
Programming Read MoreOctober 15, 2018
Leave a comment
MY QUOTES FINAL
Quotes This is the final post in series of quotes . I will conclude this post with hand written quotes . it’s not intended for any individual . I know I shouldn’t be sharing these , but to end the series of quotes it’s essential . And who knows who might find ithelpful ….
kishore varma | in QuotesRead More
October 5, 2018
Leave a comment
MY SUGGESTIONS
Programming My sincere Suggestions to those who started and also to those who are getting started in programming . Please stop participating in contests , well dont take it literally . People have different Situations , and this is for those who are in the beginning stage like me . Take as much time as…kishore varma | in
Programming Read MoreOctober 4, 2018
Leave a comment
QUOTES SERIES 36
Quotes This post is kind of special . And , I realized something new and the truth is I have been realizing a lot lately . Quotes , when you read , may almost feel like the same situation you are in now , trust me someone else’s situation is not as same as yours… kishore varma | in QuotesRead More
September 30, 2018
Leave a comment
QUOTES SERIES 35
QUOTES
kishore varma | in QuotesRead More
September 29, 2018
Leave a comment
QUOTES SERIES 34
Quotes This is 34th post in series of quotes , its mainly focussed on time and priorities . I would add my own quote . Nothing in this world lasts long , but make sure you realize it before it’s gone . –Kishore Varma
kishore varma | in QuotesRead More
__ Prev 12 3
…13
Next __
GET NOTIFIED ABOUT NEW INFORMATION FROM THIS WEBSITE Join 34 other subscribersEmail Address
Subscribe
CHALLENGES
Interesting challenges and problems , I come across are placed . -------------------------* Modular GCD
( _NEW_ )
* Yet another substring problem * Matrix Transformation * 15 puzzle solvable or not ( suggested by hema ) -------------------------My Profiles
* Hackerrank
* Codechef
* Project Euler ( friend key )* GitHub
TOP POSTS & PAGES
* About
* String Rotation
* CODE VITA 2018 Round-1* Base 6
* series 13
* Queen's Attack II
* Quotes series 34
* Write your own printf in cRECENT POSTS
*
CODEVITA SEASON 8
July 31, 2019
*
BOMBER MAN GAME
February 24, 2019
*
N QUEEN PROBLEM
February 23, 2019
*
WRITE YOUR OWN PRINTF IN CFebruary 15, 2019
*
MY QUOTES FINAL
October 15, 2018
CATEGORIES
* Blog
* Movies
* personal
* Technology
* Programming
* C Language
* Code Chef
* contests
* Easy
* contests
* Guide to Programming* Hacker Rank
* Project Euler
* Quotes
* Tutorials
* C Tutorial
__
Kishore Varma 2020Details
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0