ProDeveloperTutorialonDecember 23, 2024 Given an integer value, convert it into roman number. Problem Explanation: Roman numbers are represented by below characters: I 1 V 5 X 10 L 50 C 100 D 500 M 1000 IV 4 IX 9 XL 40 XC 100 CD 400 CM…
ProDeveloperTutorialonDecember 23, 2024 Given an array, find all the repeated elements in C language. Problem Description: Given a positive integer array, find all the elements that have been repeated and display them. Example: Input: {1, 3, 2,…
ProDeveloperTutorialonDecember 23, 2024 Given an unsorted integer array, find the smallest missing positive integer. Note: Find the element in the order O(n) with a constant extra space. Example 1: Input: [ 2, 3, -1, -2] Output: 1 Example 2: Input: [5, 6, 7,…
ProDeveloperTutorialonDecember 23, 2024 Given an unsorted array, and a key. Find 2 elements such that the difference between the elements is equal to the key. Example: {4, 2, 5, 8, 21, 34, 10} key = 24 Output: Pair found (34, 10). This problem can be solved in 2 ways. Solution 1: Brute force method.…
ProDeveloperTutorialonDecember 23, 2024 Given an unsorted array, find the least difference between the element pairs. Display all the pairs present. Problem Statement: Given an unsorted array, list all the pairs with a least difference. Example: Input: {5, 4, 3, 2, 1} Output: {1, 2}, {2,…
ProDeveloperTutorialonDecember 23, 2024 Given an unsorted array, find the minimum difference between 2 elements. Problem Explanation: Given an unsorted array, the output should be the minimum difference between the elements and the elements itself.…
ProDeveloperTutorialonDecember 23, 2024 Given an array, the difference between the elements is one, find if the “key” element is present or not. Example: Array: {5, 6, 7, 6, 5, 4, 3, 4, 5, 6} Key: 4 Output: The element 4 is found at the index 6. Explanation: We can solve this approach…
ProDeveloperTutorialonDecember 23, 2024 Sort an array of 0s, 1s and 2s in C Problem Description: Given an array of elements consisting of 0, 1, 2. Sort the array. Example: {1, 2, 0, 0, 1, 2, 1} Output: {0, 0, 1, 1, 1,…
ProDeveloperTutorialonDecember 23, 2024 Count the number of ways a baby can reach the n’th stair taking 1 or 2 steps at a time in C language. Problem Description: A baby wants to climb the stairs. It can take single step at a time or take 2 steps at a time. Or it can take combination…
ProDeveloperTutorialonDecember 23, 2024 Given two non empty Linked List with non negative numbers, and numbers are stored in reverse order having single digit. Add the two list and return the result as a linked list. Input: [ 3 -> 4 -> 5 ] + [ 1 -> 2-> 3] Output: [ 8 -> 6 -> 4 ] Explanation: 543 + 321 = 8 -> 6 -> 4 Detailed…