Google Interview Question
Longest increasing sequence
Interview Answer
Anonymous
Aug 2, 2015
public static int max_sub(int[] arr, int n){ int[] temp = new int[n]; for(int i=0;iarr[j] && temp[i]max) max=temp[i]; } return max; }
Longest increasing sequence
Anonymous
public static int max_sub(int[] arr, int n){ int[] temp = new int[n]; for(int i=0;iarr[j] && temp[i]max) max=temp[i]; } return max; }
Check out your Company Bowl for anonymous work chats.
Copyright © 2008-2026. Indeed, Inc. "Glassdoor," "Worklife Pro," "Bowls," and logo are proprietary trademarks of Indeed, Inc.