Smarter hiring with AI
Schedule a call
Trusted Partner in Talent Search If you don’t hire — you don’t pay.
Axiom Pro Your Trusted Partner in Talent Search We pre-qualify candidates so you don’t have to. If you don’t hire — you don’t pay. Let’s build your dream team, risk-free.
We are pleased to present to you a list of highly skilled .Net Developers, each possessing extensive knowledge and experience in developing web applications using .Net and related technologies. These candidates have a strong understanding of object-oriented programming principles and have demonstrated expertise in ASP.Net, MVC, Web API, and Entity Framework.
Full Stack .Net / Angular 2+ Developer
09/01/2022 - 10/01/2023During my tenure at Luxoft in Kyiv from September 2022 to October 2023, I served as a Full Stack .Net/Angular 2+ Developer on the Project Passport. Project Passport is a project management system tailored for Luxoft projects, facilitating comprehensive project lifecycle oversight and seamless integration with other crucial Luxoft systems. In this role, I undertook responsibilities spanning both BackEnd and Frontend development. I was actively involved in writing Unit Tests and Integration Tests for the BackEnd using XUnit and NSubstitute. My contributions emphasized high code quality, adherence to clean code principles, and the implementation of advanced software design practices and patterns. The technologies employed included .Net, Angular, NHibernate, RXJS, Azure, XUnit, MSSQL Server, Custom BSS Framework, BizTalk, RabbitMQ.
Task Title
The Fibonacci sequence is defined by the recurrence relation:
fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
Hence the first 12 terms will be:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
The 12th term, F12, is the first term to contain three digits .
What is the index of the first term in the Fibonacci sequence to contain 1000 digits ?
user solution
using System;
namespace AxiomTest
{
public class Program
{
public static void Main()
{
// Let's represent the obtaining of the n-th Fibbonaci number using Binet's Formula.
// Since 10^2 contains 3 digits -> 10^999 contains 1000 digits.
// We take the value 10^999, since we need to find the smallest number that has 1000 digits,
// that number is exactly 10^999.
// After logarithmizing on a base of 10 we get our limit equal to 999.
int limit = 999;
// Golden Ratio constant
double goldenRatio = 1.6180;
// After logarithmizing on a base of 10 we get the following inequality:
// n * log(goldenRatio) > 999 * log(10) + (log(5) / 2)
// We denote the index we're looking for as n.
// Let's move the logarithm to the right side of the inequality and solve the equation.
double index = Math.Round(((limit * Math.Log10(10)) + (Math.Log10(5) / 2)) / Math.Log10(goldenRatio));
Console.Write(index);
}
}
}
Task Title
Let d(n) be defined as the sum of proper divisors of n(numbers less than n which divide evenly into n).
if d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers .
for example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
user solution
using System;
namespace AxiomTest
{
public class Program
{
const int limit = 10000;
static void Main()
{
int sumOfAmicableNumbers = 0;
for (int i = 1; i < limit; i++)
{
int sumOfDivisors = SumOfDivisors(i);
if (IfAmicable(sumOfDivisors, i))
{
sumOfAmicableNumbers += i;
}
}
Console.WriteLine(sumOfAmicableNumbers);
}
static bool IfAmicable(int sumDivisors, int index)
{
// We add sumDivisors != index condition to avoid perfect numbers
return sumDivisors < limit && sumDivisors != index && SumOfDivisors(sumDivisors) == index;
}
static int SumOfDivisors(int number)
{
int sum = 0;
// We divide number by 2 because there is no divider that would be greater than n / 2
for (int i = 1; i <= number / 2; i++)
{
if (number % i == 0)
{
sum += i;
}
}
return sum;
}
}
}
Task Title
In the 20×20 grid below, four numbers along a diagonal line have been marked in red .
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
The product of these numbers is 26 × 63 × 78 × 14 = 1788696.
What is the greatest product of four adjacent numbers in the same direction(up, down, left, right, or diagonally) in the 20×20 grid ?
user solution
using System;
class Program
{
static void Main()
{
string grid = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08\n49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00\n81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65\n52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91\n22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80\n24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50\n32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70\n67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21\n24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72\n21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95\n78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92\n16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57\n86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58\n19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40\n04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66\n88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69\n04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36\n20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16\n20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54\n01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48";
int maximum = CalculateMaximum(grid);
Console.WriteLine(maximum);
}
static int CalculateMaximum(string grid)
{
string[] lines = grid.Trim().Split('\n');
int[][] cells = new int[lines.Length][];
for (int i = 0; i < lines.Length; i++)
{
cells[i] = Array.ConvertAll(lines[i].Split(), word => ParseGridNumber(word));
}
int maximum = 0;
maximum = GetMaximumForHorizontalRow(cells, maximum);
maximum = GetMaximumForVerticalColumn(cells, maximum);
maximum = GetMaximumForLeftDiagonal(cells, maximum);
maximum = GetMaximumForRightDiagonal(cells, maximum);
return maximum;
}
static int GetMaximumForHorizontalRow(int[][] cells, int maximum)
{
for (int row_i = 0; row_i < 20; row_i++)
{
for (int col_i = 0; col_i < 16; col_i++)
{
int product = 1;
for (int i = 0; i < 4; i++)
{
product *= cells[row_i][col_i + i];
}
maximum = Math.Max(maximum, product);
}
}
return maximum;
}
static int GetMaximumForVerticalColumn(int[][] cells, int maximum)
{
for (int row_i = 0; row_i < 16; row_i++)
{
for (int col_i = 0; col_i < 20; col_i++)
{
int product = 1;
for (int i = 0; i < 4; i++)
{
product *= cells[row_i + i][col_i];
}
maximum = Math.Max(maximum, product);
}
}
return maximum;
}
static int GetMaximumForLeftDiagonal(int[][] cells, int maximum)
{
for (int row_i = 0; row_i < 16; row_i++)
{
for (int col_i = 0; col_i < 16; col_i++)
{
int product = 1;
for (int i = 0; i < 4; i++)
{
product *= cells[row_i + i][col_i + i];
}
maximum = Math.Max(maximum, product);
}
}
return maximum;
}
static int GetMaximumForRightDiagonal(int[][] cells, int maximum)
{
for (int row_i = 3; row_i < 20; row_i++)
{
for (int col_i = 0; col_i < 16; col_i++)
{
int product = 1;
for (int i = 0; i < 4; i++)
{
product *= cells[row_i - i][col_i + i];
}
maximum = Math.Max(maximum, product);
}
}
return maximum;
}
// Helper function to convert string to number
// If grid element starts with '0' than we take only second digit
static int ParseGridNumber(string word)
{
if (word[0] == '0')
{
return int.Parse(word.Substring(1));
}
else
{
return int.Parse(word);
}
}
}
Task Title
A permutation is an ordered arrangement of objects . for example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. if all of the permutations are listed numerically or alphabetically, we call it lexicographic order . The lexicographic permutations of 0, 1 and 2 are:
012 021 102 120 201 210
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 ?
user solution
using System;
using System.Collections.Generic;
class Program
{
// Precalculated factorial values from 0 to 10
static int[] fac = new int[] { 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880 };
static void Main()
{
var permutation = CalculatePermutation(1000000);
Console.WriteLine(permutation);
}
static string CalculatePermutation(int n)
{
List<int> arr = new List<int> { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
string permutationResult = "";
n--;
for (int i = arr.Count - 1; i >= 0; i--)
{
int selectedIndex = n / fac[i];
n %= fac[i];
permutationResult += arr[selectedIndex].ToString();
arr.RemoveAt(selectedIndex);
}
return permutationResult;
}
}
Task Title
The decimal number, 585 = 1001001001 (binary), is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include leading zeros.)
user solution
using System;
class Program
{
const int n = 1000000;
const int k = 2;
static void Main()
{
int sum = SumPalindrome(n, k);
Console.WriteLine(sum);
}
static string IntegerToString(int n, int targetBase)
{
string str = "";
while (n > 0)
{
int digit = n % targetBase;
n /= targetBase;
str = (char)(digit + '0') + str;
}
return str;
}
static int IsPalindrome(int i, int k)
{
int temp = i;
int reversedNumber = 0;
while (temp > 0)
{
reversedNumber = temp % 10 + reversedNumber * 10;
temp /= 10;
}
if (reversedNumber == i)
{
string str = IntegerToString(reversedNumber, k);
string strReversed = ReverseString(str);
if (str == strReversed)
{
return i;
}
}
return 0;
}
static string ReverseString(string s)
{
char[] charArray = s.ToCharArray();
Array.Reverse(charArray);
return new string(charArray);
}
static int SumPalindrome(int n, int k)
{
int sum = 0;
for (int i = 1; i < n; i++)
{
sum += IsPalindrome(i, k);
}
return sum;
}
}
Smarter hiring with AI
Project: Project Passport Description: Project management system, designed specifically for Luxoft projects, empowers teams to seamlessly oversee the entire lifecycle of individual projects while ofering seamless integration capabilities with other essential Luxoft systems. With Project Passport solution, you can eficiently plan, execute, and track projects, ensuring streamlined collaboration and enhanced project success Tasks performed: • Development both BackEnd and Frontend • Writing Unit Tests, Integration Tests on BackEnd via XUnit, NSubstitute • Designed and implemented tasks with very high code quality, clean code principles and advanced software design practices and patterns Technologies: .Net, Angular, NHibernate, RXJS, Azure, XUnit, MSSQL Server, Custom BSS Framework, BizTalk, RabbitMQ,
Project: FDTR-CLM Description: Custom tool development for FoodTruck Inc. Contract Management Tasks performed: • Development both BackEnd and Frontend from scratch • Writing Unit Tests on BackEnd via XUnit • Participating in SCRUM development workflow Technologies: Asp.Net Core, Angular, EntityFramework, RXJS, Azure, XUnit, MSSQL Server, MongoDb
Project: Mirror Universe Description: Game development platform Tasks performed: • Frontend development including Server-Side-Rendering • Writing Unit Tests using Jest • Integrating and analyzing analytics with PostHog • Database queries optimization • CI/CD integration using Github Actions and Docker Technologies: React, NestJS, Prisma, Socket.IO, PostgreSQL, AWS, Material UI, Redux, MobX, Formik, TypeScript, NextJS, PostHog
Project: AvaPartner Description: Worldwide PRM system with more than 200.000 afiliates Tasks performed: • Development • Managing Alpha • Providing ideas for improvement code quality and architecture • Inventing code-style conventions • Improving workflow with SCRUM features • Writing Unit Tests on Jasmine and Cucumber Technologies: Asp.Net Core 2.0, MSSQL Server, MongoDB, Centos7, Docker, Angular 10, Angular Material, RXJS, Docker
Project: Knowledge System Description: System with complicated logic based on generic metadata and reflection that allows students to learn efectively through an automated learning process Tasks performed: • Heavily involved in and did a big part of making the system to be able to automatically configure views and behavior based on the metadata of an entity • Implemented generic metadata approach for testing, developed a subsystem which would automatically test entities based on metadata Technologies: ASP.NET CORE, ASP.NET Core Identity, EF Core, PostgreSQL, Angular 8, Angular Material, Selenium WebDriver, Protractor, Karma, SonarQube, Docker
Project: Model Training Service Description: A system that enables automated visual inspection of product quality using artificial intelligence. Tasks performed: • Design and development of a multifunctional generic table for storing and processing model data that had a tree structure • Writing Unit Tests, Integration Tests on BackEnd via Jest • Writing documentation for testers and manual testing of functionality • Development and integration of microservices Technologies: Docker, React, NestJS, Socket.IO, TypeORM, MySQL, Azure, Material UI, Redux, MobX, Formik, TypeScript, Microservices
The most incredible thing about technological developments is that with more innovation comes more problems that can be solved. Today, AI and Machine Learning are some of the most popular areas in IT because of the endless possibilities they offer.
We need to introduce innovative ideas and ways of doing things so that we can improve and grow. One way of doing this is to look at the most recent technologies and see how they can make our products or services better.
Full Stack Developer, Azure Solution Developer (Remote)
09/01/2021 - 12/01/2023As a Full Stack Developer and Azure Solution Developer at Navetor Private Limited since September 2021, I've been actively involved in significant responsibilities related to Neogen Solutions health Safety Group in the USA. Neogen provides solutions for the food processing, animal protein, and agriculture industries, including health and safety devices like Accupoint Advanced Next Generation and 3M food microbiology and pathogen detection testing. In my role, I've taken on the following responsibilities: Technical Lead for full analysis, design, build, and deployment. Leading Full Stack development (WPF, C#, .Net, Metro Controls). Implementing Microservices architecture, Azure API Management. Managing Azure IoT Devices Connectivity and Telemetry Collections. Utilizing Azure PaaS, SaaS services (App Service, Key Vault). Developing .Net Core Restful API with Automated Swagger Documentation. Employing GitLab Repos with Git-Flow branching strategy. Managing Release Management for Staging, Production, and Test Builds, CI/CD using Azure Pipelines. Leveraging Azure Cloud App Services, Azure Active Directory, Key Vaults, SQL Database, VM. These activities contribute to the effective functioning and technological advancement of Neogen's health and safety solutions.
Task Title
Work out the first ten digits of the sum of the following one - hundred 50 - digit numbers .
37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
91942213363574161572522430563301811072406154908250
23067588207539346171171980310421047513778063246676
89261670696623633820136378418383684178734361726757
28112879812849979408065481931592621691275889832738
44274228917432520321923589422876796487670272189318
47451445736001306439091167216856844588711603153276
70386486105843025439939619828917593665686757934951
62176457141856560629502157223196586755079324193331
64906352462741904929101432445813822663347944758178
92575867718337217661963751590579239728245598838407
58203565325359399008402633568948830189458628227828
80181199384826282014278194139940567587151170094390
35398664372827112653829987240784473053190104293586
86515506006295864861532075273371959191420517255829
71693888707715466499115593487603532921714970056938
54370070576826684624621495650076471787294438377604
53282654108756828443191190634694037855217779295145
36123272525000296071075082563815656710885258350721
45876576172410976447339110607218265236877223636045
17423706905851860660448207621209813287860733969412
81142660418086830619328460811191061556940512689692
51934325451728388641918047049293215058642563049483
62467221648435076201727918039944693004732956340691
15732444386908125794514089057706229429197107928209
55037687525678773091862540744969844508330393682126
18336384825330154686196124348767681297534375946515
80386287592878490201521685554828717201219257766954
78182833757993103614740356856449095527097864797581
16726320100436897842553539920931837441497806860984
48403098129077791799088218795327364475675590848030
87086987551392711854517078544161852424320693150332
59959406895756536782107074926966537676326235447210
69793950679652694742597709739166693763042633987085
41052684708299085211399427365734116182760315001271
65378607361501080857009149939512557028198746004375
35829035317434717326932123578154982629742552737307
94953759765105305946966067683156574377167401875275
88902802571733229619176668713819931811048770190271
25267680276078003013678680992525463401061632866526
36270218540497705585629946580636237993140746255962
24074486908231174977792365466257246923322810917141
91430288197103288597806669760892938638285025333403
34413065578016127815921815005561868836468420090470
23053081172816430487623791969842487255036638784583
11487696932154902810424020138335124462181441773470
63783299490636259666498587618221225225512486764533
67720186971698544312419572409913959008952310058822
95548255300263520781532296796249481641953868218774
76085327132285723110424803456124867697064507995236
37774242535411291684276865538926205024910326572967
23701913275725675285653248258265463092207058596522
29798860272258331913126375147341994889534765745501
18495701454879288984856827726077713721403798879715
38298203783031473527721580348144513491373226651381
34829543829199918180278916522431027392251122869539
40957953066405232632538044100059654939159879593635
29746152185502371307642255121183693803580388584903
41698116222072977186158236678424689157993532961922
62467957194401269043877107275048102390895523597457
23189706772547915061505504953922979530901129967519
86188088225875314529584099251203829009407770775672
11306739708304724483816533873502340845647058077308
82959174767140363198008187129011875491310547126581
97623331044818386269515456334926366572897563400500
42846280183517070527831839425882145521227251250327
55121603546981200581762165212827652751691296897789
32238195734329339946437501907836945765883352399886
75506164965184775180738168837861091527357929701337
62177842752192623401942399639168044983993173312731
32924185707147349566916674687634660915035914677504
99518671430235219628894890102423325116913619626622
73267460800591547471830798392868535206946944540724
76841822524674417161514036427982273348055556214818
97142617910342598647204516893989422179826088076852
87783646182799346313767754307809363333018982642090
10848802521674670883215120185883543223812876952786
71329612474782464538636993009049310363619763878039
62184073572399794223406235393808339651327408011116
66627891981488087797941876876144230030984490851411
60661826293682836764744779239180335110989069790714
85786944089552990653640447425576083659976645795096
66024396409905389607120198219976047599490197230297
64913982680032973156037120041377903785566085089252
16730939319872750275468906903707539413042652315011
94809377245048795150954100921645863754710598436791
78639167021187492431995700641917969777599028300699
15368713711936614952811305876380278410754449733078
40789923115535562561142322423255033685442488917353
44889911501440648020369068063960672322193204149535
41503128880339536053299340368006977710650566631954
81234880673210146739058568557934581403627822703280
82616570773948327592232845941706525094512325230608
22918802058777319719839450180888072429661980811197
77158542502016545090413245809786882778948721859617
72107838435069186155435662884062257473692284509516
20849603980134001723930671666823555245252804609722
53503534226472524250874054075591789781264330331690
user solution
using System;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
namespace questionnaire
{
public class Program
{
public static string AddNumStr(string v1, string v2)
{
var v1Len = v1.Length;
var v2Len = v2.Length;
var count = Math.Max(v1Len, v2Len);
var answ = new char[count + 1];
while (count >= 0) answ[count--] = (char)((v1Len > 0 ? v1[--v1Len] & 0xF : 0) + (v2Len > 0 ? v2[--v2Len] & 0xF : 0));
for (var i = answ.Length - 1; i >= 0; i--)
{
if (answ[i] > 9)
{
answ[i - 1]++;
answ[i] -= (char)10;
}
answ[i] = (char)(answ[i] | 48);
}
return new string(answ).TrimStart('0');
}
static void Main(string[] args)
{
string data = "37107287533902102798797998220837590246510135740250 46376937677490009712648124896970078050417018260538 74324986199524741059474233309513058123726617309629 91942213363574161572522430563301811072406154908250 23067588207539346171171980310421047513778063246676 89261670696623633820136378418383684178734361726757 28112879812849979408065481931592621691275889832738 44274228917432520321923589422876796487670272189318 47451445736001306439091167216856844588711603153276 70386486105843025439939619828917593665686757934951 62176457141856560629502157223196586755079324193331 64906352462741904929101432445813822663347944758178 92575867718337217661963751590579239728245598838407 58203565325359399008402633568948830189458628227828 80181199384826282014278194139940567587151170094390 35398664372827112653829987240784473053190104293586 86515506006295864861532075273371959191420517255829 71693888707715466499115593487603532921714970056938 54370070576826684624621495650076471787294438377604 53282654108756828443191190634694037855217779295145 36123272525000296071075082563815656710885258350721 45876576172410976447339110607218265236877223636045 17423706905851860660448207621209813287860733969412 81142660418086830619328460811191061556940512689692 51934325451728388641918047049293215058642563049483 62467221648435076201727918039944693004732956340691 15732444386908125794514089057706229429197107928209 55037687525678773091862540744969844508330393682126 18336384825330154686196124348767681297534375946515 80386287592878490201521685554828717201219257766954 78182833757993103614740356856449095527097864797581 16726320100436897842553539920931837441497806860984 48403098129077791799088218795327364475675590848030 87086987551392711854517078544161852424320693150332 59959406895756536782107074926966537676326235447210 69793950679652694742597709739166693763042633987085 41052684708299085211399427365734116182760315001271 65378607361501080857009149939512557028198746004375 35829035317434717326932123578154982629742552737307 94953759765105305946966067683156574377167401875275 88902802571733229619176668713819931811048770190271 25267680276078003013678680992525463401061632866526 36270218540497705585629946580636237993140746255962 24074486908231174977792365466257246923322810917141 91430288197103288597806669760892938638285025333403 34413065578016127815921815005561868836468420090470 23053081172816430487623791969842487255036638784583 11487696932154902810424020138335124462181441773470 63783299490636259666498587618221225225512486764533 67720186971698544312419572409913959008952310058822 95548255300263520781532296796249481641953868218774 76085327132285723110424803456124867697064507995236 37774242535411291684276865538926205024910326572967 23701913275725675285653248258265463092207058596522 29798860272258331913126375147341994889534765745501 18495701454879288984856827726077713721403798879715 38298203783031473527721580348144513491373226651381 34829543829199918180278916522431027392251122869539 40957953066405232632538044100059654939159879593635 29746152185502371307642255121183693803580388584903 41698116222072977186158236678424689157993532961922 62467957194401269043877107275048102390895523597457 23189706772547915061505504953922979530901129967519 86188088225875314529584099251203829009407770775672 11306739708304724483816533873502340845647058077308 82959174767140363198008187129011875491310547126581 97623331044818386269515456334926366572897563400500 42846280183517070527831839425882145521227251250327 55121603546981200581762165212827652751691296897789 32238195734329339946437501907836945765883352399886 75506164965184775180738168837861091527357929701337 62177842752192623401942399639168044983993173312731 32924185707147349566916674687634660915035914677504 99518671430235219628894890102423325116913619626622 73267460800591547471830798392868535206946944540724 76841822524674417161514036427982273348055556214818 97142617910342598647204516893989422179826088076852 87783646182799346313767754307809363333018982642090 10848802521674670883215120185883543223812876952786 71329612474782464538636993009049310363619763878039 62184073572399794223406235393808339651327408011116 66627891981488087797941876876144230030984490851411 60661826293682836764744779239180335110989069790714 85786944089552990653640447425576083659976645795096 66024396409905389607120198219976047599490197230297 64913982680032973156037120041377903785566085089252 16730939319872750275468906903707539413042652315011 94809377245048795150954100921645863754710598436791 78639167021187492431995700641917969777599028300699 15368713711936614952811305876380278410754449733078 40789923115535562561142322423255033685442488917353 44889911501440648020369068063960672322193204149535 41503128880339536053299340368006977710650566631954 81234880673210146739058568557934581403627822703280 82616570773948327592232845941706525094512325230608 22918802058777319719839450180888072429661980811197 77158542502016545090413245809786882778948721859617 72107838435069186155435662884062257473692284509516 20849603980134001723930671666823555245252804609722 53503534226472524250874054075591789781264330331690";
string[] dataArray = data.Split(' ');
string allSum = dataArray[0];
for (var i=1; i < dataArray.Length ; i++)
{
allSum = AddNumStr(allSum, dataArray[i]);
}
Console.WriteLine(allSum.Substring(0, 10));
}
}
}
Task Title
Let d(n) be defined as the sum of proper divisors of n(numbers less than n which divide evenly into n).
if d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers .
for example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
user solution
using System;
using System.Collections.Generic;
using System.Linq;
public class Program
{
public static uint MAX_VALUE = 10000;
public static uint sum_of_factors(uint n)
{
uint sum = 1;
uint i = 2;
for (; i < n / i; ++i)
{
if (n / i * i == n)
{
sum += i + n / i;
}
}
if (i * i == n)
sum += i; /* add square root only once */
return sum;
}
public static void Main()
{
List<Int64> amicableList = new List<Int64>();
for (uint num1 = 1; num1 <= MAX_VALUE; ++num1)
{
uint num2 = sum_of_factors(num1);
if (num2 > num1 && num1 == sum_of_factors(num2))
{
amicableList.Add(num1);
amicableList.Add(num2);
// Console.WriteLine("{0}\t\t{1}", num1, num2);
}
}
var totalSum = amicableList.Sum();
Console.WriteLine(totalSum);
}
}
Task Title
The sequence of triangle numbers is generated by adding the natural numbers . So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors of the first seven triangle numbers:
1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28
We can see that 28 is the first triangle number to have over five divisors .
What is the value of the first triangle number to have over five hundred divisors ?
user solution
using System;
using System.Collections.Generic;
using System.Linq;
public class Program
{
/// <summary>
/// Listing all numbers comes under Triangular series.
/// </summary>
/// <param name="number"></param>
/// <returns></returns>
public static List<int> GetTriangularNumbers(int number)
{
List<int> lstTriangularNumbers = new List<int>();
int i;
int sum = 0;
int triangularNumber = 0;
for (i = 1; i < number; i++)
{
sum = sum + i;
triangularNumber = sum;
lstTriangularNumbers.Add(triangularNumber);
}
return lstTriangularNumbers;
}
/// <summary>
/// returns(count) the number of factors for each number
/// </summary>
/// <param name="number"></param>
/// <returns></returns>
public static int FactorCount(int number)
{
List<int> factors = new List<int>();
int max = (int)Math.Sqrt(number); //round down
for (int factor = 1; factor <= max; ++factor)
{
//test from 1 to the square root, or the int below it, inclusive.
if (number % factor == 0)
{
factors.Add(factor);
if (factor != number / factor)
{
// Don't add the square root twice!
factors.Add(number / factor);
}
}
}
return factors.Count;
}
static void Main(string[] args)
{
List<int> lstTriangularNumbers = new List<int>();
List<int> factors = new List<int>();
int count = 0;
//Getting the list of numbers comes under triangular series till 5000
lstTriangularNumbers = GetTriangularNumbers(50000);
foreach (int number in lstTriangularNumbers)
{
/*
* Calling the FactorCount(number) function to check no of factors
* available for the specific triangular number - number.
*/
count = FactorCount(number);
//Console.WriteLine("No of factors for : " + number + " is : " + count);
if (count >= 500)
{
//Console.WriteLine("No of factors for first Triangular Number : " + number + " is : " + count);
Console.WriteLine(number);
break;
}
}
Console.ReadLine();
}
}
Task Title
n!means n ×(n − 1) × ... × 3 × 2 × 1
for example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
and the sum of the digits in the number 10!is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.
Find the sum of the digits in the number 100!
user solution
using System;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
namespace questionnaire
{
public class Program
{
// Multiplies str1 and str2, and prints result.
public static String multiply(String num1, String num2)
{
int len1 = num1.Length;
int len2 = num2.Length;
if (len1 == 0 || len2 == 0)
return "0";
// will keep the result number in vector
// in reverse order
int[] result = new int[len1 + len2];
// Below two indexes are used to
// find positions in result.
int i_n1 = 0;
int i_n2 = 0;
int i;
// Go from right to left in num1
for (i = len1 - 1; i >= 0; i--)
{
int carry = 0;
int n1 = num1[i] - '0';
// To shift position to left after every
// multipliccharAtion of a digit in num2
i_n2 = 0;
// Go from right to left in num2
for (int j = len2 - 1; j >= 0; j--)
{
// Take current digit of second number
int n2 = num2[j] - '0';
// Multiply with current digit of first number
// and add result to previously stored result
// charAt current position.
int sum = n1 * n2 + result[i_n1 + i_n2] + carry;
// Carry for next itercharAtion
carry = sum / 10;
// Store result
result[i_n1 + i_n2] = sum % 10;
i_n2++;
}
// store carry in next cell
if (carry > 0)
result[i_n1 + i_n2] += carry;
// To shift position to left after every
// multipliccharAtion of a digit in num1.
i_n1++;
}
// ignore '0's from the right
i = result.Length - 1;
while (i >= 0 && result[i] == 0)
i--;
// If all were '0's - means either both
// or one of num1 or num2 were '0'
if (i == -1)
return "0";
// genercharAte the result String
String s = "";
while (i >= 0)
s += (result[i--]);
return s;
}
static void Main(string[] args)
{
string factorial = "1";
int number=100;
for (int i = 1; i <= number; i++)
{
//factorial = factorial * i;
factorial = multiply(factorial,i.ToString());
}
var sum= factorial.ToString().ToCharArray().Select(x => int.Parse(x.ToString())).Sum();
Console.Write(sum);
}
}
}
Task Title
A unit fraction contains 1 in the numerator . The decimal representation of the unit fractions with denominators 2 to 10 are given:
1 / 2
=
0.5
1 / 3
=
0.(3)
1 / 4
=
0.25
1 / 5
=
0.2
1 / 6
=
0.1(6)
1 / 7
=
0.(142857)
1 / 8
=
0.125
1 / 9
=
0.(1)
1 / 10
=
0.1
Where 0.1(6) means 0.166666..., and has a 1 - digit recurring cycle . It can be seen that 1 / 7 has a 6 - digit recurring cycle .
Find the value of d < 1000 for which 1 / d contains the longest recurring cycle in its decimal fraction part .
user solution
using System;
using System.Collections.Generic;
public class Program
{
public static int Reciprocal(int d)
{
var hash = new Dictionary<int, int>();
int x = 1, i = 0;
while (x != 0)
{
i++;
x *= 10;
int y = x / d;
if (!hash.ContainsKey(x))
{
hash[x] = i;
}
else
{
return i - hash[x];
}
x = x % d;
}
return 0;
}
public static void Main()
{
int ans = 1, v = 0;
for (int d = 1; d < 1000; d++)
{
int r = Reciprocal(d);
if (r >= v)
{
v = r;
ans = d;
}
}
Console.WriteLine(ans);
}
}
Smarter hiring with AI
Neogen Solutions health Safety Group (USA) Full Stack Developer, Azure Solution Developer (Remote) Neogen provides a comprehensive range of solutions and services for the food processing, animal protein and agriculture industries . Health and safety solutions include range of devices like Accupoint Advanced Next Generation for surface hygiene and 3M food microbiology and pathogen detection testing and monitoring. 3M Molecular Diagnostics System another pathogen detection device using LAMP light transmission technology to assess the surface hygiene. Responsibilities: Technical Lead Full analysis and design build and deployment. Full Stack development lead ( WPF C# .Net, Metro Controls ) Microservices architecture, Azure A PI Management . Azure IOT Devices Connectivity and Telemetry C ollections. Azure PaaS , SaaS services App Service, Key Vault .Net Core Restful API with Automated Swagger Documentation, Client, Thunder Client, Postman GitLab Repos Git-Flow branching strategy. Release Management Stagging, Production and Test Builds, CI/CD Azure Pipelines. Azure Cloud App Services, Azure Active Directory, Key Vaults, SQL Database, VM
Fuse, cloud-based practice management software, is designed to provide dental practices the flexibility to evolve, scale, and simplify the way they manage their business. With functionality that seamlessly connects all practice locations, you can improve the patient experience, work in a more intuitive way and quickly track performance and act on business insights. From front office administration to clinical processes and business operations, Fuse is the intuitive solution, backed by the unrivaled support of Patterson Dental, that dental offices choose to elevate multi-location administration and performance Responsibilities: Technical Lead Full analysis and design build and deployment. Full Stack development lead (.Net Core/ Angular 12 TS, Kendo-UI, Material-UI, Custom Controls Docker, Docker file, Docker Compose . Patients Invoices Statements Batch Processing Module, HL7 V2, V3 Message Processing. Lab Interfacing and Integrations Firebase (LabCorp, Sunrise, AccuLab) Service broker Azure Service Bus, Kubernetes clusters RabbitMQ , GrPc, Ingress NginX Azure PaaS services App Service, Key Vault, Serverless functions, Azure Service Bus, Functions 3.0. API Management Angular 11 TypeScript, Material UI &Bootstrap, Webpack, JWT Tokenization .Net Core Restful API with Automated Swagger Documentation, Client, Thunder Client, Postman GitLab Repos Git-Flow branching strategy. Release Management Stagging, Production and Test Builds, CI/CD Azure Pipelines. Azure Cloud App Services, Azure Active Directory, Key Vaults, SQL Database, VM Azure DevOps Test automation xUnit framework.
ITIM private limited is a UK based European retailing Software providers. Have numbers of client across UK and European countries, TRS retail suite provide POS and product management suit written in Microsoft Asp.Net and .Net Core and multiple applications and modules. Responsibilities: Appointed to re-set the overall vision and product experience. Managed the requirement gathering, conception/prototyping, UX and design, and front-end build. Responsible for managing the client relationship, working closely with backend development team and AWS Cloud team. Responsible for software design, modelling, user story and process mapping with continuous integration business model. Project planning, writing user stories concluding story points, and uses sprint approach which led to immediate results and success. Work closely with UK based client and business analyst to develop detail program plan, agile processes, regular communications, and deliverable tracking. Design, analysis, and documentation. This includes analysis and design, object-oriented analysis, class diagrams, object diagrams, Database diagram and documents all these design phase analysis work.
Aldar properties deals in real estate, developments include retail malls, academies, and communities shopping malls. IC- Portal is a cloud web-based application, which helps organization to assess, review and track new project leads and initiatives. Strict business process must be followed to achieve decision which are made through feedbacks and collaboration between stockholders, project team and IC-committee members. Responsibilities: Technical Lead Full analysis and design including Storyboarding and requirement capturing Agile Scrum Project Management using Azure Boards. Angular 11 TypeScript, Material UI &Bootstrap, Webpack, JWT Tokenization .Net Core Restful API with Automated Swagger Documentation, Client, Thunder Client, Postman GitLab Repos Git-Flow branching strategy. Release Management Stagging, Production and Test Builds, CI/CD Azure Pipelines. Azure Cloud App Services, Azure Active Directory, Key Vaults, SQL Database, VM Azure DevOps Test automation xUnit framework. Entity Framework Core, T-SQL stored procedures SQL Databases.
Wedgewood is an integrated network of companies concentrated on real estate opportunities. It is web-based product called Minerva built using Asp.net web forms, SharePoint documents and Image Libraries and RDLC reports for reporting and currently working on phase 2 called Minerva 2 which we are developing using Angular11 with kendo UI. Responsibilities: Microsoft Azure cloud formation. Infrastructure provisioning. Microsoft Azure DevOps CI/CD YML based Pipeline. Azure Repos Git-Flow branching strategy, Release management Stagging, Production Test builds Azure DevOps Test automation UI test using nUNit and Selenium
ITIM private limited is a UK based European retailing Software providers. Have numbers of client across UK and European countries, TRS retail suite provide POS and product management suit written in Microsoft Asp.Net and .Net Core and multiple applications and modules. Responsibilities: • Appointed to re-set the overall vision and product experience. Managed the requirement gathering, conception/prototyping, UX and design, and front-end build. Responsible for managing the client relationship, working closely with backend development team and AWS Cloud team. • Responsible for software design, modelling, user story and process mapping with continuous integration business model. Project planning, writing user stories concluding story points, and uses sprint approach which led to immediate results and success. • Work closely with UK based client and business analyst to develop detail program plan, agile processes, regular communications, and deliverable tracking. • Design, analysis, and documentation. This includes analysis and design, object-oriented analysis, class diagrams, object diagrams, Database diagram and documents all these design phase analysis work.
The Verifone is a global leader in providing customer payment processing have hundreds of clients across globe. Developer Central is an online portal where developers can access payment services SDK, developers Kit and documentation.
Bespoke Payment Administration System using C# ASP.Net 3.5, LINQ, jQuery, Ajax, Telerik Kendo MVC Controls, WCF Services, N-Cache, Dot-Trace ReSharper 6, Fiddler 2.0, Dot-Tace Memory Profiler 2.0, N-Unit Testing, PCI-DSS Compliance 2- factor Authentication Security and SQL Server 2008 stored procedure. Responsibilities: Developing multi language/culture payment service administration module using C # Asp.net 3.5, designed complete architecture and services layers pattern. Built a separate Custom based tool to input data for multi culture languages PCI-DSS compliance 2 factors authentication security and requirements implementation in system and integration.
We need to introduce innovative ideas and ways of doing things so that we can improve and grow. One way of doing this is to look at the most recent technologies and see how they can make our products or services better.
Whilst it could be an enriching experience, there are some disadvantages to space tourism. Many critics have commented that a huge growth in the spaceflight industry could drastically speed up the process of global warming.
Full Stack Developer
05/01/2020 - 12/01/2023Led seamless migration to modern .NET platform, cutting maintenance costs by 40% and enhancing system performance. Collaborated cross-functionally to implement strategic changes for a smooth transition. Led migration to modern .NET platform, reducing maintenance costs by 40% and improving system performance. Expertly integrated a third-party API into a .NET application, enhancing user features and functionalities. Developed custom integration components using C# and Visual Studio, ensuring seamless assimilation with the existing system. The result: increased user satisfaction and a boost in company revenue.
Task Title
n!means n ×(n − 1) × ... × 3 × 2 × 1
for example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
and the sum of the digits in the number 10!is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.
Find the sum of the digits in the number 100!
user solution
using System;
class Program
{
static void Main()
{
int[] result = CalculateFactorial(100);
int sumOfDigits = SumDigits(result);
Console.WriteLine($"{sumOfDigits}");
}
static int[] CalculateFactorial(int n)
{
int[] result = new int[200]; // Sufficient to hold 100!
result[0] = 1;
int resultSize = 1;
for (int i = 2; i <= n; i++)
{
resultSize = Multiply(result, resultSize, i);
}
Array.Reverse(result, 0, resultSize);
return result;
}
static int Multiply(int[] result, int resultSize, int x)
{
int carry = 0;
for (int i = 0; i < resultSize; i++)
{
int product = result[i] * x + carry;
result[i] = product % 10;
carry = product / 10;
}
while (carry > 0)
{
result[resultSize] = carry % 10;
carry /= 10;
resultSize++;
}
return resultSize;
}
static int SumDigits(int[] number)
{
int sum = 0;
for (int i = 0; i < number.Length; i++)
{
sum += number[i];
}
return sum;
}
}
Task Title
In the 20×20 grid below, four numbers along a diagonal line have been marked in red .
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
The product of these numbers is 26 × 63 × 78 × 14 = 1788696.
What is the greatest product of four adjacent numbers in the same direction(up, down, left, right, or diagonally) in the 20×20 grid ?
user solution
Task Title
Let d(n) be defined as the sum of proper divisors of n(numbers less than n which divide evenly into n).
if d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers .
for example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
user solution
using System;
class Program
{
static void Main()
{
int limit = 10000;
int[] divisorSums = new int[limit];
// Calculate the sum of proper divisors for each number up to the limit
for (int i = 1; i < limit; i++)
{
divisorSums[i] = SumOfDivisors(i);
}
int amicableSum = 0;
// Check for amicable numbers and accumulate their sum
for (int a = 1; a < limit; a++)
{
int b = divisorSums[a];
if (b != a && b < limit && divisorSums[b] == a)
{
amicableSum += a;
}
}
Console.WriteLine($"{amicableSum}");
}
static int SumOfDivisors(int n)
{
int sum = 1;
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
sum += i;
if (i != n / i)
{
sum += n / i;
}
}
}
return sum;
}
}
Task Title
Work out the first ten digits of the sum of the following one - hundred 50 - digit numbers .
37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
91942213363574161572522430563301811072406154908250
23067588207539346171171980310421047513778063246676
89261670696623633820136378418383684178734361726757
28112879812849979408065481931592621691275889832738
44274228917432520321923589422876796487670272189318
47451445736001306439091167216856844588711603153276
70386486105843025439939619828917593665686757934951
62176457141856560629502157223196586755079324193331
64906352462741904929101432445813822663347944758178
92575867718337217661963751590579239728245598838407
58203565325359399008402633568948830189458628227828
80181199384826282014278194139940567587151170094390
35398664372827112653829987240784473053190104293586
86515506006295864861532075273371959191420517255829
71693888707715466499115593487603532921714970056938
54370070576826684624621495650076471787294438377604
53282654108756828443191190634694037855217779295145
36123272525000296071075082563815656710885258350721
45876576172410976447339110607218265236877223636045
17423706905851860660448207621209813287860733969412
81142660418086830619328460811191061556940512689692
51934325451728388641918047049293215058642563049483
62467221648435076201727918039944693004732956340691
15732444386908125794514089057706229429197107928209
55037687525678773091862540744969844508330393682126
18336384825330154686196124348767681297534375946515
80386287592878490201521685554828717201219257766954
78182833757993103614740356856449095527097864797581
16726320100436897842553539920931837441497806860984
48403098129077791799088218795327364475675590848030
87086987551392711854517078544161852424320693150332
59959406895756536782107074926966537676326235447210
69793950679652694742597709739166693763042633987085
41052684708299085211399427365734116182760315001271
65378607361501080857009149939512557028198746004375
35829035317434717326932123578154982629742552737307
94953759765105305946966067683156574377167401875275
88902802571733229619176668713819931811048770190271
25267680276078003013678680992525463401061632866526
36270218540497705585629946580636237993140746255962
24074486908231174977792365466257246923322810917141
91430288197103288597806669760892938638285025333403
34413065578016127815921815005561868836468420090470
23053081172816430487623791969842487255036638784583
11487696932154902810424020138335124462181441773470
63783299490636259666498587618221225225512486764533
67720186971698544312419572409913959008952310058822
95548255300263520781532296796249481641953868218774
76085327132285723110424803456124867697064507995236
37774242535411291684276865538926205024910326572967
23701913275725675285653248258265463092207058596522
29798860272258331913126375147341994889534765745501
18495701454879288984856827726077713721403798879715
38298203783031473527721580348144513491373226651381
34829543829199918180278916522431027392251122869539
40957953066405232632538044100059654939159879593635
29746152185502371307642255121183693803580388584903
41698116222072977186158236678424689157993532961922
62467957194401269043877107275048102390895523597457
23189706772547915061505504953922979530901129967519
86188088225875314529584099251203829009407770775672
11306739708304724483816533873502340845647058077308
82959174767140363198008187129011875491310547126581
97623331044818386269515456334926366572897563400500
42846280183517070527831839425882145521227251250327
55121603546981200581762165212827652751691296897789
32238195734329339946437501907836945765883352399886
75506164965184775180738168837861091527357929701337
62177842752192623401942399639168044983993173312731
32924185707147349566916674687634660915035914677504
99518671430235219628894890102423325116913619626622
73267460800591547471830798392868535206946944540724
76841822524674417161514036427982273348055556214818
97142617910342598647204516893989422179826088076852
87783646182799346313767754307809363333018982642090
10848802521674670883215120185883543223812876952786
71329612474782464538636993009049310363619763878039
62184073572399794223406235393808339651327408011116
66627891981488087797941876876144230030984490851411
60661826293682836764744779239180335110989069790714
85786944089552990653640447425576083659976645795096
66024396409905389607120198219976047599490197230297
64913982680032973156037120041377903785566085089252
16730939319872750275468906903707539413042652315011
94809377245048795150954100921645863754710598436791
78639167021187492431995700641917969777599028300699
15368713711936614952811305876380278410754449733078
40789923115535562561142322423255033685442488917353
44889911501440648020369068063960672322193204149535
41503128880339536053299340368006977710650566631954
81234880673210146739058568557934581403627822703280
82616570773948327592232845941706525094512325230608
22918802058777319719839450180888072429661980811197
77158542502016545090413245809786882778948721859617
72107838435069186155435662884062257473692284509516
20849603980134001723930671666823555245252804609722
53503534226472524250874054075591789781264330331690
user solution
Task Title
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the factorial of their digits .
Note: as 1! = 1 and 2! = 2 are not sums they are not included .
user solution
using System;
class Program
{
static void Main()
{
int limit = 2540160; // Upper bound limit to search for curious numbers (7 * 9!)
int[] factorialCache = new int[10];
for (int i = 0; i < 10; i++)
{
factorialCache[i] = Factorial(i);
}
int sum = 0;
for (int n = 10; n <= limit; n++)
{
if (IsCuriousNumber(n, factorialCache))
{
sum += n;
}
}
Console.WriteLine($"{sum}");
}
static int Factorial(int n)
{
if (n == 0)
{
return 1;
}
int result = 1;
for (int i = 1; i <= n; i++)
{
result *= i;
}
return result;
}
static bool IsCuriousNumber(int n, int[] factorialCache)
{
int sumOfFactorialDigits = 0;
int originalN = n;
while (n > 0)
{
int digit = n % 10;
sumOfFactorialDigits += factorialCache[digit];
n /= 10;
}
return sumOfFactorialDigits == originalN;
}
}
Smarter hiring with AI
efficient, well-designed web applications adhering to industry best practices. I excel in both building and maintaining dynamic sites, emphasizing clean and high-performance code. Additionally, I handle error resolution and debugging to ensure a seamless user experience. Demonstrate pr oficiency in developing testable and reusable code, prioritizing performance and scalability considerations within the .NET ecosystem. Execute security enhancements for Magento projects and .NET applications, bolstering cybersecurity measures for robust pr otection. Provide expert guidance to online merchants in establishing compliant website storefronts and modules, integrating seamlessly with the .NET technology stack. Incorporate composer modules seamlessly, connecting with third-party ERPs, payment gateways, and shipping methods, while also harnessing the capabilities of the .NET Framework. Effectively leverage Laravel, Codeigniter , and Magento frameworks alongside .NE T Framework to engineer customized websites and applications, with a steadfast commitment to industry best practices. Coordinate seamless website deployment via Bitbucket Pipelines, introducing CI/CD for automated release processes within the .NET environm ent. Optimize website performance through strategic implementation of CDNs like Cloudflare, Varnish, Redis, and full-page caching, integrating seamlessly with the .NET architecture. Facilitate collaboration among development, business, and QA teams using p roject management tools like JIRA, Monday.com, and Trello, while incorporating .NET technologies. Proactively lead .NET Framework upgrades, apply patches, and conduct thorough code reviews with comprehensive documentation. Contribute to the enhancement of existing business procedures by crafting SQL scripts for database scrubbing and refinement, integrating seamlessly with .NET databases.
As a seasoned Senior Developer, my wealth of expertise has been cultivated through extensive collaboration within multifaceted teams on a multitude of projects, with a primary focus on .NET Framework. My close partnership with project managers, designers, and fellow developers has played a pivotal role in ensuring the punctual delivery of high-quality projects. As a seasoned Senior Developer, m y wealth of expertise has been cultivated through extensive collaboration within multifaceted teams on a multitude of projects, with a primary focus on .NET Framework. My close partnership with project managers, designers, and fellow developers has played a pivotal role in ensuring the punctual delivery of high-quality projects. In the .NET Framework domain, I seamlessly integrated APIs with third-party services, spanning payment gateways, email platforms, and social media channels. As a leader, I spearhead ed the design and implementation of database schemas, data models, and queries, backed by detailed technical documentation and user manuals. My commitment to staying abreast of the latest .NET development trends empowered me to enhance system capabilities effectively. Managing and creating composer packages and patches for third-party vendor modules was a key responsibility, elevating overall performance and functionality within the .NET ecosystem. Strategic application of Redis and Varnish played a crucial role in boosting scalability and performance within expansive .NET applications. Proficiency extended to diverse databases, including Oracle, MariaDB, and MySQL, handling tasks from schema creation to complex query development and database maintenance wit hin the .NET Framework.
In the long run, by embracing positive feedback, you can not only enhance working performance but also enrich the quality of life in the workplace.
We need to introduce innovative ideas and ways of doing things so that we can improve and grow. One way of doing this is to look at the most recent technologies and see how they can make our products or services better.
SENIOR SOFTWARE ENGINEER | FREELANCER
10/01/2021 - 12/01/2023As a senior software engineer, I have successfully completed 10 projects on Upwork, demonstrating my proficiency in development, maintenance, and optimization. My focus lies in building robust and scalable applications that are customized to meet the specific needs of each client. With extensive experience in technologies like Microsoft Orleans, ML.NET, ASP.NET, Angular, ReactJS, MongoDB, MSSQL Server, and cloud services, I consistently deliver modern and competitive solutions that foster innovation.
Task Title
if the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total .
if all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used ?
NOTE: do not count spaces or hyphens . for example, 342 (three hundred and forty - two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters . The use of "and" when writing out numbers is in compliance with British usage .
user solution
using System;
namespace ConsoleApp1
{
class Program
{
public static string[] units = { "Zero", "One", "Two", "Three",
"Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven",
"Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen",
"Seventeen", "Eighteen", "Nineteen" };
public static string[] tens = { "", "", "Twenty", "Thirty", "Forty",
"Fifty", "Sixty", "Seventy", "Eighty", "Ninety" };
static void Main(string[] args)
{
int mylength = 0;
for (int i = 1; i <= 1000; i++)
{
mylength += Convert(i).Length;
}
Console.WriteLine(mylength);
}
public static string Convert(int i)
{
if (i < 20)
{
return units[i];
}
if (i < 100)
{
return (tens[i / 10] + ((i % 10 > 0) ? "" + Convert(i % 10) : ""));
}
else if (i < 1000)
{
string temp = (units[i / 100] + "Hundred"
+ ((i % 100 > 0) ? "And" + Convert(i % 100) : ""));
return (units[i / 100] + "Hundred"
+ ((i % 100 > 0) ? "And" + Convert(i % 100) : ""));
}
else {
return "onethousand";
}
}
}
}
Task Title
The series, 1^1 + 2^2 + 3^3 + ... +10^10 = 10405071317.
Find the last ten digits of the series, 1^1 + 2^2 + 3^3 + ... +1000^1000.
user solution
using System;
namespace ConsoleApp2
{
class Program
{
static void Main(string[] args)
{
long sum = 0;
long mod = 10000000000;
for (long i = 1; i <= 1000; i++)
{
long power = i;
for (long j = 1; j < i; j++)
{
power = (power * i) % mod;
}
sum = (sum + power) % mod;
}
Console.WriteLine(sum);
}
}
}
Task Title
A permutation is an ordered arrangement of objects . for example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. if all of the permutations are listed numerically or alphabetically, we call it lexicographic order . The lexicographic permutations of 0, 1 and 2 are:
012 021 102 120 201 210
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 ?
user solution
using System;
using System.Linq;
namespace ConsoleApp3
{
class Program
{
static void Main(string[] args)
{
Console.WriteLine(GetNthPermutation(999999));
}
public static string GetNthPermutation(int n)
{
int[] numbers = Enumerable.Range(0, 10).ToArray();
int[] factorials = new int[] { 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880 };
string result = "";
for (int i = 9; i >= 0; i--)
{
int index = n / factorials[i];
n -= index * factorials[i];
result += numbers[index].ToString();
numbers = numbers.Where((val, idx) => idx != index).ToArray();
}
return result;
}
}
}
Task Title
Let d(n) be defined as the sum of proper divisors of n(numbers less than n which divide evenly into n).
if d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers .
for example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
user solution
using System;
using System.Linq;
namespace ConsoleApp3
{
class Program
{
static void Main(string[] args)
{
int sum = 0;
for (int i = 1; i < 10000; i++)
{
int a = SumOfProperDivisors(i);
if (a != i && SumOfProperDivisors(a) == i)
{
sum += i;
}
}
Console.WriteLine(sum);
}
static int SumOfProperDivisors(int n)
{
int sum = 0;
for (int i = 1; i < n; i++)
{
if (n % i == 0)
{
sum += i;
}
}
return sum;
}
}
}
Task Title
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime .
There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
How many circular primes are there below one million ?
user solution
using System;
using System.Linq;
namespace ConsoleApp3
{
class Program
{
static void Main(string[] args)
{
int count = 0;
for (int i = 2; i < 1000000; i++)
{
if (IsCircularPrime(i))
{
count++;
}
}
Console.WriteLine(count);
}
static bool IsCircularPrime(int n)
{
if (!IsPrime(n))
{
return false;
}
string s = n.ToString();
for (int i = 1; i < s.Length; i++)
{
s = s[s.Length - 1] + s.Substring(0, s.Length - 1);
if (!IsPrime(int.Parse(s)))
{
return false;
}
}
return true;
}
static bool IsPrime(int n)
{
if (n < 2)
{
return false;
}
for (int i = 2; i <= Math.Sqrt(n); i++)
{
if (n % i == 0)
{
return false;
}
}
return true;
}
}
}
Smarter hiring with AI
• As a senior software engineer, I have successfully completed 10 projects on Upwork, demonstrating my proficiency in development, maintenance, and optimization. My focus lies in building robust and scalable applications that are customized to meet the specific needs of each client. With extensive experience in technologies like Microsoft Orleans, ML.NET, ASP.NET, Angular, ReactJS, MongoDB, MSSQL Server, and cloud services, I consistently deliver modern and competitive solutions that foster innovation.
• Creating initial structure and architecture of the "Caracal Bot" (a cryptocurrency trade platform that tracks the stock market and trades based on specified strategies) front-end using ReactJs and managing and mentoring two developers to implement it • Integrating the HighCharts library with the "Caracal Bot" stock chart engine that supports loading and analyzing more than 100 trade positions at once • Architecture design of the new version of the "Caracal Bot" based on containerized microservices approach with collaboration of two other senior developers • Implemented the backend services and REST APIs for the "Caracal Bot" using C#, .NET 6.0 web APIs, Entity Framework Core, MSSQL, SignalR, WebSocket • Optimized Entity Framework queries of the "Boustan web application" (a smart Class Scheduling Software for universities across the country) to reduce the execution time by 10% • Optimized load time of the "Boustan" by reducing the number of requests made to the database by more than 200%! • Implemented back-end services and APIs for the customer support system of the "Boustan" using ASP.NET MVC 5, Entity Framework and MSSQL • Implemented a staff management application to record daily reports and work hours of each employee using ASP.NET MVC 5, Entity Framework, MSSQL, HTML, CSS, jQuery, and JavaScript
In the long run, by embracing positive feedback, you can not only enhance working performance but also enrich the quality of life in the workplace.
Studying business English allows you to develop English language skills that are useful in business environments. By understanding the communication skills needed in the workplace, you can gain the confidence to build strong relationships with your colleagues and clients.
Flutter Developer (Freelance)
02/08/2021 - 03/12/2021I am a highly skilled and results-driven software engineer with over 6 years of experience in large-scale software design and development. My expertise lies in SQL development, .NET technologies, and various programming languages. I bring strong analytical and problem-solving abilities, focusing on effective design and user capabilities. With exceptional multitasking skills, I am proficient in requirements analysis, project documentation, and possess excellent communication skills for both internal and external stakeholders. My technical proficiency includes C#.Net, VB.NET, JAVA, HTML, CSS, JavaScript, ASP.Net, WPF, SSIS, SSRS, and experience with databases such as PostgreSQL, Oracle, MS SQL Server, SQLite, MS Access, and Firebase. I am adept at utilizing source control tools like Team Foundation Server and GITHUB.
Task Title
The sequence of triangle numbers is generated by adding the natural numbers . So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors of the first seven triangle numbers:
1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28
We can see that 28 is the first triangle number to have over five divisors .
What is the value of the first triangle number to have over five hundred divisors ?
user solution
using System;
class Program
{
static void Main()
{
int targetDivisors = 500;
int currentNumber = 1;
int currentTriangleNumber = 1;
while (CountDivisors(currentTriangleNumber) <= targetDivisors)
{
currentNumber++;
currentTriangleNumber += currentNumber;
}
Console.WriteLine($"{currentTriangleNumber}");
}
static int CountDivisors(int number)
{
int divisorCount = 0;
int sqrt = (int)Math.Sqrt(number);
for (int i = 1; i <= sqrt; i++)
{
if (number % i == 0)
{
divisorCount += 2; // Count both divisors i and number/i
}
}
// Adjust count if the number is a perfect square
if (sqrt * sqrt == number)
{
divisorCount--;
}
return divisorCount;
}
}
Task Title
The series, 1^1 + 2^2 + 3^3 + ... +10^10 = 10405071317.
Find the last ten digits of the series, 1^1 + 2^2 + 3^3 + ... +1000^1000.
user solution
using System;
public class Program
{
static void Main()
{
const long modulo = 10000000000; // 10^10
long sum = 0;
for (int i = 1; i <= 1000; i++)
{
long term = 1;
for (int j = 1; j <= i; j++)
{
term = (term * i) % modulo;
}
sum = (sum + term) % modulo;
}
Console.WriteLine($"{sum}");
}
}
Task Title
if the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total .
if all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used ?
NOTE: do not count spaces or hyphens . for example, 342 (three hundred and forty - two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters . The use of "and" when writing out numbers is in compliance with British usage .
user solution
using System;
public class Program
{
static void Main()
{
int letterCount = 0;
for (int i = 1; i <= 1000; i++)
{
string wordRepresentation = NumberToWords(i);
letterCount += CountLetters(wordRepresentation);
}
Console.WriteLine($"{letterCount}");
}
static int CountLetters(string word)
{
int count = 0;
foreach (char letter in word)
{
if (char.IsLetter(letter))
{
count++;
}
}
return count;
}
static string NumberToWords(int number)
{
if (number == 1000)
{
return "one thousand";
}
string[] units = { "", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" };
string[] teens = { "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen" };
string[] tens = { "", "ten", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety" };
string words = "";
if (number >= 100)
{
words += units[number / 100] + " hundred";
number %= 100;
if (number > 0)
{
words += " and ";
}
}
if (number >= 11 && number <= 19)
{
words += teens[number - 11];
}
else
{
words += tens[number / 10];
number %= 10;
if (number > 0)
{
words += " " + units[number];
}
}
return words;
}
}
Task Title
In the 20×20 grid below, four numbers along a diagonal line have been marked in red .
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
The product of these numbers is 26 × 63 × 78 × 14 = 1788696.
What is the greatest product of four adjacent numbers in the same direction(up, down, left, right, or diagonally) in the 20×20 grid ?
user solution
using System;
class Program
{
static void Main()
{
// 20x20 grid as a 2D array
int[,] grid = {
{ 8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8 },
{ 49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0 },
{ 81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65 },
{ 52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91 },
{ 22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80 },
{ 24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50 },
{ 32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70 },
{ 67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21 },
{ 24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72 },
{ 21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95 },
{ 78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92 },
{ 16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57 },
{ 86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58 },
{ 19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40 },
{ 4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66 },
{ 88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69 },
{ 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36 },
{ 20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16 },
{ 20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54 },
{ 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48 }
};
int rows = grid.GetLength(0);
int columns = grid.GetLength(1);
int maxProduct = 0;
// Check horizontally
for (int i = 0; i < rows; i++)
{
for (int j = 0; j <= columns - 4; j++)
{
int product = grid[i, j] * grid[i, j + 1] * grid[i, j + 2] * grid[i, j + 3];
maxProduct = Math.Max(maxProduct, product);
}
}
// Check vertically
for (int i = 0; i <= rows - 4; i++)
{
for (int j = 0; j < columns; j++)
{
int product = grid[i, j] * grid[i + 1, j] * grid[i + 2, j] * grid[i + 3, j];
maxProduct = Math.Max(maxProduct, product);
}
}
// Check diagonally (from top-left to bottom-right)
for (int i = 0; i <= rows - 4; i++)
{
for (int j = 0; j <= columns - 4; j++)
{
int product = grid[i, j] * grid[i + 1, j + 1] * grid[i + 2, j + 2] * grid[i + 3, j + 3];
maxProduct = Math.Max(maxProduct, product);
}
}
// Check diagonally (from top-right to bottom-left)
for (int i = 0; i <= rows - 4; i++)
{
for (int j = columns - 1; j >= 3; j--)
{
int product = grid[i, j] * grid[i + 1, j - 1] * grid[i + 2, j - 2] * grid[i + 3, j - 3];
maxProduct = Math.Max(maxProduct, product);
}
}
Console.WriteLine($"{maxProduct}");
}
}
Task Title
Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44
as 1 = 14 is not a sum it is not included .
The sum of these numbers is 1634 + 8208 + 9474 = 19316.
Find the sum of all the numbers that can be written as the sum of fifth powers of their digits .
user solution
using System;
class Program
{
static void Main()
{
int upperLimit = UpperLimit();
int sum = 0;
for (int i = 10; i <= upperLimit; i++)
{
if (IsSumOfFifthPowers(i))
{
sum += i;
}
}
Console.WriteLine($"{sum}");
}
static bool IsSumOfFifthPowers(int number)
{
int sum = 0;
int temp = number;
while (temp > 0)
{
int digit = temp % 10;
sum += (int)Math.Pow(digit, 5);
temp /= 10;
}
return sum == number;
}
static int UpperLimit()
{
int digitPowerSum = 0;
int maxDigit = 9;
while (Math.Pow(maxDigit, 5) * 6 > Math.Pow(10, digitPowerSum))
{
digitPowerSum++;
}
return (int)Math.Pow(10, digitPowerSum);
}
}
Smarter hiring with AI
Website : https://onora.ph/ February 8, 2021 - March 12, 2021
Ensures projects are properly monitored and deadline is being met. Manages different systems deliverables Report to Department Directors regarding the progress of the projects Manages monthly alignment from Retail Propositions Team and IT Team Analyze requirements and give technical analysis for each project Manages the budget and manpower allocation of two scrum teams Projects Handled: MyLifeChoice (Web and Native Application) GHAv2 (Native App) Health Start Lite (eCommerce) CorpWeb RLS (AS400) AXASol (Native Application) EMMA MABI
Create Database Schema based on Business requirements (OLTP Development). Optimize script execution by implementing proper database normalization. Read and analyze Execution Plan and Client Statistics. Creates SSIS Packages for OLAP Development. Manages Database Roles and Users for Development, UAT and Staging Servers. Creates Windows Application for GITHUB Repository Database Restoration. Manages GITHUB server for proper branching , pull request and merging. Projects Handled: Manibus Project A web application that handles back office fund management Technologies Used: SQL Server 2008 R2, GITHUB IDE: Visual Studio Code Alpha Restore A windows application that creates database from scripts stored in GITHUB server Create configuration files using sql scripts ,stored procedures. Technologies Used: C#.Net, SQL Server 2008 R2, .Net Framework 4.5, GITHUB IDE: Microsoft Visual Studio 2015
Projects Handled: ImageRight Web Service A web service that requests document from clients proxy and return the document to the database and vice versa Technologies Used: C#.Net, SQL Server 2017, .Net Framework 4.5, TFS IDE: Microsoft Visual Studio 2015 Claims Decisions A web application that handles transactions for claims transactions of different line of business. Create configuration files using sql scripts ,stored procedures. Technologies Used: C#.Net, SQL Server 2017, .Net Framework 4.5, TFS IDE: Microsoft Visual Studio 2015
Create system optimization using SQL Scripts from C#.Net (Runtime) that resulted to 86% (15 minutes to 2 minutes) on SQL jobs performance. Implements major enhancements within agreed schedule with no Incident Request (IR) since enhancement made live. Manage resources and timeline using MS Project as the tool. Develop, maintain and support application programs for administrative, web systems using .Net Technologies and related tools. Analyze code for system testing and debugging; Create test transactions to find, isolate and rectify issues Create and participate in software planning and estimating, status monitoring and reporting as a part of the Product Development Implementation Committee . Performed application upgrades as the technology became available Plan, coordinate and conduct multiple complex software engineering activities Devise new approaches, apply existing criteria in new ways and draw conclusions from comparative situations Make recommendations on the assessment of tools and software products Manage and support a team of four software developers Supports application on-site and off-site when needed. Participate in continuous improvement initiatives Projects Handled: eQuotes v2 A windows application that forecasts client's benefits and fund values for both Traditional and Unit Linked products of the company. Generates a Sales Illustration as an output using HTML in PDF Format. Technologies Used: C#.Net, SQL Server 2005, .Net Framework 4.0, TFS IDE: Microsoft Visual Studio 2010 IDSS (Integrated Distribution Support System) A web application that processes the daily production data and persistency rates of the company's agents. Technologies Used: C#.Net, SQL Server 2008 R2, Crystal Reports, HTML, Javascript, JQuery, MVC 3, MVCContrib, DotNetZip, EntityFramework 5, TFS IDE: Microsoft Visual Studio 2010 IDSS – Agency Contest A web application that computes the contest results for the agency forces using the parameters given set by the user. Technologies Used: C#.Net, SQL Server 2008 R2, Crystal Reports, HTML, Javascript, JQuery, MVC 3, MVCContrib, DotNetZip, EntityFramework 5, TFS IDE: Microsoft Visual Studio 2010
Information Professionals, Inc. August 28, 2011 – September 27, 2012 Responsibilities: Maintained and enhanced existing software by analyzing and identifying areas for optimization or refactoring. Developed and documented functional and technical requirements Developed functional application specifications, systems design criteria and developing, testing and maintaining applications in accordance with specifications Diagnosed and resolved defects in code Projects Handled: A windows application that forecasts client's benefits and fund values for both Traditional and Unit Linked products of the company. Generates a Sales Illustration as an output using Crystal Report in PDF Format. Technologies Used: C#.Net, SQL Server 2005, Crystal Reports, .Net Framework 2.0 IDE: Microsoft Visual Studio 2005 Marketing Production Reports A MS Access application that connects through different RDBMS (Sql Server, AS400, and MS Access) and computes the agents' daily, monthly and yearly production data, creates RTF files as an output. Technologies Used: MS Access (VBA) EIS A MS Access application that connects through different RDBMS (Sql Server, AS400) and stage the agents' daily, monthly and yearly production data. Technologies Used: MS Access (VBA)
ETR Total Business Solutions Provider March 16, 2010 – August 12, 2011 Responsibilities: Appointed as Development Team Lead in less than a year of service. Develop, maintain and support application programs for administrative, web systems using .Net Technologies and related tools. Analyze code for system testing and debugging; create test transactions to find, isolate and rectify issues; Performed application upgrades as the technology became available Added two additional modules to the integrated systems during my time as team lead. Plan, coordinate and conduct multiple complex software engineering activities Devise new approaches, apply existing criteria in new ways and draw conclusions from comparative situations Manage and support a team of four software developers Participate in continuous improvement initiatives Create database objects (Tables, Views, Stored Procedures, and Functions) via SQL script as a standard for any database changes using the Query Analyzer of SQL 2000. Create and modify SQL scripts whenever needed. Create Data Transformation Services application whenever needed. Headed the database back up and restoration for our clients as part of the service provided by the company. Projects Handled: ETR Integrated Systems A windows application that consists of the following modules Order Management Inventory Management Warehouse Management Financial Management Call Coverage Management Technologies Used: VB.Net, SQL Server 2000, Crystal Reports ETR Payroll System A windows application that forecasts clients benefits and fund values for both Traditional and Unit Linked products of the company. Technologies Used: VB.Net, SQL Server 2000, Crystal Reports Doctor Calls Monitoring System (DCMS Client) A MS Access application that tagged the medical representatives' daily doctor visits. Uploaded in DCMS Admin for auto tagging of doctor visits. Technologies Used: MS Access 2000 (VBA)
Responsibilities Maintained and enhanced existing software by analyzing and identifying areas for optimization or refactoring. Developed and documented functional and technical requirements Developed functional application specifications, systems design criteria and developing, testing and maintaining applications in accordance with specifications Diagnosed and resolved defects in code Create database objects (Tables, Views, Stored Procedures, and Functions) via SQL script as a requirement by the development head for any database changes using the Query Analyzer of SQL 2000. Create and modify SQL scripts whenever needed. Projects Handled: ETR Integrated Systems A windows forms application that consists of the following modules Order Management Inventory Management Warehouse Management Technologies Used: VB.Net, SQL Server 2000, Crystal Reports Sales Performance Monitoring System A windows forms application that monitors the client's monthly sales performance. Creates excel files as an output. Technologies Used: VB 6.0, SQL Server 2000 Doctor Calls Monitoring System (DCMS Admin) A windows forms application that monitors the medical representatives' monthly doctor visits. Creates excel files as an output. Technologies Used: VB 6.0, SQL Server 2000
In the long run, by embracing positive feedback, you can not only enhance working performance but also enrich the quality of life in the workplace.
We need to introduce innovative ideas and ways of doing things so that we can improve and grow. One way of doing this is to look at the most recent technologies and see how they can make our products or services better.
.NET DEVELOPER
10/01/2021 - 12/01/2023Results-driven .NET Developer with six years of hands-on experience in designing, implementing, testing, and maintaining complex software solutions. Proven expertise in C#, ASP.NET, and SQL, with a track record of delivering high-quality applications that meet client needs. Adept at collaborating with cross-functional teams to drive project success. Strong problem-solving skills and a passion for staying updated with emerging technologies. Committed to producing efficient, scalable, and maintainable code
Task Title
The Fibonacci sequence is defined by the recurrence relation:
fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
Hence the first 12 terms will be:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
The 12th term, F12, is the first term to contain three digits .
What is the index of the first term in the Fibonacci sequence to contain 1000 digits ?
user solution
using System.Collections.Generic;
using System;
namespace Test.Test
{
class Program
{
static void Main(string[] args)
{
int digits = 0, carry = 0, fibNo = 2;
var a = new List<int> { 1 };
var b = new List<int> { 1 };
var c = new List<int>();
while (digits < 1000)
{
fibNo += 1;
for (int i = 0; i < b.Count; i++)
{
int temp = a[i] + b[i] + carry;
int number;
carry = (Math.DivRem(temp, 100000, out number));
c.Add(number);
}
if (a.Count > b.Count)
{
c.Add(a[a.Count - 1] + carry);
carry = 0;
}
if (carry > 0)
{
c.Add(carry);
}
b.Clear();
foreach (int i in a)
{
b.Add(i);
}
a.Clear();
foreach (int i in c)
{
a.Add(i);
}
c.Clear();
digits = a.Count * 5;
char[] ch = a[a.Count - 1].ToString().ToCharArray();
digits -= 5 - ch.Length;
}
Console.WriteLine(fibNo);
}
}
}
Task Title
if the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total .
if all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used ?
NOTE: do not count spaces or hyphens . for example, 342 (three hundred and forty - two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters . The use of "and" when writing out numbers is in compliance with British usage .
user solution
using System.Collections.Generic;
using System;
namespace Test.Test
{
class Program
{
static void Main(string[] args)
{
int sum = 0;
for (int j = 1; j <= 1000; j++)
{
int ones, temp;
int hundreds = Math.DivRem(j, 100, out temp);
int tens = Math.DivRem(temp, 10, out ones);
switch (hundreds)
{
case 10:
sum += 11;
break;
case 6:
case 2:
case 1:
sum += 3;
break;
case 9:
case 5:
case 4:
sum += 4;
break;
case 8:
case 7:
case 3:
sum += 5;
break;
}
if (j > 99 && j < 1000)
{
switch (tens + ones == 0)
{
case true:
sum += 7;
break;
case false:
sum += 10;
break;
}
}
switch (tens)
{
case 9:
case 8:
case 3:
case 2:
sum += 6;
break;
case 4:
case 6:
case 5:
sum += 5;
break;
case 7:
sum += 7;
break;
case 1:
switch (ones)
{
case 0:
sum += 3;
break;
case 2:
case 1:
sum += 6;
break;
case 9:
case 8:
case 4:
case 3:
sum += 8;
break;
case 6:
case 5:
sum += 7;
break;
case 7:
sum += 9;
break;
}
break;
}
if (tens != 1)
{
switch (ones)
{
case 6:
case 2:
case 1:
sum += 3;
break;
case 9:
case 5:
case 4:
sum += 4;
break;
case 8:
case 7:
case 3:
sum += 5;
break;
}
}
}
Console.WriteLine(sum);
}
}
}
Task Title
In the 20×20 grid below, four numbers along a diagonal line have been marked in red .
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
The product of these numbers is 26 × 63 × 78 × 14 = 1788696.
What is the greatest product of four adjacent numbers in the same direction(up, down, left, right, or diagonally) in the 20×20 grid ?
user solution
using System.Collections.Generic;
using System;
namespace Test.Test
{
class Program
{
static void Main(string[] args)
{
int[,] matrix = {{08, 02, 22, 97, 38, 15, 00, 40, 00, 75, 04, 05, 07, 78, 52, 12, 50, 77, 91, 08},
{49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 04, 56, 62, 00},
{81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 03, 49, 13, 36, 65},
{52, 70, 95, 23, 04, 60, 11, 42, 69, 24, 68, 56, 01, 32, 56, 71, 37, 02, 36, 91},
{22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80},
{24, 47, 32, 60, 99, 03, 45, 02, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50},
{32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70},
{67, 26, 20, 68, 02, 62, 12, 20, 95, 63, 94, 39, 63, 08, 40, 91, 66, 49, 94, 21},
{24, 55, 58, 05, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72},
{21, 36, 23, 09, 75, 00, 76, 44, 20, 45, 35, 14, 00, 61, 33, 97, 34, 31, 33, 95},
{78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 03, 80, 04, 62, 16, 14, 09, 53, 56, 92},
{16, 39, 05, 42, 96, 35, 31, 47, 55, 58, 88, 24, 00, 17, 54, 24, 36, 29, 85, 57},
{86, 56, 00, 48, 35, 71, 89, 07, 05, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58},
{19, 80, 81, 68, 05, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 04, 89, 55, 40},
{04, 52, 08, 83, 97, 35, 99, 16, 07, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66},
{88, 36, 68, 87, 57, 62, 20, 72, 03, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69},
{04, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 08, 46, 29, 32, 40, 62, 76, 36},
{20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 04, 36, 16},
{20, 73, 35, 29, 78, 31, 90, 01, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 05, 54},
{01, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 01, 89, 19, 67, 48}};
int result = 1;
int max = 0;
for (int h = 0; h < 20; h++)
{
for (int i = 0; i < 17; i++)
{
for (int j = 0; j < 4; j++)
result *= matrix[h, i + j];
if (result > max)
{
max = result;
}
result = 1;
}
}
for (int h = 0; h < 17; h++)
{
for (int i = 0; i < 20; i++)
{
for (int j = 0; j < 4; j++)
result *= matrix[h + j, i];
if (result > max)
{
max = result;
}
result = 1;
}
}
for (int h = 0; h < 17; h++)
{
for (int i = 0; i < 17; i++)
{
for (int j = 0; j < 4; j++)
result *= matrix[h + j, i + j];
if (result > max)
{
max = result;
}
result = 1;
}
}
for (int h = 0; h < 17; h++)
{
for (int i = 3; i < 20; i++)
{
for (int j = 0; j < 4; j++)
result *= matrix[h + j, i - j];
if (result > max)
{
max = result;
}
result = 1;
}
}
Console.WriteLine(max);
}
}
}
Task Title
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
22 = 4, 23 = 8, 24 = 16, 25 = 32
32 = 9, 33 = 27, 34 = 81, 35 = 243
42 = 16, 43 = 64, 44 = 256, 45 = 1024
52 = 25, 53 = 125, 54 = 625, 55 = 3125
if they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100 ?
user solution
using System.Collections.Generic;
using System;
using System.Numerics;
using System.Linq;
namespace Test.Test
{
class Program
{
static void Main(string[] args)
{
var aMin = 2;
var aMax = 100;
var bMin = 2;
var bMax = 100;
List<double> lst = new List<double>();
for (int a = aMin; a <= aMax; a++)
{
for (int b = bMin; b <= bMax; b++)
{
lst.Add(Math.Pow(a, b));
}
}
var distinctRslt = lst.Distinct().ToList();
distinctRslt.Sort();
Console.WriteLine(distinctRslt.Count());
}
}
}
Smarter hiring with AI
Expert in seamlessly migrating legacy projects to modern technology stacks, ensuring enhanced performance, scalability, and long-term sustainability. Seasoned in mentoring and training new team members in the intricacies of development, fostering rapid onboarding and skill acquisition. Proficient in cross-cultural collaboration, effectively liaising with foreign clients and team members to achieve project success. Experienced back-end developer specializing in .NET, adept at designing, implementing, and optimizing robust server-side solutions. Skilled in proficiently managing SQL databases and IIS servers to ensure seamless performance and data integrity. Diligent code reviewer ensuring adherence to best practices, identifying potential issues, and maintaining code quality for optimal project outcomes. Proficient in utilizing Jira and Agile methodology in conjunction with Git for streamlined project management and collaborative development workflows.
Designed and implemented an efficient patient queuing system facilitating seamless interactions between patients Developed a localized chat-based software akin to Skype, enhancing communication for specific local needs.
Developed a custom financial software tailored to client specifications, built from the ground up. Contributed to building the backend infrastructure for a comprehensive forex and cryptocurrency trading platform. Proficient in software configuration management and conducting load testing on APIs and servers for optimal performance.
Proficient in implementing client-provided predefined codes to meet project requirements and specifications. Documented all technical specifications and testing methods for project for future reference and use in other assignments Proficient in software configuration management and conducting load testing on APIs and servers for optimal performance.
The most incredible thing about technological developments is that with more innovation comes more problems that can be solved. Today, AI and Machine Learning are some of the most popular areas in IT because of the endless possibilities they offer.
Whilst it could be an enriching experience, there are some disadvantages to space tourism. Many critics have commented that a huge growth in the spaceflight industry could drastically speed up the process of global warming.
I am very pleased with the whole process and services Axiom has provided during our search for ITLC Support Specialist. Hiring Anzhelika was a very good choice, as she has been able to learn and follow MDL work flow and became a great asset to the ITLC team in a short period of time. I will definitely utilize your services for any future positions needs.
I appreciate everything you've done to help us so far. This process has been very easy. I have nothing but positive things to say about Vigen. He has been a great addition to our team. He’s reliable and enthusiastic when it comes to working on any project that I have given him. Vigen has also made suggestions that we will look to implement here as well. Overall, I am very pleased to have him on our team.
I am happy to inform you that Nanda is excellent and is passionate about the work assigned to her. Communication, collaboration is perfect and excellent analytical skills. She understands relationships between entities and has drawn ER Diagrams. It’s a pleasure working with her. Hope it continues that way.
We are extremely satisfied with the team that you have provided to us! They are doing exceptionally well.
We are extremely happy with the service and results from Axiom Pro. Arman has been a great addition to our team, and we are happy to have him here.
Axiom recruitment service provided the quality of candidate I needed for a personal assistant. The cultural fit is perfect as much as the skills and experience required for the job. I appreciate the dedication and speed with which they delivered this job!
Exceptional Recruiting Firm – Highly Recommended! We urgently needed to find qualified resources for a strategic initiative. Axiom Pro quickly became an invaluable partner in our quest to find top-tier talent for our company. Their highly personable, professional, and responsive team has shown us their dedication to understanding our hiring needs. They took the time to thoroughly vet candidates, ensuring we only met with the best fit for our organization. Thanks to Axiom Pro, we discovered fantastic people who seamlessly blended into our group and made a powerful impact. Axiom Pro's unique approach to the recruitment process, which combines personalized techniques with GenAI capabilities, truly sets them apart from other firms, making them an exclusive choice for top-tier talent. If you're looking for a dedicated, creative, reliable, and trustworthy recruiting firm that delivers quality candidates and exceptional service, I can't recommend Axiom Pro highly enough!
Successfully created
AXIOM PRO is your strategic partner for hiring top global talent.
We specialize in recruiting and outstaffing solutions that help you scale efficiently — without the overhead.
Our team rigorously pre-screens candidates, verifies English fluency and technical proficiency, and presents only job-ready professionals who can hit the ground running.
Risk-free hiring — pay only when you succeed!