# Category Archives: Mathematical

Given a positive integer n, find if it can be expressed as xy where y > 1 and x > 0. x and y both… Read More
Written Test: Two Sections : 1. CS and Fundamentals        Easy fundamental questions and program output from Recursion / OS / Linux, Concurrency threading. 2.… Read More
I would like to share recent recruitment drive I attended from Paytm CS + Programming + Coding – Screening round 20 MCQ realted to C,… Read More
A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not… Read More
A Pythagorean triplet is a set of three positive integers a, b and c such that a2 + b2 = c2. Given a limit, generate… Read More
Given an integer array of n integers, find sum of bit differences in all pairs that can be formed from array elements. Bit difference of… Read More
Given an integer x, find it’s square root. If x is not a perfect square, then return floor(√x). Examples :  Input: x = 4 Output:… Read More
Given a linear equation of n variables, find number of non-negative integer solutions of it. For example,let the given equation be “x + 2y =… Read More
Given two numbers, return sum of them without using operators + and/or -, and using ++ and/or –. Examples: Input: x = 10, y =… Read More
Given two binary strings, return their sum (also a binary string). Example: Input: a = "11", b = "1" Output: "100" We strongly recommend you… Read More
Given a number x, print all possible non-increasing sequences with sum equals to x. Examples:  Input: x = 3 Output: 1 1 1 2 1… Read More
Round -1(written) 20 Online MCQ topics are c, Data Structure and Algorithms, Networks, DBMS,OS Round 1(F2F) [1.5 hr] Introduce yourself. 1) Sort array [0,1,1,1,1,0,0,1] do… Read More
Euclid’s algorithm is used to find GCD of two numbers. There are mainly two versions of algorithm. Version 1 (Using subtraction) // Recursive function to… Read More
Given an arithmetic expression, find all possible outcomes of this expression. Different outcomes are evaluated by putting brackets at different places. We may assume that… Read More
Given a number n, we need to count the total number of n digit numbers such that the sum of even digits is 1 more… Read More