public void IsPalindromeTest6() { PalindromeNumber palindromeNumber = new PalindromeNumber(); bool res = palindromeNumber.IsPalindrome(123456554); Assert.IsFalse(res); }
public void IsPalindromeTest11() { PalindromeNumber palindromeNumber = new PalindromeNumber(); bool res = palindromeNumber.IsPalindrome(-2147483648); Assert.IsFalse(res); }
public void IsPalindromeTest7() { PalindromeNumber palindromeNumber = new PalindromeNumber(); bool res = palindromeNumber.IsPalindrome(123454321); Assert.IsTrue(res); }
public void IsPalindromeTest9() { PalindromeNumber palindromeNumber = new PalindromeNumber(); bool res = palindromeNumber.IsPalindrome(-1); Assert.IsFalse(res); }
public void IsPalindromeTest10() { PalindromeNumber palindromeNumber = new PalindromeNumber(); bool res = palindromeNumber.IsPalindrome(1001); Assert.IsTrue(res); }
public void ReverseTest() { var c = new PalindromeNumber(); // example1 var target = 121; var result = c.IsPalindrome(target); var expected = true; Assert.AreEqual(expected, result); // example2 target = -121; result = c.IsPalindrome(target); expected = false; Assert.AreEqual(expected, result); //example3 target = 10; result = c.IsPalindrome(target); expected = false; Assert.AreEqual(expected, result); //example4 target = -101; result = c.IsPalindrome(target); expected = false; Assert.AreEqual(expected, result); }
public void IsPalindrome_123_False() { var srv = new PalindromeNumber(); bool isPalindrome = srv.IsPalindrome(123); Assert.IsFalse(isPalindrome); }
public void Test() { var actul = new PalindromeNumber(); var rslt = actul.IsPalindromeNumber(121); Assert.True(rslt); }
public void IsPalindrome_12321_True() { var srv = new PalindromeNumber(); bool isPalindrome = srv.IsPalindrome(12321); Assert.IsTrue(isPalindrome); }
public void TestingIsPalindromeX(int num, bool expected) { var palindromeNumber = new PalindromeNumber(); var result = palindromeNumber.IsPalindromeX(num); Assert.AreEqual(expected, result); }
public void NumbersThanEndInZeroAreNotPalindrome() { //Arrange var palindrome = new PalindromeNumber(); //Act var isPalindrome = palindrome.IsPalindrome(10); //Assert Assert.False(isPalindrome); }
public void OneNumberIsAPalindrome() { //Arrange var palindrome = new PalindromeNumber(); //Act var isPalindrome = palindrome.IsPalindrome(1); //Assert Assert.True(isPalindrome); }
public void PalindromeNumberInTheThousands() { //Arrange var palindrome = new PalindromeNumber(); //Act var isPalindrome = palindrome.IsPalindrome(10201); //Assert Assert.True(isPalindrome); }
public void NumberAboveTenMayNotBeAPalindrome() { //Arrange var palindrome = new PalindromeNumber(); //Act var isPalindrome = palindrome.IsPalindrome(23); //Assert Assert.False(isPalindrome); }
public void NumberAboveTenCanBePalindrome() { //Arrange var palindrome = new PalindromeNumber(); //Act var isPalindrome = palindrome.IsPalindrome(11); //Assert Assert.True(isPalindrome); }
public void PalindromeNumberInTheHundreds() { //Arrange var palindrome = new PalindromeNumber(); //Act var isPalindrome = palindrome.IsPalindrome(121); //Assert Assert.True(isPalindrome); }
private static void PalindromeNumberTest() { Console.WriteLine("\nPalindrome Number question:"); PalindromeNumber palindromeNumber = new PalindromeNumber(); int[] testNumbers = new [] { 121, -121, 10 }; foreach (int number in testNumbers) { Console.WriteLine("{0} -> {1}", number, palindromeNumber.IsPalindromeTwo(number)); } }
public void IsPalindromeTests() { PalindromeNumber obj = new PalindromeNumber(); var x = obj.IsPalindrome(121); //t x = obj.IsPalindrome(-121); //f x = obj.IsPalindrome(10); //f x = obj.IsPalindrome(10002); //f x = obj.IsPalindrome(10001); //t }
public void TestPalindromeNumber() { var r = PalindromeNumber.Solution(-123); Assert.AreEqual(r, false); r = PalindromeNumber.Solution(10); Assert.AreEqual(r, false); r = PalindromeNumber.IsPalindrome(1234321); Assert.AreEqual(r, true); r = PalindromeNumber.IsPalindrome(123321); Assert.AreEqual(r, true); r = PalindromeNumber.Solution(0); Assert.AreEqual(r, true); }
public void TestIsPalindrome() { var palindrome = new PalindromeNumber(); var value = 123454321; var result = palindrome.IsPalindrome(value); Assert.True(result); value = 1; result = palindrome.IsPalindrome(value); Assert.True(result); value = 1234554321; result = palindrome.IsPalindrome(value); Assert.True(result); value = -1234321; result = palindrome.IsPalindrome(value); Assert.False(result); }
public PalindromeNumberTests() { _testsVerifier = new TestsVerifier(); _objUnderTest = new PalindromeNumber(); }
public void IsPalindrome_Negative() { Assert.AreEqual(false, PalindromeNumber.IsPalindrome(-10)); }
public void IsPalindrome_1000021() { Assert.AreEqual(false, PalindromeNumber.IsPalindrome(1000021)); }
public void IsPalindrome_Single() { Assert.AreEqual(true, PalindromeNumber.IsPalindrome(5)); }
public void Solution2Test(int num, bool result) { Assert.Equal(result, PalindromeNumber.Solution2(num)); }
public void Case1() { var r = new PalindromeNumber().IsPalidrome(121); Assert.AreEqual(true, r); }
public void Case3() { var r = new PalindromeNumber().IsPalidrome(10); Assert.AreEqual(false, r); }
static void Main(string[] args) { SortedMatrixSearch.Run(); SparseSearch.Run(); SearchInRotatedArray.Run(); GroupAnagrams.Run(); CombinationsOfNPairsParentheses.Run(); PermutationWithDuplicates.Run(); PermutationNoDuplicates.Run(); var subsetList = new List <List <int> >(); subsetList = SubsetInSet.FindAllSubsetInSet(new List <int> { 1, 2, 3 }); ReverseLinkedList.Run(); IsUniqueString.Run(); StoneDivisionProblem.Run(); Kangaroo.Run(); AppleAndOrange.Run(); AbbreviationProblem.Run(); FibonacciModifiedProblem.Run(); RecursiveDigitSum.Run(); RangeSumOfBST.Run(); GradingStudentsProblem.Run(); // XorSequenceProblem.Run(); CounterGameProblem.Run(); MaximizingXORProblem.Run(); LonelyIntegerProblem.Run(); FlippingBitsProblem.Run(); QueueUsingTwoStacksProblem.Run(); GetNodeValue.Run(); MergeTwoSortedLinkedLists.Run(); Compare_Two_linked_lists.Run(); DeleteNodeProblem.Run(); ArrayManipulationProblem.Run(); LeftRotationProblem.Run(); HourGlass2D.Run(); SimpleTextEditorProblem.Run(); EqualStacksProblem.Run(); MaximumElementProblem.Run(); BinarySearchTreeInsertion.Run(); TopViewProblem.Run(); TimeConvertsionProblem.Run(); BinaryTreePathsProblem.Run(); IncreasingOrderSearchTree.Run(); RemoveAllAdjacentDuplicatesInStringWithKLength.Run(); RemoveAllAdjacentDuplicatesInString.Run(); CheckStraightLineProblem.Run(); HouseRobber.Run(); UniquePathsProblem.Run(); FirstUniqueCharacterInString.Run(); BinaryTreeInorderTraversal.Run(); DailyTemperaturesProblem.Run(); CountingBitsproblem.Run(); SortIntegersByTheNumberOf1BitsProblem.Run(); HammingDistanceProblem.Run(); RansomNoteProblem.Run(); ConvertBinaryNumberInLinkedListToIntegerProblem.Run(); NumberOfStepsToReduceNumberToZeroProblem.Run(); JewelsAndStones.Run(); ClimbingStairsProblem.Run(); BestTimeToBuyAndSellStock.Run(); MajorityElementProblem.Run(); MoveZeroesProblem.Run(); InvertBinaryTree.Run(); SingleNumberProblem.Run(); MaximumDepthInTrree.Run(); MergeTwoBinaryTrees.Run(); AddBinaryProblem.Run(); PlusOneProblem.Run(); LengthOfLastWordProblem.Run(); KadaneAlgorithmForMaxSubArray.Run(); KMPAlgorithm.Run(); CountAndSayProblem.Run(); SearchInsertPosition.Run(); ImplementIndexOfString.Run(); RemoveElement.Run(); RemoveDuplicatesFromSortedArray.Run(); MergeTwoSortedLists.Run(); ValidParentheses.Run(); LongestCommonPrefix.Run(); RomanToInteger.Run(); PalindromeNumber.Run(); ReverseInteger.Run(); TwoSumProblem.Run(); AddOneToNumber.Run(); MostAmountOfChange.Run(); #region BinaryTree LeastCommonAncestor.Run(); PrintAllPaths.Run(); HasPathSum.Run(); CheckIfBinaryTreeIsBinarySearchTree.Run(); PrintAllNodesWithRangeInBinarySearchTree.Run(); UniqueTreeStructureNumber.Run(); MirrorTree.Run(); #region BitManuiplation_GetNthNumber NumberOfStepsToReduceNumberToZeroProblem.Run(); CountNumbersOf1InBit.Run(); ReverseThebitsInInteger.Run(); PrintBitsInInteger.Run(); GetNthBit.Run(); setNthBitTo1.Run(); SetNthBitTo0.Run(); #endregion MinimumtValueInTrree minValueInTree = new MinimumtValueInTrree(); minValueInTree.Run(); #endregion #region Recursion Chessboard chessboard = new Chessboard(); chessboard.Run(); RatPathToMaze ratPathToMaze = new RatPathToMaze(); ratPathToMaze.Run(); List <string> anagramList = new List <string>(); anagramList = WordAnagram.GenerateWordAnagram("abc"); Pixel[,] pixelList = new Pixel[3, 3] { { new Pixel(0, 0, "red"), new Pixel(0, 1, "green"), new Pixel(0, 2, "green") }, { new Pixel(1, 0, "red"), new Pixel(1, 1, "green"), new Pixel(1, 2, "green") }, { new Pixel(2, 0, "red"), new Pixel(2, 1, "green"), new Pixel(2, 2, "green") } }; FillPaint.PaintFill(pixelList, 1, 2, "green", "black"); BinaryTreesAreTheSame.Run(); #endregion #region General problems RotateArrayByKSpaces.Run(); #region AddtwoNumbersReferencedByTheirDigits var addRes = AddtwoNumbersReferencedByTheirDigits.AddNumbers(new int[] { 1, 2, 7 }, new int[] { 9, 4 }); #endregion #region RunLengthEncoding var encodedStr = RunLengthEncoding.Encode("aabbbbc"); var decodedStr = RunLengthEncoding.Decode(encodedStr); #endregion #region BreakDocumentIntoChunk var chunkRes = BreakDocumentIntoChunk.Chunkify("ab:dd:ddfcct:aab:cccc", ':', 5); #endregion #region GameOfLife var gameRes = GameOfLife.GetNextInteration(new int[3, 3] { { 1, 0, 0 }, { 0, 1, 1 }, { 1, 0, 0 } }); #endregion . #endregion #region InsertionSort InsertionSort.insertionSort(listToSort); #endregion #region BinarySearch Console.WriteLine(String.Format("%s is present at index: %s", 30, BinarySearch.binarySearch(sortedArray, 30, 0, sortedArray.Length - 1))); Console.WriteLine(String.Format("%s is present at index: %s", 4, BinarySearch.binarySearch(sortedArray, 4, 0, sortedArray.Length - 1))); Console.WriteLine(String.Format("%s is present at index: %s", 15, BinarySearch.binarySearch(sortedArray, 15, 0, sortedArray.Length - 1))); #endregion #region MergeSort MergeSort.print(listToSort); MergeSort.mergeSort(listToSort); #endregion #region QuickSort QuickSort.print(listToSort); QuickSort.quickSort(listToSort, 0, listToSort.Length - 1); QuickSort.print(listToSort); #endregion }
public bool PalindromeNumber(int x) { var solver = new PalindromeNumber(); return(solver.Solution(x)); }
public void BeforeEach() { palindromeNumber = new PalindromeNumber(); }