Skip to main content

Posts

Java Loops | HackerRank solutions -codewithyasar

  Objective In this challenge, we're going to use loops to help us do some simple math. Task Given an integer,  , print its first   multiples. Each multiple   (where  ) should be printed on a new line in the form:  N x i = result . Input Format A single integer,  . Constraints Output Format Print   lines of output; each line   (where  ) contains the   of   in the form: N x i = result . Sample Input 2 Sample Output 2 x 1 = 2 2 x 2 = 4 2 x 3 = 6 2 x 4 = 8 2 x 5 = 10 2 x 6 = 12 2 x 7 = 14 2 x 8 = 16 2 x 9 = 18 2 x 10 = 20 Explanation:           Here, we just need to use for loops to achieve the result Solution : import java.io.* ; import java.math.* ; import java.security.* ; import java.text.* ; import java.util.* ; import java.util.concurrent.* ; import java.util.regex.* ; public class Solution { public static void main ( String [] args ) t...
Post a Comment
Read more

Cut #2 | Linux shell | Hacker Rank Problems

Problem statement :  Here we need to  Display the     and     character from each line of text. Input Format A text file with   lines of  ASCII  text only. Constraints Output Format The output should contain   lines. Each line should contain just two characters at the   and the   position of the corresponding input line. Sample Input Hello World how are you Sample Output e o oe Objective In this challenge, we practice using the cut command to get and print characters from a file. Problem Solution: code: while read line do echo ${ line } | cut -c 2,7 done
Post a Comment
Read more

Next Greater Element | JAVA

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element on the right side of x in the array. Elements for which no greater element exist, consider the next greater element as -1.   eg: input=[11,4,3,2,10,12] ouput : 12 ,10,10,10,12,-1 EXPLANATION:          Find the first next greater element for each element.        If the element have no greater element replace the element with -1 APPROACH:     Using Stack. Logic:     Create one stack for storing the index of the array elements     using for loop iterate over each element.    compare variable to store the next greater element    If the element you are iterating is lesser than the compare element, then push into the stack.   If the element you are iterating is greater than the compare element pop the index from stack  then replace the ind...
Post a Comment
Read more

Balanced Paranthesis

 Problem Statement:         Program to check for balanced parentheses in an expression using stack.        Given an expression as string comprising of opening and closing characters        of parentheses - (), curly braces - {} and square brackets - [], we need to         check whether symbols are balanced or not.  Approach:          Using Stack, We are going to solve this Problem   Solution: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 //Java program for Balanced Paranthesis import java.util.* ; import java.io.* ; public class MyClass { public static void printStack ( Stack < Character > s ) { if ( s . empty ()) { return ; } Character x =...
Post a Comment
Read more

Consecutive Prime Sum | Codevita |Python

Problem Description Question – : Some prime numbers can be expressed as a sum of other consecutive prime numbers. For example 5 = 2 + 3, 17 = 2 + 3 + 5 + 7, 41 = 2 + 3 + 5 + 7 + 11 + 13. Your task is to find out how many prime numbers which satisfy this property are present in the range 3 to N subject to a constraint that summation should always start with number 2. Write code to find out the number of prime numbers that satisfy the above-mentioned property in a given range. Input Format: First line contains a number N Output Format: Print the total number of all such prime numbers which are less than or equal to N. Constraints: 2<N<=12,000,000,000 Input 20   Output: 2 (Below 20 there are two such members; 5 and 17) 5=2+3 17=2+3+65+7
Post a Comment
Read more

Dining Table Seating Arrangement | Codevita | Python Solution

Problem Statemen t In a Conference ,attendees are invited for a dinner after the conference.The Co-ordinator,Sagar arranged around round tables for dinner and want to have an impactful seating experience for the attendees.Before finalizing the seating arrangement,he wants to analyze all the possible arrangements.These are R round tables and N attendees.In case where N is an exact multiple of R,the number of attendees must be exactly N//R,,If N is not an exact multiple of R, then the distribution of attendees must be as equal as possible.Please refer to the example section before for better understanding. For example, R = 2 and N = 3 All possible seating arrangements are (1,2) & (3) (1,3) & (2) (2,3) & (1) Attendees are numbered from 1 to N. Input Format: The first line contains T denoting the number of test cases. Each test case contains two space separated integers R and N, Where R denotes the number of round tables and N denotes the number of attendees. Output Format: Sin...
Post a Comment
Read more

Smallest Multiple in Permuted digits | Codevita Solution |Python

Problem:  Given two integers N,d,find the smallest number that number that is a multiple of d that could be formed by permuting the digits of N .You must use all the digits of N.and if the smallest multiple of d has leading zeros,they can be dropped .If no such number exists,output -1. Input: A line containing two space separated integers.representing N and d. Output: A single line giving the permutation of N that is the smallest multiple of d,without any leading zeros,if any.If not such permutation exists, the output should be -1. Constraints: 1<=N<=10^12 1<=d<=1000000 Example 1: Input: 210 2 Output: 12 Example 2: Input: 531 2 Output: 1
Post a Comment
Read more

Highlights

Lexi String | codevita |Python Solution

Lexi String Little Jill jumbled up the order of the letters in our dictionary. Now, Jack uses this list to find the smallest lexicographical string that can be made out of this new order. Can you help him? You are given a string P that denotes the new order of letters in the English dictionary. You need to print the smallest lexicographic string made from the given string S. Constraints: 1 <= T <= 1000 Length (P) = 261 <= length (S) <= 100 All characters in the string S, P are in lowercase Input Format The first line contains number of test cases T The second line has the string P The third line has the string S Output Print a single string in a new line for every test case giving the result Test Case Example 1 Input 2 polikujmnhytgbvfredcxswqaz abcd qwryupcsfoghjkldezxvbintma ativedoc Output bdca codevita Explanation: The transformed smallest lexicographical strings are in order they would be if order of letters are changed to string P
Post a Comment
Read more

Super ASCII String Checker | CodeVita | PYTHON CODE

Problem: In the Byteland country a string "S" is said to super ascii string if and only if count of each character in the string is equal to its ascii value. In the Byteland country ascii code of 'a' is 1, 'b' is 2 ...'z' is 26. Your task is to find out whether the given string is a super ascii string or not. Input Format: First line contains number of test cases T, followed by T lines, each containing a string "S". Output Format: For each test case print "Yes" if the String "S" is super ascii, else print "No" Constraints: 1<=T<=100 1<=|S|<=400, S will contains only lower case alphabets ('a'-'z'). Explanation: For eg1 - String "bba" is super ascii string Explanation:- .String "bba" The count of character 'b' is 2. Ascii value of 'b' is also 2. The count of character 'a' is 1. Ascii value of 'a' is also 1. Hence string "bba" ...
Post a Comment
Read more

Haunted Hotel

Haunted Hotel Follow the instructions to live 6th June 1906, there was a big fire accident at a 5 star hotel in which more than 160 people died, from that time no one even dared to go near that burnt place, because it was believed that the place became haunted. This fear among people went increasing due to the suspicious deaths of the people who tried entering the hotel. More than 100 years have passed, but that has not reduced thee fear among the people even a bit. Dhoni is a person who likes adventures, so wanted to see what actually is the mystery of the hotel. So on a Friday evening he went inside the hotel with a camera which was live streamed live on his Facebook page.   The live stream lasted not even for an hour, all the electronic equipment he had began malfunctioning. He might be brave, but being alone in a place which is believed to be haunted and that too in late evening, his nerves got him. It was so quite so that, he could hear his own heart beat increasing as a d...
Post a Comment
Read more