codewithyasar

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 index position of output array with the greater element.  Repeat this while loop until it is not greater than compare

Replace: Output:

 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 = s . peek (); System . out . println ( x ); s . pop (); printStack ( s ); } public static

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

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

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

Problem Description Given a sequence of distinct numbers a1, a2, ….. an, an inversion occurs if there are indices i<j such that ai > aj . For example, in the sequence 2 1 4 3 there are 2 inversions (2 1) and (4 3). The input will be a main sequence of N positive integers. From this sequence, a Derived Sequence will be obtained using the following rule. The output is the number of inversions in the derived sequence. Rule for forming derived sequence An integer may be represented in base 6 notation. In base 6, 10305 is 1x64 + 3x62 + 5 =1409. Note that none of the digits in that representation will be more than 5. The sum of digits in a base 6 representation is the sum of all the digits at the various positions in the representation. Thus for the number 1409, the representation is 10305, and the sum of digits is 1+0+3+0+5=9. The sum of digits may be done in the decimal system, and does not need to be in base 6 The derived sequence is the sum of the digits when the corresponding inte