Mallikarjun Birajdar
BAN USER
- 1
0of 0 votes
AnswerUser uploaded file in File container/storage --> Its parsed by 1 App and removed frim storage --> App having logs --> App stored data into database
- Mallikarjun Birajdar in India for Kindle
--> One User interface featching data from DB havinig fields Username, Report ID, ProductID --> This UserInterface also connected to Report Application.
ProductID came from file, ReportID generated in report.
User interface not showing any data so what could be the issue?| Report Duplicate | Flag | PURGE
Amazon Quality Assurance Engineer Trouble shooting - 5
0of 0 votes
AnswersProgram- Metrics- Find Kth position in metrics in N X N metrics in spiral form
- Mallikarjun Birajdar in India for Kindle| Report Duplicate | Flag | PURGE
Amazon Quality Assurance Engineer Programming Skills - 5
0of 0 votes
Answers4. Generate Test data for below function Grade(Obtained marks, Total marks) having below grading system.
- Mallikarjun Birajdar in India for Kindle
0% to 40%= D grade
41% to 60%= C grade
61% to 80%= B grade
81% to 100%= A grade
Grading calculation=Grade(20,40)=100*(20/40)= C grade| Report Duplicate | Flag | PURGE
Amazon Quality Assurance Engineer Testing - 7
-1of 1 vote
Answers3. Write a program to display numbers having sum of left side numbers equal to right side numbers.
- Mallikarjun Birajdar in India for Kindle
{1,0,-11,1,12}=>0 {Left side number 1+0=1, Right side number -11+1+12=1}| Report Duplicate | Flag | PURGE
Amazon Quality Assurance Engineer Programming Skills - 20
0of 0 votes
Answers2. Write a program to diplay a character occurred maximum times and if two charaters occurring same no of times then display 1st character in string.
- Mallikarjun Birajdar in India for Kindle
"HELLO WORLD!" display L
"HO HELLO!" display H (H, L and O appeared 2 times but H is in 1st in string)| Report Duplicate | Flag | PURGE
Amazon Quality Assurance Engineer Programming Skills - 0
0of 0 votes
Answers1. "Unified search" for Email App, Web content and for SDCARD/Internal memory, which search word, letter and display result.
- Mallikarjun Birajdar in India for Kindle
Its a smartphone app. Write the test case for this.| Report Duplicate | Flag | PURGE
Amazon Quality Assurance Engineer Testing
//C# code
string[] input = "This is a test String!!".Split(' ');
string inputword = string.Empty;
string reverseword = string.Empty;
string output = string.Empty;
string word = string.Empty;
for (int i = 0; i < input.Length; i++)
{
if (i % 2 == 0)
{
output = output + " " + input[i].ToUpper();
}
else
{
word = input[i];
foreach (var item in word)
{
reverseword = item + "" + reverseword;
}
output = output + " " + reverseword;
}
reverseword = string.Empty;
}
Console.WriteLine(output.Trim());
Console.ReadLine();
try
{
string[] input = "user1,user4,user2,user1,user3,user1,user2,user3".Split(',');
int k = 2;
// Find the number of occurance of string store it into dictionary then print strings having count more than k
int noOfOccurance = 0;
Dictionary<string, int> dictNameOccurance = new Dictionary<string, int>();
for (int i = 0; i < input.Length; i++)
{
noOfOccurance = 0;
if (!dictNameOccurance.ContainsKey(input[i]))
{
for (int j = i; j < input.Length; j++)
{
if (input[i] == input[j])
{
noOfOccurance++;
}
}
dictNameOccurance.Add(input[i], noOfOccurance);
}
}
foreach (var item in dictNameOccurance.Where(o => o.Value >= k))
{
Console.WriteLine("{0} ({1})",item.Key,item.Value);
}
Console.ReadLine();
}
catch(Exception e)
{
Console.WriteLine(e.Message);
Console.ReadLine();
}
Answer in C#-
try
{
//Find the length of string having pallindrome, u can remove any character and shuffle it
string input = "abb";
Dictionary<char, int> charOccurance = new Dictionary<char, int>();
int count = 0;
bool isPalindrome=false;
bool isOdd = false;
for (int i = 0; i < input.Length; i++)
{
if (charOccurance.ContainsKey(input[i]))
{
charOccurance[input[i]] += 1;
}
else
{
charOccurance.Add(input[i], 1);
}
}
foreach (int value in charOccurance.Values)
{
if (value % 2 == 0)
{
count = count + value;
}
if (value % 2 != 0)
{
count = count + value - 1;
isOdd = true;
}
if (isPalindrome == false)
{
if(value>1)
isPalindrome = true;
}
}
if (isPalindrome == true)
{
if (isOdd)
{
Console.WriteLine("Length of string={0}", count + 1);
}
else
{
Console.WriteLine("Length of string={0}", count);
}
}
else
{
Console.WriteLine("Not a single palindrome possible");
}
Console.ReadLine();
}
catch (Exception e)
{
Console.WriteLine(e.Message);
Console.ReadLine();
}
Same question asked in 27th Aug 2016 face to face interview.
Find length of longest palindrome string, you can shuffle or remove any characters in string.
Answer in C#-
try
{
//Find the length of string having pallindrome, u can remove any character and shuffle it
string input = "abb";
Dictionary<char, int> charOccurance = new Dictionary<char, int>();
int count = 0;
bool isPalindrome=false;
bool isOdd = false;
for (int i = 0; i < input.Length; i++)
{
if (charOccurance.ContainsKey(input[i]))
{
charOccurance[input[i]] += 1;
}
else
{
charOccurance.Add(input[i], 1);
}
}
foreach (int value in charOccurance.Values)
{
if (value % 2 == 0)
{
count = count + value;
}
if (value % 2 != 0)
{
count = count + value - 1;
isOdd = true;
}
if (isPalindrome == false)
{
if(value>1)
isPalindrome = true;
}
}
if (isPalindrome == true)
{
if (isOdd)
{
Console.WriteLine("Length of string={0}", count + 1);
}
else
{
Console.WriteLine("Length of string={0}", count);
}
}
else
{
Console.WriteLine("Not a single palindrome possible");
}
Console.ReadLine();
}
catch (Exception e)
{
Console.WriteLine(e.Message);
Console.ReadLine();
}
- 0
Rep
- 0
RepOliviaJBlack, Consultant at Apkudo
I am Olivia from San Diego. I am working as a checker in the Thom McAn Store company. My strong ...
- 0
Repvaleriecfranks, Computer Scientist at ASAPInfosystemsPvtLtd
A strong writer with a passion for story-telling who has extensive experience of writing literary compositions, articles, reports, books and ...
- Mallikarjun Birajdar February 05, 2017int[] ar1 = { 1,3,5,7,9,11,45,67}; int[] ar2 = { 2,4,6,8,9,11,34,56,789,789,999,1000}; int[] result; int maxarrlen = (ar1.Length > ar2.Length) ? ar1.Length : ar2.Length ; int minarrlen = (ar1.Length > ar2.Length) ? ar2.Length : ar1.Length ; result = new int[maxarrlen+minarrlen]; int counter = 0; int total=maxarrlen + minarrlen; for (int i = 0; i < maxarrlen; i++) { if (i < minarrlen) { if (ar1[i] >= ar2[i]) { result[counter++] = ar2[i]; result[counter++] = ar1[i]; } else { result[counter++] = ar1[i]; result[counter++] = ar2[i]; } } else { result[counter++] = ar2[i]; } } foreach (var item in result) { Console.Write(string.Format("{0},", item)); } Console.ReadLine();