Optimized Bubble Sort Algorithm In case of Bubble Sort, after each iteration largest element will be shifted to right. bubble_sort(int a[], n) { int swapped, i, j; for(i = 0; i < n; i++) { swapped = 0; for(j = 0; j < n – i – 1; j++) { if(a[j] > a[j + 1]) […]
Bubble Sort Analysis | Data Structures and Algorithms | CodeWindow.in Read More »
Tata Consultancy Services – Information Technology Consulting Company About TCS National Qualifier Test (TCS NQT) TCS National Qualifier Test (TCS NQT) is a multi-level assessment to assess the following competencies and skills: 1. Competence on the core cognitive processes required for entry-level jobs 2. Industry-specific knowledge and insights 3. Specialisation on skills required to perform various
There are n consecutive buildings and their heights are represented in arrays. You need to find the sum of maximum height for any buildings that are in increasing order. Given an array of positive integers of length N, write a program to find the maximum sum of strictly increasing subarrays. Example: Input: 7 1 2
Coding Questions | Building Problem | Codewindow.in Read More »
Raja just found out that matrix can be implemented using 2d arrays. He is good at programming. So he tries to develop a program to do his math homework. Help Roshan to write a program to do his math homework. In his math homework, a square matrix of size N is given. He needs to
Coding Questions | Math Homework | Codewindow.in Read More »
Your friend challenges you to play a game, in which you have to find the number to Power pairs in a series of numbers. A power pair is formed when a number-b is divisible by another number-a that occurs before the number-b in the given sequence. You can easily win the challenge by developing a
Given a string x (1<=len(x)<=1000) find the length of its longest palindromic subsequence. The string contains only lowercase letters. Write a program that takes in input as String x and returns the length of the longest palindromic subsequence of x. Input Format:String input. Output Format:return the length of the longest palindromic subsequence. Example :Input:ababa Output:5
Coding Questions | Longest Palindromic Subsequence | Codewindow.in Read More »
Tent is participating in a quiz competition and two teams had scored the same marks. He has to answer the last question to be the winner. Given the number of children x. the intervals at which all the children were born Y, and their sum of ages Z. Write a program to help Tent find
Coding Questions | Quiz Competition | Codewindow.in Read More »
Given a string (of maximum length 1000) representing a large number, the output is modulo 11. Input Format:A large number is in the form of a string. Output Format:Return the remainder modulo 11 of the input value. Example:Input:121 Output:0 Explanation:121 mod 11 = 0 Solution: Coming…. Next Page JOIN OUR TELEGRAM GROUP FOR DAILY JOB
Coding Questions | Remainder Mod | Codewindow.in Read More »
There is a certain number of coins in M*N boxes. These are arranged in matrix form. You are given a and b values where a donets the row number and b denotes the column number. Given a matrix size M*N, consider the union of the ath row and the bth column of the matrix. Write
Coding Questions | Coins In A Box | Codewindow.in Read More »
Given an integer array with ‘N’ (2<=N<=1000) points. Find the distance between the closest pair of points. Input Format:Input 1: N, the number of points in an arrayInput 2: Array of numbers Output Format:Return the distance between the closest pair of points. Example 1:Input 1: 3Input 2: {-10,0,11} Output:10 Explanation:In the above example, the distance
Coding Questions | The Closest Pair | Codewindow.in Read More »
