ADDITIONAL KNOWLEDGE

Blog

additionalknowledge.com/

Profile

additionalknowledge.com/author

Homepage

additionalknowledge.wordpress.

  • Big Sorting[HackerRank Solution]

    Big Sorting[HackerRank Solution] Problem: Consider an array of numeric strings, , where each string is a positive number with anywhere from  to  digits. Sort the array’s elements in non-decreasing (i.e., ascending) order of their real-world integer values and print each element of the sorted array on a new line. Input Format The first line contains an integer, , denoting the number…

  • Monk and Philosopher’s Stone[Hackerearth Solution]

    Monk and Philosopher’s Stone[Hackerearth Solution] PROBLEM: Harry Potter wants to get the Philosopher’s stone to protect it from Snape. Monk being the guard of Philosopher’s Stone is very greedy and has a special bag, into which he can add one gold coin at a time or can remove the last gold coin he added. Monk…

  • Count Substrings[GeeksforGeeks solution]

    Count Substrings[GeeksforGeeks solution] Question: Given a binary string, count number of substrings that start and end with 1. For example, if the input string is “00100101”, then there are three substrings “1001”, “100101” and “101”. Input: The first line contains T denoting the number of testcases. Then follows description of testcases. Each case contains a string…

  • Find Merge Point of Two Lists [hackerRank Solution]

    Find Merge Point of Two Lists [hackerRank Solution] Question: Given pointers to the head nodes of  linked lists that merge together at some point, find the Node where the two lists merge. It is guaranteed that the two head Nodes will be different, and neither will be NULL. In the diagram below, the two lists converge…

  • Delete duplicate-value nodes from a sorted linked list[HackerRank solution]

    Delete duplicate-value nodes from a sorted linked list[HackerRank solution] Question: You’re given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete as few nodes as possible so that the list does not contain any value more than once. The given head pointer…

  • Get Node Value [HackerRank solution]

    Get Node Value [HackerRank solution] You’re given the pointer to the head node of a linked list and a specific position. Counting backwards from the tail node of the linked list, get the value of the node at the given position. A position of 0 corresponds to the tail, 1 corresponds to the node before…

  • Monk and Rotation [Hacker earth]

    Monk and Rotation [Hacker earth] PROBLEM: Monk loves to preform different operations on arrays, and so being the principal of Hackerearth School, he assigned a task to his new student Mishki. Mishki will be provided with an integer array AA of size NN and an integer KK , where she needs to rotate the array in the right direction by K…

  • USING SCANNER FOR INPUT IN JAVA

    USING SCANNER FOR INPUT IN JAVA Scanner is a class in java.util package used for obtaining the input of the primitive types like int, double etc. and strings. In Java, we input with the help of the Scanner class. Java has a number of predefined classes which we can use. import java.util.Scanner;  // This will import just the Scanner class…

  • Sum of digits in c or c++ without pointers

    Sum of digits in c or c++ without pointers   SO, the main logic behind this is=: b = a%10; // we took the remainder after dividing by 10 thats the last digit sum = sum+ (b*c); // adding last digit to sum a = a/10; //to remove last digit from a c= c/10; //to…

  • Append in rails[AJAX][info]

    Append in rails THESE both line ; the line 3 and 9 meant same. You can use either of them. These lines are used when you want to append html pages using ajax.