Akash Deep
BAN USERstatic int[][] solve(int[][] intervals){
Arrays.sort(intervals, (a,b)->a[0]-b[0]);
int start = intervals[0][0];
int end = intervals[0][1];
List<int[]> list = new ArrayList<>();
for(int i=1;i<intervals.length;i++){
int currStart = intervals[i][0];
int currEnd = intervals[i][1];
if(currStart<=end && currEnd>=end){
end = currEnd;
}else if(currStart>end){
list.add(new int[]{start,end});
start = currStart;
end = currEnd;
}
}
list.add(new int[]{start,end});
int[][] res = new int[list.size()][2];
for(int i=0;i<res.length;i++){
res[i] = list.get(i);
}
return res;
}
static int solve(int[][] intervals){
Arrays.sort(intervals, (a,b)->a[0]-b[0]);
PriorityQueue<Integer> queue = new PriorityQueue<>();
Deque<Integer> deque = new ArrayDeque<>();
queue.add(intervals[0][1]);
deque.add(intervals[0][0]);
int count = 0;
int start = 0;
int end = 0;
for(int i=1;i<intervals.length;i++){
if(intervals[i][0]>queue.peek()){
end = 0;
while(!queue.isEmpty() && queue.peek()<intervals[i][0]){
end = queue.remove();
}
start = deque.getFirst();
deque.clear();
count += end-start;
}
queue.add(intervals[i][1]);
deque.add(intervals[i][0]);
}
start = deque.getFirst();
while(!queue.isEmpty()){
end = queue.remove();
}
count += end-start;
return count;
}
import java.util.ArrayList;
public class LongestSubstringWithoutRepeatingCharacter {
public static void main(String[] args) {
String str = "abhdhknxkjankzj";
String result = "";
int index = 0;
ArrayList<Character> list = new ArrayList<Character>();
for(int i=0; index<str.length();){
list.add(str.charAt(i));
for(int j=i+1;j<str.length(); j++)
if(list.contains(str.charAt(j))){
index += list.indexOf(str.charAt(j));
String subStr = (String) str.subSequence(i, j);
if(subStr.length() > result.length())
result = subStr;
break;
}
else
list.add(str.charAt(j));
list.clear();
i = ++index;
}
System.out.println("Result = " + result);
}
}
Yes but we need to apply all combinations of all tiles to get them fit exactly without leaving any gap. NP problem are those problem which needs infinite time to get resolved.
- Akash Deep August 14, 2013Yes it's NP problem, it takes enough time to get solved. As we have a given area and we need to fit tiles in it.
Proved it's NP problem.
- Akash Deep April 26, 2022