LinkedIn Interview Questions

Saurabh S. - "Basic Approach As BST inorder traversal will result in a sequence of increasing order. Store that order in a vector and get the k-1 index to get the Kth smallest element, similarly access the N-K+1 th element will be the Kth largest element Time Complexity: O(n) Space Complexity O(n) Space Optimized Approach For Kth smallest , start inorder traversal, and keep a counter, decrement the counter when you access the node element. When the counter turns 0 that elementwill be the Kth smal"See full answer

Newsha M. - "get rid of competition, acquire more users"See full answer

Shivam P. - " First, sort the array in ascending order. This ensures that we can easily check the triangle inequality condition. Use a loop to iterate through the array. For each triplet of consecutive elements, check if they satisfy the triangle inequality condition a+b>ca+b>c. As soon as you find a valid tuple, return it. If no valid tuple is found, return null. This approach is efficient with a time complexity of O(nlog⁡n)O(nlogn) due to the sorting step, followed by a linear scan of the array"See full answer

Anonymous Muskox - "Clarification Question what does it mean by the different markets? Emerging market, developing market, or developed market. Technical Front Low bandwidth or network can affect the performance Latency can be high if the server is not placed near to the regions Business Front The average number of people who indulge in corporate or white collar jobs is very less. Jobs in the local market is very less People who don't have smartphone/desktop excess extensively may not be present on the"See full answer

Rg - "Used prefix & postfix sums, resetting the product when 0 was found"See full answer

Anonymous Crayfish - "Let me tell you about a time when I learnt the craft of writing and sending emails. I worked at an early stage startup that does voice recording and transcription and one of my primary responsibilities was to engage with existing customers. At that time, there were a around 10k users in total. I decided to split the entire user base into cohorts. Users who've recorded and transcribed atleast 10 words within 3 months Users who've recorded and transcribed atleast 10 words within 3- 6 month"See full answer

Shaxboz A. - "#include #include using namespace std; int main() { int n; cin >> n; int a[n]; for(int i=0; i=0 and a[i]<=2) { sort(a[0], a[n]); } } cout << "After sorting array: "; for(int i=0; i<n; i++) { cout << a[i] << " "; } }"See full answer

Anonymous Fish - "Some of the best practices I found in the best PMs is Structure - Often times the problems we are dealing with in corporate are going to be ambiguous. Best PMs will try to scope it down and bring a clarity to the ambiguous problem statement. This can be observed in simple things like planning a day, planning a trip or planning a house hunt. They will approach problems with some structure in place Getting the buy in from people - I found that often times PMs are the people who doesn't have"See full answer

Relynn may silver B. - "import java.util.Arrays; import java.util.stream.Collectors; class Main { // Recursive function to print all combinations of numbers from \i\ to \n\ // having sum \n. The index\ denotes the next free slot in the output array \out\ public static void printCombinations(int i, int n, int[] out, int index) { // if the sum becomes n, print the combination if (n == 0) { System.out.println(Arrays.stream(out).limit(index) .boxed().collect(Collectors.toList())); } // start from the previous e"See full answer

Rahul J. - "LinkedIn as a platform is targeted primarily towards professionals who use it to search for and apply to jobs. Professionals can also share content like career updates, thought leadership, achievements etc. The business model of LinkedIn is twofold: Ads revenue in the content section Promoted job posts from recruiters Evaluate the business model of competitor and which customer unmet needs are they solving. Evaluate what impact is it having on our business - are DAU / WAU going down / job p"See full answer