Simple Honeymoon Agent C++

Download ---> Download

C++ Simple Banking System

Sum of multiple of 3 or 5

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.

1 2 3 4 5 6 7 8

public static void main(String []args){ int sum = 0; for (int x = 0; x < 10; x++) { if (x % 3 == 0 || x % 5 == 0) sum += i; } System.out.print(sum); }

Prime Factor of integers

The prime factors of 13195 are 5, 7, 13 and 29.

Input: 13195

Ouput : 5,7,13,29

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

public static void main(String []args){ int n = 13195; isPrimeFactor(n); } public static void isPrimeFactor(int n){ int count=0; ArrayList arr = new ArrayList(); for(int x=2;x<=n;x++){ if(n%x==0){ arr.add(x); n = n/x; x--; count++; } } System.out.print(arr.toString()); }

Count two 6's or 7's are next to each other

Given an array of integers, return the number of times that two 6's are next to each other in the array. Also count instances where the second "6" is actually a 7.

function({6, 6, 2}) → 1
function({6, 6, 2, 6}) → 1
function({6, 7, 2, 6}) → 1
function({6, 6, 2, 6, 7}) → 2
function({6, 1}) → 0
function({1, 2, 3, 5, 6}) → 0

1 2 3 4 5 6 7 8 9 10 11

public int function667(int[] nums) { int count = 0; for (int i=0; i < (nums.length-1); i++) { if (nums[i] == 6) { if (nums[i+1] == 6 || nums[i+1] == 7) { count++; } } } return count; }

No triples interger in a row

Given an array of integers, we'll say that a triple is a value appearing 3 times in a row in the array. Return true if the array does not contain any triples.

function({1, 1, 2, 2, 1}) → true
function({1, 1, 2, 2, 2, 1}) → false
function({1, 1, 1, 2, 2, 2, 1}) → false

1 2 3 4 5 6 7 8

public boolean noTriples(int[] nums) { for(int x=0;x<nums.length-2;x++){ if(nums[x]==nums[x+1] && nums[x]==nums[x+2]) return false; } return true; }

String Matching 1

Given 2 strings, a and b, return the number of the positions where they contain the same length 2 substring. So "xxcaazz" and "xxbaaz" yields 3, since the "xx", "aa", and "az" substrings appear in the same place in both strings.

Input	Output
xxcaazz xxbaaz	3
abc abc	2
abc axc	0

1 2 3 4 5 6 7 8 9 10

public int stringMatch(String a, String b) { int len = (a.length()<=b.length())? a.length() : b.length(); int count=0; for(int x=0;x<len-1;x++){ if(a.substring(x,x+2).equals(b.substring(x,x+2))) count++; } return count; }