Friend Circle - Hackerrank
Posted on June 26, 2015
(Last modified on August 7, 2020)
| 1 minutes
| Kinshuk Chandra
Problem Reference - Hackerrank Problem There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature, i.e., if A is friend of B and B is friend of C, then A is also friend of C. A friend circle is a group of students who are directly or indirectly friends.
You are given a N×N−matrix M which consists of characters Y or N.
[Read More]Lazy Caterer's sequence
Posted on June 10, 2015
(Last modified on August 7, 2020)
| 2 minutes
| Kinshuk Chandra
Problem
Given a circular (or regular polygon) cake and a knife by which you can only cut vertically, find the maximum number of pieces of cake you can get by making n cuts. Write a program to do that.
Solution
The solution to this is very simple, if you know mathematics. :P
Number of pieces p
p = ( n^2+n+2)/2 p = C(n+1,2) + 1 ``` More on wikipedia - [http://en.
[Read More]Lego Blocks Problem
Posted on June 2, 2015
(Last modified on August 7, 2020)
| 1 minutes
| Kinshuk Chandra
K reverse a linked list with increasing K
Posted on May 25, 2015
(Last modified on August 7, 2020)
| 2 minutes
| Kinshuk Chandra
Problem
Reverse k elements in the linked list such that k goes on increasing
Example
Eg. 1 - 2 - 3 - 4 - 5 - 6 - 7
output - 1 - 3 - 2 - 6 - 5- 4 - 7
Solution You can take this problem here. Here we are just increasing k.
public static ListNode<Integer> reverseSubLinkLists(ListNode<Integer> headerNode) { ListNode<Integer> nextNode = headerNode.next; ListNode<Integer> startNode = null; ListNode<Integer> endNode = null; int k = 2; while (nextNode !
[Read More]Convert Binary Tree to Doubly linked list in level order
Posted on May 16, 2015
(Last modified on August 7, 2020)
| 4 minutes
| Kinshuk Chandra
Question: write an algorithm to convert a binary tree into a double linked list. For example, if the input is the binary tree below:
The output will be a double linked list like this:
Solution: there are two tasks in converting a binary tree to a linked list. First of all, we must traverse the tree and visit all the nodes. Second of all, we must break each node from the tree and add it into the linked list.
[Read More]Maximize the number of magical gems by passing through array of house
Posted on May 3, 2015
(Last modified on August 7, 2020)
| 2 minutes
| Kinshuk Chandra
Problem
There was a thief, he has to pass through colored house - which can be red or blue, and contain 0 or more gems. The property of these gems is they multiply the previous gems by the current gems in the house. The houses are in array and thief can only visit once to steal the gems, with the goal of maximizing the gems. Find the range of house where he can maximize the gems in such a way that number of red houses are even.
[Read More]Number of steps required to convert string 1 to string2 when only bring character to first index operation is giving
Posted on May 3, 2015
(Last modified on August 7, 2020)
| 1 minutes
| Kinshuk Chandra
Problem
Given 2 strings - s1 and s2, when only 1 operation is allowed - Moving character at a time but only to the first position.
Example
Example 1
Input
s1 = abcd
s2 = bacd
Output
Ans = 1
Reason, just move b forward and we get it.
Example 2
Input
A = (a)b(cd)e(f)g(hij)
B = ahdjcifbeg
Output
Ans =7
Explanation
A = (a)b(cd)e(f)g(hij)
B = ahdjcifbeg
Characters b,e,g are in the order, rest characters have to brought first.
[Read More]Find the least wastage in cutting the Trees?
Posted on May 3, 2015
(Last modified on August 7, 2020)
| 2 minutes
| Kinshuk Chandra
Problem
You are given n Trees with their heights in an array. and you are given a value k units , that much wood you need to collect. You can have an axe of any height you want but you can use only 1 axe when you choose.
Assume height to be integral value.
Solution So, if height of the tree is H, and you cut it at height X from the ground then H-X will be used will be used.
[Read More]Implement a function similar to diff command in linux
Posted on May 3, 2015
(Last modified on August 7, 2020)
| 2 minutes
| Kinshuk Chandra
Problem Give logic for implementing “diff” command in Linux.
Consider various test cases and explain what will happen in each. The two files are source code and are huge..
For e.g.
File 1: 1-2-3-4
File 2: 1-3-4-2
Solution The operation of diff is based on solving the longest common sub-sequence problem.
In this problem, you have two sequences of items:
a b c d f g h j q z
[Read More]Maximum single sell profit from stock
Posted on April 30, 2015
(Last modified on August 7, 2020)
| 7 minutes
| Kinshuk Chandra
Problem
Suppose we are given an array of n integers representing stock prices on a single day. We want to find a pair (buyDay, sellDay), with buyDay ≤ sellDay, such that if we bought the stock on buyDay and sold it on sellDay, we would maximize our profit.
OR
Given an array arr[] of integers, find out the difference between any two elements such that larger element appears after the smaller number in arr[].
[Read More]