SDE - 1

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

Bubble Sort implementation for the given array:  {6,2,8,4,10} is shown below :-

What is a list and a tuple ? What are the properties of tuple ?

At a restaurant, pizzas can be ordered in boxes of 6, 9, and 20. What is the highest number of Pizzas that cannot be bought with any combination of these boxes?

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

What did you learn in your project on API ?

Are you a team player?

What makes you different from others?