Take FREE!! Online Mettl Mock Test to Crack TechM and Other Companies Written Exams.
Get Off-Campus Placement Jobs Info !!!
TCS NQT Technical and Managerial Round Interview Questions

371 / 410

Given an array and integer K, find the number of pairs such that a[i]+K=a[j]

Input : NA

Output : NA

|  Array | | | |  Fresher

Tags:SAP Labs

372 / 410

Given a string. Find the number of substrings which consists of vowels only and contain all vowels at least once.

Input : NA

Output : NA

|  Strings | | | |  Fresher

Tags:SAP Labs

373 / 410

Write a function to check whether two given strings are an anagram of each other or not.

Hint:An anagram of a string is another string that contains same characters, only the order of characters can be different.

Example: "abcd" and "dabc" are anagram of each other.

Input : LISTEN

Output :

|  Strings | | | |  Fresher

Tags:SAP Labs

374 / 410

Write a recursive program to reverse a string without using any extra variable.

Input : NA

Output : NA

|  Strings | | | |  Fresher

Tags:SAP Labs

375 / 410

Write a program to implement queue using linked list and array.

Input : NA

Output : NA

|  Queue | | | |  Fresher

Tags:SAP Labs

376 / 410

A password manager wants to create a new password using two strings given by the user, then combined to create a harder-to-guess combination. Given two strings, interleave the characters of the strings to create a new string. Beginning with an empty string, alternately append a character from string a and from string b. If one of the strings is exhausted before the other, append the remaining letters from the other string all at once. The result is the new password.

Example:
If a = saplab and b = q4interview ,the result is sqa4pilnatberview.

Function Description
Complete the function newPassword in the editor below
string a the first string
string b the second string

Input : a = saplab
b = q4interview

Output :

|  Strings | | | |  Fresher

Tags:SAP Labs

377 / 410

Build the Subsequences

A subsequence of a string is obtained by deleting zero or more characters from the string while maintaining order. Given a string, generate an array of all subsequences sorted alphabetically ascending, omitting the empty string.

Example
For example, the subsequences of string s = "xyz", not including the empty string, are "x", "xy", "xz", "xyz", "y", "yz", and "z"

Function Description:
Complete the function builds sequences in the editor below.

buildSubsequences has the following parameter(s)
str s: the string to process

Returns:
str[]: An array of strings comprising all the subsequences of the given string sorted alphabetically, ascending.

constraints:
1 < length of s <16
s is a string of distinct lowercase English alphabetic letter ascii[a-z]

Input : NA

Output : NA

|  Strings | | | |  Fresher

Tags:SAP Labs

378 / 410

Deleting Sub-strings

There are two strings, s, and t.

Perform two operationss with the string s:
1. Working from left-to-right delete each occurrence of t in s until there are no more occurrences of t. Count each deletion.
2. working from right-to-left delete each occurrence of t in s until there are no more occurrences of t. Count each deletion.

When that is done, return the greater of the two counts; deletion left-to-right or deletions right-to-left.

Example
s = 'bcbbc'
t = 'b'

From left to right:
Remove th first occurrence t = 'b' from"

Input : NA

Output : NA

|  Strings | | | |  Fresher

Tags:SAP Labs

379 / 410

Given a list of distinct unsorted integers, find the pair of elements that have the smallest absolute difference between them? If there are multiple pairs, find them all.
Input : arr[] = {10, 50, 12, 100}
Output : (10, 12)
The closest elements are 10 and 12

Input : arr[] = {5, 4, 3, 2}

Output :

|  Strings | | | |  Fresher

Tags:SAP Labs

380 / 410

Car parking problem. An array given represents the actual order of cars need to be parked. Like for example order is 4,6,5,1,7,3,2,empty. If cars are parked in some order like empty,1,2,3,7,6,4,2. Some person needs to get them into the correct order, list out all instructions to the person to get in the correct order with least number of swaps.

Input : NA

Output : NA

|  Sorting | | | |  Experience, Fresher

Tags:Amazon

+ Contribute Programming Qs.

Baig
1