你们要的Twitter OA (含Java代码）

duziyuanyang · 2016-10-31 04:32:10

注册一亩三分地论坛，查看更多干货！

您需要登录才可以下载或查看附件。没有帐号？注册账号

x

这一周都在准备Twitter的OA,感谢地里各种好人的无私贡献，基本把最近的题都做了下，自己抽到的是3题版，time series aggregation那题不论是用treemap还是priorityQueue都只能过第1个test case,后面4个死活过不去，在一楼贴上代码，如果有好心人帮忙看下，提

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限或查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

1-15 04:20):
据说hackerrank的后台检测代码查重机制很准，不光是twitter,今后大家做其它家的hackerrank OA也要注意，祝好运！

duziyuanyang · 2016-10-31 04:55:02

longest phrases in a tweet, 水题，类似unique paths, pass all test cases

您好！
本帖隐藏的内容需要积分高于 133 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 133 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限或查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

elizabethxiazhi · 2016-10-31 06:04:23

LZ人真好，刚花了两个多小时写twitter,time series 那个题目过了，我开始也只过一个case,后来用treemap<time, treemap<engagement, count>>做的就都过去了。。。（原来用的treemap<time,List<>()>）.....

duziyuanyang · 2016-10-31 04:36:39

parent, child, tree那题，选Oracle, pass all test case

SELECT
Id,
CASE
WHEN M IS NULL THEN 'Leaf'
WHEN P_id IS NULL THEN 'Root'
ELSE 'Inner'
END AS TypeNode
FROM(
SELECT
DISTINCT hijo.*, padre.P_id as M
FROM Tree hijo
LEFT JOIN Tree padre ON(hijo.Id = padre.P_id)
)ORDER BY Id;

复制代码

duziyuanyang · 2016-10-31 04:34:47

Time series aggregation的代码，只能过第一个test case,感觉自己代码逻辑没问题，应该是某处小bug,傻逼hacker rank还不显示test case真是醉了。。求好心人提示下错在哪里。。

public class Solution {
static String beginMonth;
static String endMonth;
// static Map<String, Map<String, Integer>> logs = new TreeMap<>(Collections.reverseOrder());
static Map<String, Map<String, Integer>> logs = new HashMap<>();
static PriorityQueue<Log> maxHeap;
static class LogComparator implements Comparator<Log>{
public int compare(Log log1, Log log2){
String date1 = log1.date;
String date2 = log2.date;
String category1= log1.category;
String category2 = log2.category;
if(date1.equals(date2)){
return category1.compareTo(category2);
}else{
return date2.compareTo(date1);
}
}
}
static class Log{
String date;
String category;
int cnt;
Log(String date, String category, int cnt){
this.date = date;
this.category = category;
this.cnt = cnt;
}
}
static String removeDD(String date){
//return date;
Date initDate = null;
try{
initDate = new SimpleDateFormat("yyyy-MM-dd").parse(date);
}catch (ParseException e){
e.printStackTrace();
}
SimpleDateFormat formatter = new SimpleDateFormat("yyyy-MM");
String parsedDate = formatter.format(initDate);
return parsedDate;
}
static boolean isBefore(String d1, String d2){
SimpleDateFormat format = new SimpleDateFormat("yyyy-MM");
Date date1 = null;
Date date2 = null;
try{
date1 = format.parse(d1);
date2 = format.parse(d2);
}catch(ParseException e){
e.printStackTrace();
}
return date1.before(date2);
}
public static void main(String args[] ) throws Exception {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
String line = null;
int num = 0;
try{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while((line = br.readLine()) != null){
if(num == 0){
String[] interval = line.trim().split(",");
if(interval.length != 2){
throw new Exception("invalid input!");
}
beginMonth = interval[0].trim();
endMonth = interval[1].trim();
//System.out.println(line);
num++;
}else if(num == 1){
num++;
continue;
}else{
//System.out.println(line);
String[] lines = line.trim().split(",");
if(lines.length != 3){
throw new Exception("invalid input!");
}
String date = lines[0].trim();
//System.out.println(date);
String trans_date = removeDD(date);
//System.out.println(trans_date);
String category = lines[1].trim();
String count = lines[2].trim();
int cnt = Integer.parseInt(count);
//System.out.println(date);
if(isBefore(trans_date, beginMonth) || isBefore(endMonth, trans_date) || cnt == 0) continue;
if(!logs.containsKey(trans_date)){
logs.put(trans_date, new HashMap<String, Integer>());
}
Map<String, Integer> map = logs.get(trans_date);
if(!map.containsKey(category)){
map.put(category, cnt);
}else{
map.put(category, map.get(category) + cnt);
}
logs.put(trans_date,map);
num++;
}
}
}catch (Exception e){
e.printStackTrace();
}
maxHeap = new PriorityQueue<Log>(num, new LogComparator());
for(Map.Entry<String, Map<String, Integer>> entry : logs.entrySet()){
String date = entry.getKey();
//System.out.println(date);
Map<String, Integer> map = entry.getValue();
for(Map.Entry<String, Integer> sub_entry : map.entrySet()){
String category = sub_entry.getKey();
int cnt= sub_entry.getValue();
maxHeap.offer(new Log(date, category, cnt));
//System.out.println(date + " " + category + " " + cnt);
}
}
Log prev = null;
StringBuilder sb = new StringBuilder();
while(!maxHeap.isEmpty()){
Log cur = maxHeap.poll();
if(prev == null){
sb.append(cur.date);
sb.append(',');
sb.append(' ');
sb.append(cur.category);
sb.append(',');
sb.append(' ');
sb.append(cur.cnt);
}else if(prev.date.equals(cur.date)){
sb.append(',');
sb.append(' ');
sb.append(cur.category);
sb.append(',');
sb.append(' ');
sb.append(cur.cnt);
}else{
String printString = sb.toString();
System.out.println(printString);
sb = new StringBuilder();
sb.append(cur.date);
sb.append(',');
sb.append(' ');
sb.append(cur.category);
sb.append(',');
sb.append(' ');
sb.append(cur.cnt);
}
prev = cur;
}
String printString = sb.toString();
System.out.println(printString);
/*
for(Map.Entry<String, Map<String, Integer>> entry : logs.entrySet()){
StringBuilder sb = new StringBuilder();
String date = entry.getKey();
sb.append(date);
Map<String, Integer> map = entry.getValue();
for(Map.Entry<String, Integer> sub_entry : map.entrySet()){
String category = sub_entry.getKey();
int cnt= sub_entry.getValue();
sb.append(',');
sb.append(' ');
sb.append(category);
sb.append(',');
sb.append(' ');
sb.append(cnt);
}
System.out.println(sb.toString());
}
*/
}
}

