CodeWars

This repository contains solutions to various coding challenges from CodeWars, implemented in Java. Each solution aims to provide efficient and clean code.

Table of Contents

• Binary Addition
• Detect Pangram
• Difference Of 2
• Does My Number Look Big In This
• Find Odd Int
• Find Smallest Int
• First Non-Repeating Character
• Highest Scoring Word
• Max Subarray Sum
• Multiples of 3 and 5
• Parity Outlier
• Persistent Bugger
• Simple Bead Count
• Square n Sum

Challenges

Binary Addition

• Description: Adds two binary numbers and returns their sum in binary.
• File: BinaryAddition.java

Detect Pangram

• Description: Determines if a given sentence is a pangram, containing every letter of the alphabet at least once.
• File: DetectPangram.java

Difference Of 2

• Description: Finds pairs of integers from a given array that have a difference of 2.
• File: DifferenceOf2.java

Does My Number Look Big In This

• Description: Determines if a number is a Narcissistic number (Armstrong number).
• File: DoesMyNumberLookBigInThis.java

Find Odd Int

• Description: Finds the integer that appears an odd number of times in a given array.
• File: FindOddInt.java

Find Smallest Int

• Description: Finds the smallest integer in a given array.
• File: FindSmallestInt.java

First Non-Repeating Character

• Description: Finds the first non-repeating character in a string.
• File: FirstNonRepeatingCharacter.java

Highest Scoring Word

• Description: Finds the highest scoring word in a sentence based on letter values.
• File: HighestScoringWord.java

Max Subarray Sum

• Description: Finds the maximum sum of a contiguous subarray.
• File: MaxSubarraySum.java

Multiples of 3 and 5

• Description: Calculates the sum of all multiples of 3 or 5 below a given number.
• File: MultiplesOf3And5.java

Parity Outlier

• Description: Identifies the outlier in an array of integers where all but one are either odd or even.
• File: ParityOutlier.java

Persistent Bugger

• Description: Determines the multiplicative persistence of a number, which is the number of times you must multiply the digits until you reach a single digit.
• File: PersistentBugger.java

Simple Bead Count

• Description: Counts the number of beads in a string representation of a number.
• File: SimpleBeadCount.java

Square n Sum

• Description: Squares each number in an array and returns the sum of the squares.
• File: SquareNSum.java