Yash Vardhan Tyagi's Projects
Adding two numbers without using any arithmetic or logical operator.
Amicable numbers are two different numbers related in such a way that the sum of the proper divisors of each is equal to the other number. The smallest pair of amicable numbers is (220, 284).
Armstrong number is a number that is equal to the sum of cubes of its digits. For example 0, 1, 153, 370, 371 and 407 are the Armstrong numbers.
Given an unsorted array of numbers, write an algorithm that confirms, if an array consists of consecutive elements or not.
In Today's world as of 2020, Java, javascript and Python are the most demanding programming languages in IT industry, If you are good enough in C programming Language, it will be easy to learn Java, javascript and Python, in addition it will be easy to enter into software industry by knowing Java and Python.
Basic Function questions to get started.
Write a program to count number of smaller elements on right of each element in an array. Given an unsorted array arr[] of distinct integers, construct another array countSmaller[] such that countSmaller[i] contains count of smaller elements on right side of each element arr[i] in array.
Design of Algorithms
This repository is created for submitting Design and Analysis of Algorithm Assignments.
Given an unsorted array of nonnegative integers, find a continuous sub-array that adds to a given number.
Given a sorted array with possibly duplicate elements, the task is to find indexes of first and last occurrences of an element x in the given array.
Fizz Buzz is a very simple programming task, asked in software developer job interviews. A typical round of Fizz Buzz can be: Write a program that prints the numbers from 1 to 100 and for multiples of '3' print “Fizz” instead of the number and for the multiples of '5' print “Buzz”.
My first Oops program in Java. Let's get started.
My first program in java, ie. print(Hello World)
Find the Largest And Smallest Element in an array without sorting.
To find the sum of contiguous sub-array within a one-dimensional array of numbers which has the largest sum.