复制代码

duziyuanyang · 2016-10-31 04:35:55

Orders 1的SQL代码，passed all test case

select o.customerNumber as customer
from ORDERS as o
group by customerNumber
order by count(orderNumber) desc
limit 1;

复制代码

duziyuanyang · 2016-10-31 04:38:55

employee, department题，自己没遇到，不过同学试了通过了

select d.Name, count(e.ID) as ID_COUNT
from Department d
left join Employee e
on e.DEPT_ID = d.DEPT_ID
group by d.Name
order by ID_COUNT desc, NAME

复制代码

sccnju · 2016-10-31 04:41:36

谢谢楼主。我跟楼主一样也是只能过第一个test case。。醉了。。。看了下楼主的code觉得没什么毛病。。。。

再次吐槽一下居然不给看test case。。。。

duziyuanyang · 2016-10-31 04:52:46

encrypt and decrypt message, 这题搞了我一晚上时间，结果点开oa发现没有这题。。anyway,我的代码自己拿case跑了一下，如果有问题欢迎指正

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限或查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

duziyuanyang · 2016-10-31 04:54:06

expression tree,这题我自己也没遇到，不过貌似是个高频题，贴上代码欢迎讨论，因为没有跑过hackerrank,不保证能pass all test case

static String experssionTree(String string){
String[] input = string.trim().split("/");
String expression = input[0];
String operation = input[1];
for(char op : operation.toCharArray()){
if(op == 'R'){
expression = reverse(expression);
}
if(op == 'S'){
expression = simplify(expression);
}
}
return expression;
}
static String reverse(String s){
char[] arr = s.toCharArray();
int begin = 0, end = arr.length - 1;
while(begin < end){
char tmp = arr[begin];
arr[begin] = arr[end];
arr[end] = tmp;
if(arr[begin] == '('){
arr[begin] = ')';
}else if(arr[begin] == ')'){
arr[begin] = '(';
}
if(arr[end] == '('){
arr[end] = ')';
}else if(arr[end] == ')'){
arr[end] = '(';
}
begin++;
end--;
}
return new String(arr);
}
static String simplify(String s){
boolean firstLeft = true;
char[] arr = s.toCharArray();
Stack<Integer> stk = new Stack<>();
List<Integer> index = new ArrayList<>();
for(int i = arr.length - 1; i >= 0; i --){
if(arr[i] == ')'){
stk.push(i);
}
if(arr[i] == '('){
int rightIndex = stk.pop();
if(firstLeft == true){
int leftIndex = i;
index.add(rightIndex);
index.add(leftIndex);
firstLeft = false;
}else{
if(stk.isEmpty()){
firstLeft = true;
}
}
}
}
StringBuilder sb = new StringBuilder(s);
Iterator<Integer> iterator = index.iterator();
while(iterator.hasNext()){
int id = iterator.next();
sb = sb.deleteCharAt(id );
}
return sb.toString();
}

复制代码

你们要的Twitter OA (含Java代码）

注册一亩三分地论坛，查看更多干货！

评分

相关帖子

本帖被以下淘专辑推荐:

浏览过的版块

	6垅无效楼层，该帖已经被删除