Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
When it is required to print the numbers in a given range without using any loop, a method is defined, that keeps displays numbers from higher range by uniformly decrementing it by one after every print statement.Below is the demonstration of the same −Example Live Demodef print_nums(upper_num): if(upper_num>0): print_nums(upper_num-1) print(upper_num) upper_lim = 6 print("The upper limit is :") print(upper_lim) print("The numbers are :") print_nums(upper_lim)OutputThe upper limit is : 6 The numbers are : 1 2 3 4 5 6ExplanationA method named ‘print_nums’ is defined.It checks if the upper limit is greater than 0.If ... Read More
When it is required to convert a nested tuple into a customized key dictionary, the list comprehension can be used.Below is the demonstration of the same −Example Live Demomy_tuple = ((6, 'Will', 13), (2, 'Mark', 15), (9, 'Rob', 12)) print("Thw tuple is : ") print(my_tuple) my_result = [{'key': sub[0], 'value': sub[1], 'id': sub[2]} for sub in my_tuple] print("The converted dictionary is : ") print(my_result)OutputThw tuple is : ((6, 'Will', 13), (2, 'Mark', 15), (9, 'Rob', 12)) The converted dictionary is : [{'key': 6, 'value': 'Will', 'id': 13}, {'key': 2, 'value': 'Mark', 'id': 15}, {'key': 9, 'value': 'Rob', ... Read More
When it is required to flatten tuple of a list to tuple, a method is defined, that takes input as tuple.The tuple is iterated over, and the same method is called on it over and over again until the result is obtained.Below is the demonstration of the same −Example Live Demodef flatten_tuple(my_tuple): if isinstance(my_tuple, tuple) and len(my_tuple) == 2 and not isinstance(my_tuple[0], tuple): my_result = [my_tuple] return tuple(my_result) my_result = [] for sub in my_tuple: my_result += flatten_tuple(sub) return tuple(my_result) my_tuple = ((35, 46), ((67, ... Read More
ProblemWe are required to write a JavaScript function that takes in number n. Our function should return the nth palindrome number if started counting from 0.For instance, the first palindrome will be 0, second will be 1, tenth will be 9, eleventh will be 11 as 10 is not a palindrome.ExampleFollowing is the code − Live Democonst num = 31; const findNthPalindrome = (num = 1) => { const isPalindrome = (num = 1) => { const reverse = +String(num) .split('') .reverse() .join(''); return reverse === num; }; let count = 0; let i = 0; while(count < num){ if(isPalindrome(i)){ count++; }; i++; }; return i - 1; }; console.log(findNthPalindrome(num));OutputFollowing is the console output −212
ProblemWe are required to write a JavaScript function that takes in a positive number n. We can do at most one operation −Choosing the index of a digit in the number, remove this digit at that index and insert it back to another or at the same place in the number in order to find the smallest number we can get.Our function should return this smallest number.ExampleFollowing is the code − Live Democonst num = 354166; const smallestShuffle = (num) => { const arr = String(num).split(''); const { ind } = arr.reduce((acc, val, index) => { ... Read More
Life Path NumberA person's Life Path Number is calculated by adding each individual number in that person's date of birth, until it is reduced to a single digit number.ProblemWe are required to write a JavaScript function that takes in a date in “yyyy-mm-dd” format and returns the life path number for that date of birth.For instance, if the date is: 1999-06-10year : 1 + 9 + 9 + 9 = 28 → 2 + 8 = 10 → 1 + 0 = 1 month : 0 + 6 = 6 day : 1 + 0 = 1 result: 1 + ... Read More
ProblemWe are required to write a JavaScript function that takes in two strings s1 and s2 including only letters from ato z.Our function should return a new sorted string, the longest possible, containing distinct letters - each taken only once - coming from s1 or s2.ExampleFollowing is the code − Live Democonst str1 = "xyaabbbccccdefww"; const str2 = "xxxxyyyyabklmopq"; const longestPossible = (str1 = '', str2 = '') => { const combined = str1.concat(str2); const lower = combined.toLowerCase(); const split =lower.split(''); const sorted = split.sort(); const res = []; for(const el of sorted){ ... Read More
ProblemWe are required to design a data structure in JavaScript that supports the following two operations −addWord, which adds a word to that Data Structure (DS), we can take help of existing DS like arrays or any other DS to store this data, search, which searches a literal word or a regular expression string containing lowercase letters "a-z" or "." where "." can represent any letterFor exampleaddWord("sir") addWord("car") addWord("mad") search("hell") === false search(".ad") === true search("s..") === trueExampleFollowing is the code − Live Democlass MyData{ constructor(){ this.arr = []; }; }; MyData.prototype.addWord = function (word) { ... Read More
ProblemWe are required to write a JavaScript function that takes in a number n. Our function should count and return the number of times we will have to use 9 while counting from 0 to n.ExampleFollowing is the code − Live Democonst num = 100; const countNine = (num = 0) => { const countChar = (str = '', char = '') => { return str .split('') .reduce((acc, val) => { if(val === char){ acc++; }; return acc; }, 0); }; let count = 0; for(let i = 0; i
ProblemWe are required to write a JavaScript function that takes in a positive integer n written as abcd... (a, b, c, d... being digits) and a positive integer pwe want to find a positive integer k, if it exists, such as the sum of the digits of n taken to the successive powers of p is equal to k * n.In other words −Is there an integer k such as : (a ^ p + b ^ (p+1) + c ^(p+2) + d ^ (p+3) + ...) = n * kIf it is the case, we will return k, if ... Read More