Upload Button Icon Add office photos

LinkedIn

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

LinkedIn Senior Software Engineer Interview Questions and Answers

Updated 10 Dec 2024

LinkedIn Senior Software Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Minimum Knight Moves (LC Medium)
  • Q2. OS, CN, DB concepts like multithreading, semaphore, tcp vs udp, transaction and ACId properties. Java concepts like stack vs heap(memory), error vs exception. Any 1 Project discussion for 10 mins

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare all the fundamental concepts of operating systems and databases. Refer to the company-tagged questions from LC.

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: First round was a written test which had 20 MCQ's in the field of Databases, Theory of computation, Operating systems, Data Structures and Algorithms and one programming question. 7 students (4 B.Tech, 3 M.Tech) got through to the interviews. Most of the interviews were held in the Google Bangalore campus. There were a total of 5 rounds of interviews. All based on Data Structures and Algorithms. Each round had 2 questions for which we were usually supposed to explain the algorithm first and then write the code on a Google doc.  It was a really great experience. I got a chance to visit both Google Bangalore and Hyderabad campuses and taste their awesome food.
Total Questions: 20

General Tips: Practice your coding skills. Writing a neat code is very important. Interviewers not just look for a good algorithm but also your coding style (indentation, variable names, simplicity etc.)
College Name: NIT SURATHKAL

Software Developer Interview Questions & Answers

Google user image Sree Meghana Thotakuri

posted on 10 Mar 2015

Interview Preparation Tips

Round: Test
Experience: Google's APAC test is an online coding round. The test is for 3 hours and it has 4 coding questions.
Duration: 180 minutes

Round: Technical Interview
Experience: I had 3 technical interviews. The questions asked in them consisted of algorithmic coding and design questions. The approach was more stressed upon. The interviewers were very helpful and they were generous in throw hints whenever I was blocked.

Skills: Algorithmic coding , C++
College Name: IIT BOMBAY

Interview Questionnaire 

13 Questions

  • Q1. Given a source array of integers with possible duplicates and a target integer, write algorithm to find out 2 numbers in source array whose sum is equal to target integer
  • Ans. 

    Algorithm to find 2 numbers in an array whose sum is equal to a target integer

    • Use a hash table to store the difference between target and each element in the array

    • Iterate through the array and check if the current element exists in the hash table

    • Return the pair of elements that sum up to the target integer

  • Answered by AI
  • Q2. Say you have three tables WORK, USERS, MANAGERS WORK - work_id - user_id - how_much USERS - user_id - team MANAGERS - manager_id - team If I am a manager, write a select statement to retrieve the work o...
  • Ans. 

    Write a select statement to retrieve work of all users who belong to my team.

    • Join USERS and WORK tables on user_id

    • Join MANAGERS and USERS tables on team

    • Filter by manager_id

  • Answered by AI
  • Q3. In a Chrome extension, which file contains the most important information of the extension like version, pattern matches, etc
  • Ans. 

    The manifest.json file contains the most important information of a Chrome extension.

    • The manifest.json file includes the version number, permissions, content scripts, background scripts, and other important details.

    • It is located in the root directory of the extension.

    • It is required for all Chrome extensions.

    • Example: "manifest_version": 2, "version": "1.0", "permissions": ["tabs", "storage"]

  • Answered by AI
  • Q4. There are three rooms, and there are Princess, Flowers and Snake in those rooms. The doors of all the rooms have incorrect nameplates. i.e., the nameplate for the princess’ room is not Princess. Similarly,...
  • Q5. Which is faster: finding an item in a hashtable or in a sorted list? And Why?
  • Ans. 

    Hashtable is faster for finding an item than a sorted list.

    • Hashtable has constant time complexity O(1) for finding an item.

    • Sorted list has logarithmic time complexity O(log n) for finding an item.

    • Hashtable uses hashing to directly access the item's location.

    • Sorted list requires binary search to find the item's location.

    • Hashtable is ideal for large datasets with frequent lookups.

    • Sorted list is ideal for datasets that re

  • Answered by AI
  • Q6. What are some of the most popular Data interchange formats when using APIs
  • Ans. 

    JSON and XML are the most popular data interchange formats when using APIs.

    • JSON (JavaScript Object Notation) is a lightweight format that is easy to read and write. It is widely used in web APIs.

    • XML (Extensible Markup Language) is a more complex format that is also widely used in web APIs.

    • Other formats include CSV (Comma Separated Values), YAML (YAML Ain't Markup Language), and Protocol Buffers.

  • Answered by AI
  • Q7. Name some popular APIs for each of these Social Commerce service(llike a photo service etc)
  • Ans. 

    Popular APIs for Social Commerce services

    • Facebook Graph API for social media integration

    • Instagram API for photo sharing and tagging

    • Twitter API for real-time updates and customer engagement

    • Pinterest API for product discovery and sharing

    • Google Maps API for location-based services

    • PayPal API for secure payment processing

  • Answered by AI
  • Q8. How would you change the format of all the phone numbers in 1000 static html pages?
  • Ans. 

    Use a script to iterate through each HTML page, locate phone numbers, and update their format.

    • Write a script using a programming language like Python or JavaScript to iterate through each HTML page

    • Use regular expressions to locate phone numbers in the pages

    • Update the format of the phone numbers as needed (e.g. adding country code, changing separators)

    • Save the updated HTML pages with the new phone number format

  • Answered by AI
  • Q9. If you had an opportunity to design the Google Suggest system, please let us know how you would approach it and how you would execute the plan in terms of settings up systems like(data stores or databases,...
  • Ans. 

    Designing Google Suggest system

    • I would start by analyzing user search patterns and frequently searched keywords

    • Then, I would create a database of these keywords and their associated search results

    • I would use indexing services to quickly retrieve relevant results for each keyword

    • I would also implement machine learning algorithms to improve the accuracy of suggestions over time

  • Answered by AI
  • Q10. How do you find out if a number is a power of 2? And how do you know if it is an odd number? Write code in the language of your choice
  • Ans. 

    Check if a number is a power of 2 and odd.

    • To check if a number is a power of 2, use bitwise AND operator with the number and its predecessor. If the result is 0, it is a power of 2.

    • To check if a number is odd, use modulus operator with 2. If the result is 1, it is odd.

    • Example code in Python:

    • def is_power_of_two(num):

    • return num & (num - 1) == 0

    • def is_odd(num):

    • return num % 2 == 1

  • Answered by AI
  • Q11. How will improve the revenue of the cafeteria of the office.
  • Ans. 

    By introducing new menu items, optimizing pricing strategy, and improving the overall dining experience.

    • Conduct a survey to understand the preferences of employees

    • Introduce healthy and affordable meal options

    • Offer discounts for bulk orders or loyalty programs

    • Partner with local vendors to source fresh ingredients

    • Improve the ambiance and seating arrangements

    • Implement online ordering and delivery services

  • Answered by AI
  • Q12. [Actual question which i screwed up. Bad Time for me]Number of users in 2001 for adwords, chrome, gmail, android and picassa are in the ratio of 6:9:14:13:8, and in 2004 we add 3 lakh more users. New rati...
  • Q13. In google adwords there are about 30 million ads from 42 lanuages . What will I do review the ads and reject ads that do not comply with specific rules
  • Ans. 

    Reviewing 30 million ads from 42 languages in Google AdWords and rejecting non-compliant ads requires a systematic approach.

    • Create a set of specific rules and guidelines for ad compliance

    • Use automated tools to filter out ads that violate the rules

    • Assign a team of reviewers to manually check the remaining ads

    • Ensure that the reviewers are fluent in the languages of the ads they are reviewing

    • Regularly update the rules and...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: I was asked to take the test at 8.30 pm. They fixed this test, a week back. Nobody will call you to remind you to take test. Nor the interviewer will call you. It is your responsibility to check ur mail without fail. On that day I was expecting a call from google from evening till 8.25 pm. None called me. I thought that they would have forgot that. I planned to do go out and have food. But suddenly my ipad gave a alert message and it was from gmail app [thanks for ipad, or else i would not have checked my mail in lap top]. It was from google recruiter. The mail stated that he has shared a doc with me and i must answer the questions in it. a google drive link was given. he mentioned that the test was for 2 hours. I was asked to type answers just below each of these questions.
Duration: 120 minutes

Round: Technical Interview
Experience: Since I had prepared for tech interviews like amazon, I was able to do it good.After a week I got a call from HR and informed that I cleared the first round. Then after two days I was told that i will have a telephonic interview with one of the google developers from adwords team . They scheduled a telephonic interview the next week

Round: Technical Interview
Experience: 1) How will improve the revenue of the cafeteria of the office. Lots of discussions went and i think, i really did that well.
2)[Actual question which i screwed up. Bad Time for me]
Number of users in 2001 for adwords, chrome, gmail, android and picassa are in the ratio of 6:9:14:13:8, and in 2004 we add 3 lakh more users. New ratio is 8:12:13:11:6. Number of picassa users in 2004= 1,44,000. Calculate number of adwords users in 2005.A basic math question that, even a school student can solve. But in that tension i was not able to do it. I took some time and finally gave him a answer. I myself knew that it would be wrong. But interviewer said great lets move on to next question[just to boost up me - good person].My actual job role revolves around developing tools for the the ad review team which will review the ad and reject illlegal ones. So third question was related to that .He told me that as I am from a tech background, I need to explain him technically wat will I do. He also said that he did not need the actual solution. They will just see the way I approach the problem. That an existing problem and they are open to suggestions.3)In google adwords there are about 30 million ads from 42 lanuages . What will I do review the ads and reject ads that do not comply with specific rules .Regarding the criteria under which google bans a ad as illegal – I discussed about different criteria .Out of the criteria’s i told , he asked me to consider only three criteria .
a) Link not working
b) Drug related ads
c) trademarks[trademark used by the companies]I gave lot of approaches like for link not workinga) designing a autobot which will automatically click ads link and check whether it is redirecting to correct page or not . Autobots are used by hackers to get money for the ads they posted . I suggested that by designing similar autobot we can validate the link.b) to check drug related ads -
To detect the language we can first check the geographic location from which the ad is getting posted and can narrow down to some less choices from which we can detect the language
i suggested him that we can create a trie which some specific keywords (like coccaine ) and do pattern matching with that and reject the add it contains any of the works in trie .The interviewer gave me another constraint wat if there comes a ad “coccaine rehabilitation center” we should reject those kind of ads na . thats for a good cause . So i suggested him that i can maintain another set of trie which can contain those set of keywords.Fist check trie1 if drug related keywords exist .
Next check trie 2 if other types of keyword exist.
– if keyword only present in trie1 [reject ad]
– if both tire return true [can reject . but its better that those ad's alone can be subjected to manual evaluation for rejection].I used trie as it can do the pattern matches faster .For trademarks also I discussed using similar datastructures and the interviewer was ok with my answer.

General Tips: I applied for a job in Google jobs page. I know that its very difficult that a resume gets noticed by google.Suddenly one fine day i got a call from Google HR saying that they are interested in my profile and asked me if, i was ready to go with the interview process[Come on! who will say no for Google]. I was surprised.I was asked to take a initial screen test [Online test].
Skills: data structure, Algorithm
College Name: na

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Adobe user image Devendra Bendkhale

posted on 4 Dec 2015

Interview Questionnaire 

8 Questions

  • Q1. WRITE A GENERIC SWAP FUNCTION
  • Ans. 

    A generic swap function swaps two values of any data type.

    • The function should take two parameters of any data type.

    • Use a temporary variable to store the value of one parameter.

    • Assign the value of the second parameter to the first parameter.

    • Assign the value of the temporary variable to the second parameter.

  • Answered by AI
  • Q2. SEARCH AN ELEMENT IN ROTATED SORTED LINKLIST .
  • Ans. 

    Search for an element in a rotated sorted linked list.

    • Find the pivot point where the list is rotated.

    • Divide the list into two sublists based on the pivot point.

    • Perform binary search on the appropriate sublist.

    • Handle edge cases such as empty list and list with only one element.

  • Answered by AI
  • Q3. SEARCH AN ELEMENT IN ROTATED SORTED ARRAY. WRITED A CODE FOR IT
  • Ans. 

    Search an element in a rotated sorted array

    • Find the pivot point where the array is rotated

    • Divide the array into two sub-arrays based on pivot point

    • Perform binary search on the appropriate sub-array

    • Repeat until element is found or sub-array size is 1

  • Answered by AI
  • Q4. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
  • Ans. 

    Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.

    • Create a boolean array of size 100 and mark the present numbers

    • Iterate through the boolean array and find the missing numbers

    • Alternatively, use a HashSet to store the present numbers and find the missing ones

  • Answered by AI
  • Q5. Given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
  • Ans. 

    Given a Sudoku board, find possible numbers for an empty cell.

    • Iterate through empty cells and check possible numbers using row, column, and box constraints.

    • Use a set to keep track of possible numbers for each empty cell.

    • Return the set of possible numbers for the given empty cell.

  • Answered by AI
  • Q6. Given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
  • Ans. 

    Find integer average of 4 unsigned integers without typecasting

    • Add all the integers and divide by 4

    • Use bit shifting to divide by 4

    • Handle overflow by using long long data type

    • Use unsigned int data type for input

  • Answered by AI
  • Q7. Write a code to identify wheter given processor is of 32 bit architecture or 64 bit architecture
  • Ans. 

    Code to identify 32 bit or 64 bit architecture of a processor

    • Check if the operating system is 32 bit or 64 bit

    • If OS is 32 bit, processor is 32 bit

    • If OS is 64 bit, check if processor supports 64 bit architecture

    • Use CPUID instruction to check if processor supports 64 bit architecture

  • Answered by AI
  • Q8. Convert a binary number into base 64 integer
  • Ans. 

    Convert binary number to base 64 integer

    • Divide the binary number into groups of 6 bits

    • Convert each group of 6 bits to decimal

    • Map the decimal value to the corresponding base 64 character

    • Concatenate the base 64 characters to form the final integer

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: SIMPLE CODING QUESTIONS SPEED MATTERS.
Duration: 60 minutes
Total Questions: 3

Skills: Analytics And Coding
College Name: IIT Guwahati

Skills evaluated in this interview

Interview Questionnaire 

7 Questions

  • Q1. Image data structure: An image(square image) can be stored as a tree: A node is white if the image is white, is black if the image is black, and is mixed if it contains both. White and black nodes are leav...
  • Q2. There is a dictionary containing words in sorted order. These words consist of some alien alphabets. Using the dictionary, find out the ordering between the alphabets. For eg, if English was the alien lang...
  • Q3. A / b c / / d e f g Print the nodes in the following order: a, b, c, g, f, e, d, h, i, j, k, l ,m, n, o and so on. Which all data structures are used? Can we use just 1?
  • Ans. 

    Multiple data structures are used to print nodes in a specific order. One data structure cannot be used alone.

    • The given order suggests a depth-first search traversal of a tree-like structure.

    • A stack can be used to keep track of the nodes to be visited.

    • A queue can be used to store the children of a node in the order they are visited.

    • An array can be used to store the nodes in the required order.

    • A linked list can be used ...

  • Answered by AI
  • Q4. Given 2 strings like bangalore and blr, return whether one appears as a subsequence of the other. The above case returns true whereas bangalore and brl returns false
  • Q5. Given n pens and n tops, each pen (and each top) having a size different than the other and each pen fitting exactly one top, find the largest pen using minimum number of comparisons. A comparison involves...
  • Ans. 

    Find largest pen using minimum comparisons with tops.

    • Divide pens into two groups and compare largest pen from each group with largest top.

    • Repeat the process with the group containing the largest pen until only one pen is left.

    • The remaining pen is the largest pen.

    • Total number of comparisons required is 2n-3.

  • Answered by AI
  • Q6. Given n dice, each of 'a' sides and a sum b, return the number of ways in which the sum b can be obtained. How can you reduce the time complexity and space complexity?
  • Ans. 

    Given n dice with 'a' sides and sum b, return no. of ways to obtain b. Optimize time and space complexity.

    • Use dynamic programming to reduce time complexity

    • Create a 2D array to store the number of ways to obtain each sum for each number of dice

    • Use rolling arrays to optimize space complexity

    • Example: n=2, a=6, b=7 -> 6 ways to obtain sum 7

    • Example: n=3, a=4, b=8 -> 21 ways to obtain sum 8

  • Answered by AI
  • Q7. Given 2 machines, each having 64 GB RAM, containing all integers (8 byte), sort the entire 128 GB data. You may assume a small amount of additional RAM. Extend this to sort data stored in 1000 machines
  • Ans. 

    Sort 128 GB data on 2 machines with 64 GB RAM each. Extend to 1000 machines.

    • Use external sorting algorithm like merge sort or quick sort

    • Divide data into smaller chunks and sort them individually

    • Merge sorted chunks using additional RAM

    • For 1000 machines, use distributed sorting algorithms like MapReduce or Hadoop

    • Ensure data consistency and fault tolerance in distributed sorting

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There was a preliminary test, wherein questions on discrete structures, data structures, algorithms, math (permutation, combinations, probability) and operating systems were asked. There was also a programming question to code (on paper). It took them around 3 weeks to shortlist students selected for interviews.

Round: Technical Interview
Experience: It took them about a month's time to announce results!

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.

  • Q1. 

    Maximum Sum Path in a Binary Tree Problem Statement

    You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...

  • Ans. 

    Find the maximum sum achievable by a simple path between any two nodes in a binary tree.

    • Traverse the binary tree to find all possible paths and calculate their sums.

    • Keep track of the maximum sum encountered during traversal.

    • Consider paths that may include the same node twice.

    • Implement a recursive function to explore all possible paths.

    • Handle cases where nodes have negative values.

  • Answered by AI
  • Q2. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal, and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.

  • Q1. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    Find the Next Greater Element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements with no greater element to the right

    • Pop elements from the stack until finding a greater element or stack is empty

  • Answered by AI
  • Q2. 

    Number In Arithmetic Progression Problem

    Given three integers X, C, and Y, where X is the first term of an arithmetic sequence with a common difference of C, determine if Y is part of this arithmetic sequ...

  • Ans. 

    Check if a given number is part of an arithmetic sequence with a given first term and common difference.

    • Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C

    • Check if Y is equal to any term in the sequence to determine if it belongs to the sequence

    • Return 'True' if Y belongs to the sequence, otherwise return 'False'

  • Answered by AI
  • Q3. Can you define process and threads in operating systems?
  • Ans. 

    Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.

    • A process is a program in execution, consisting of code, data, and resources.

    • Threads are smaller units within a process that can execute independently.

    • Processes have their own memory space, while threads share the same memory space within a process.

    • Processes are heavyweight, while threads ar...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

  • Q1. 

    Max Product Subset Problem Statement

    Given an array/list arr of size n, determine the maximum product possible by taking any subset of the array/list arr. Return the result modulo 10^9+7 since the product ...

  • Ans. 

    Find the maximum product of a subset of an array modulo 10^9+7.

    • Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.

    • Handle cases where the array contains zeros separately.

    • Return the maximum product modulo 10^9+7.

  • Answered by AI
  • Q2. 

    Populating Next Right Pointers in Each Node

    Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.

    ...
  • Ans. 

    Implement a function to update 'next' pointers in a complete binary tree.

    • Iterate level by level using a queue

    • Connect nodes at each level using 'next' pointers

    • Handle null nodes appropriately

    • Ensure the tree is a complete binary tree

  • Answered by AI
  • Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.

  • Q1. 

    Stack with getMin Operation

    Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...

  • Ans. 

    Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.

    • Use two stacks - one to store the actual elements and another to store the minimum element at each level.

    • When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

    • When popping an element, also pop from the minimum stack if the popped element is t...

  • Answered by AI
  • Q2. 

    Split Array Into Maximum Subarrays Problem Statement

    You are given an integer array arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...

  • Ans. 

    Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.

    • Iterate through the array and keep track of the first and last occurrence of each element.

    • Use a hashmap to store the indices of each element.

    • Split the array whenever the last occurrence of an element is found.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAdobe interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

20 Questions

  • Q1. He asked me my specialization?
  • Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
  • Q3. He asked me to tell him about my favorite project
  • Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
  • Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
  • Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
  • Ans. 

    To determine if a point is inside a polygon, use the ray casting algorithm.

    • Create a line from the point to a point outside the polygon

    • Count the number of times the line intersects with the polygon edges

    • If the count is odd, the point is inside the polygon; otherwise, it is outside

  • Answered by AI
  • Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
  • Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
  • Q9. Which are the four storage classes in C
  • Ans. 

    The four storage classes in C are auto, register, static, and extern.

    • Auto: default storage class for all local variables

    • Register: used to define local variables that should be stored in a register instead of RAM

    • Static: used to define local variables that retain their value between function calls

    • Extern: used to declare a global variable that is defined in another file

  • Answered by AI
  • Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
  • Ans. 

    i is stored in global data segment, j is stored in stack, k is stored in heap.

    • i is a global variable and is stored in the global data segment

    • j is a local variable and is stored in the stack

    • k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()

  • Answered by AI
  • Q11. Question on polymorphisms
  • Q12. He again went back to the first question he had asked me. Once again
  • Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
  • Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
  • Ans. 

    Use a hash table to store the words and check for existence in constant time.

    • Create a hash table with the words as keys and a boolean value as the value.

    • For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.

    • Alternatively, use a set data structure to store only the unique words and check for existence in the set.

  • Answered by AI
  • Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
  • Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
  • Q17. Finally, he asked me whether I had any questions
  • Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
  • Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
  • Q20. We also talked a bit about my phone browser project

Interview Preparation Tips

Round: Test
Duration: 15 minutes
Total Questions: 1

Round: Test
Duration: 30 minutes
Total Questions: 2

Round: Test
Duration: 30 minutes
Total Questions: 3

Round: Test
Total Questions: 4

Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.

Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)

1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.

Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2.  I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.

General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra

Skills evaluated in this interview

Interview Questionnaire 

10 Questions

  • Q1. They started with something I did not even think of, Images fundamentals. Making images blurry, making them shaggy
  • Q2. Operating on images in parallel
  • Ans. 

    Operating on images in parallel involves dividing the image into smaller parts and processing them simultaneously.

    • Divide the image into smaller parts using techniques like tiling or splitting

    • Use parallel processing techniques like multi-threading or GPU acceleration

    • Combine the processed parts to form the final image

    • Examples: image segmentation, object detection, image enhancement

  • Answered by AI
  • Q3. Hardware engines support for parallelism
  • Ans. 

    Hardware engines support parallelism through multiple cores and threads.

    • Hardware engines can have multiple cores and threads to execute tasks simultaneously.

    • Parallelism can improve performance and efficiency in hardware-based tasks.

    • Examples include GPUs, FPGAs, and ASICs that have parallel processing capabilities.

    • Hardware parallelism can also be achieved through distributed computing and clustering.

    • Programming language...

  • Answered by AI
  • Q4. OS support for parallelism
  • Ans. 

    Modern OSes support parallelism through multi-core processors and threading.

    • Modern OSes like Windows, macOS, and Linux support parallelism through multi-core processors and threading.

    • Parallelism can be achieved through processes or threads.

    • Parallelism can improve performance and efficiency of software.

    • Examples of parallel programming frameworks include OpenMP and MPI.

  • Answered by AI
  • Q5. Recursion, heap and stack management
  • Q6. Memory protection in OS?
  • Ans. 

    Memory protection is a feature of an operating system that prevents unauthorized access to memory locations.

    • Memory protection is achieved through the use of memory management units (MMUs) and virtual memory.

    • MMUs map virtual addresses to physical addresses and enforce access permissions.

    • Virtual memory allows the OS to allocate memory to processes in a way that isolates them from each other.

    • Examples of memory protection ...

  • Answered by AI
  • Q7. Interviewer asked my laptop’s configuration and then asked some hardware questions about it
  • Q8. You have a lot of small integers in an array. You have to multiply all of them. You need not worry about overflow and range, you have enough support for that. What can you do to speed up the multiplication...
  • Ans. 

    To speed up multiplication of small integers in an array, we can use bitwise operations and parallel processing.

    • Use bitwise operations like shifting and ANDing to perform multiplication faster.

    • Divide the array into smaller chunks and perform multiplication in parallel using multi-threading or SIMD instructions.

    • Use lookup tables for frequently used values to avoid repeated calculations.

    • Use compiler optimizations like lo...

  • Answered by AI
  • Q9. Design a data structure for excel spreadsheet?
  • Ans. 

    Design a data structure for excel spreadsheet

    • Use a 2D array to store cell values

    • Implement formulas using a stack

    • Include formatting options for cells

  • Answered by AI
  • Q10. Tower of hanoi?

Interview Preparation Tips

Round: Technical Interview
Experience: Some other fundamentals Adobe people were amazingly helpful about computer architecture because I had written it in CV.

Round: Technical Interview
Experience: They started with OS and other subjects of their requirements such as data structures.

Round: Technical Interview
Experience: It was the best one. coding questions and algorithmic thinking was checked. Project work was also discussed.

Skills: Data Structure, Algorithm, OS
College Name: MNIT Jaipur

Skills evaluated in this interview

Interview Questionnaire 

16 Questions

  • Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
  • Q2. Explain insertion sort,quicksort
  • Ans. 

    Insertion sort and quicksort are sorting algorithms used to sort arrays of data.

    • Insertion sort: iterates through the array and inserts each element into its proper position.

    • Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.

    • Insertion sort is best for small arrays, while quicksort is best for large arrays.

    • Bot...

  • Answered by AI
  • Q3. Concept of virtual destructors,runtime polymorphism
  • Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
  • Q5. Merge two sorted linked lists using recursion
  • Ans. 

    Merge two sorted linked lists using recursion

    • Create a recursive function that compares the first nodes of both lists

    • Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list

    • Base case: if one list is empty, return the other list

    • Return the merged list

  • Answered by AI
  • Q6. Given an integer(consider 4 bytes) find which byte is zero
  • Ans. 

    Given an integer, determine which byte is zero.

    • Convert the integer to a byte array using bitwise operations.

    • Iterate through the byte array and check for a zero value.

    • Return the index of the zero byte.

    • Consider endianness when converting to byte array.

  • Answered by AI
  • Q7. Program to check whether your machine is little endian or big endian
  • Ans. 

    To check endianness, create a 4-byte integer with a known value and check the byte order.

    • Create a 4-byte integer with a known value

    • Check the value of the first byte to determine endianness

    • If the first byte is the least significant, the machine is little endian

    • If the first byte is the most significant, the machine is big endian

  • Answered by AI
  • Q8. Print something before execution of main()(use static objects)
  • Ans. 

    Static objects can be used to print something before main() execution.

    • Static objects are initialized before main() execution

    • They can be used to print something before main()

    • Example: static int x = printf("Hello World!");

    • Output: Hello World! will be printed before main() execution

  • Answered by AI
  • Q9. Memory allocation for static varibles(when,which segment etc)
  • Ans. 

    Static variables are allocated memory in the data segment of the program's memory space.

    • Static variables have a fixed memory location throughout the program's execution.

    • They are initialized to zero by default.

    • If initialized explicitly, they are stored in the data segment.

    • Static variables can be accessed by any function in the program.

  • Answered by AI
  • Q10. Find space and time complexity for a recursive function(he wrote it)
  • Ans. 

    Finding space and time complexity of a recursive function.

    • Space complexity is the amount of memory used by the function.

    • Time complexity is the amount of time taken by the function to execute.

    • Recursive functions have higher space complexity due to the call stack.

    • Time complexity can be calculated using Big O notation.

    • Examples of recursive functions include factorial and Fibonacci sequence.

  • Answered by AI
  • Q11. Some questions on major project
  • Q12. Preprocessor directives,volatile keyword
  • Q13. Virtual pointer table,operator overloading,friend functions,semaphores
  • Q14. Diamond heirarchy problem
  • Ans. 

    Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.

    • Occurs when a class inherits from two classes that share a common base class

    • Can lead to ambiguity in method calls and data members

    • Solved using virtual inheritance or by using interfaces

  • Answered by AI
  • Q15. Fibonacci series.(:P)
  • Q16. Puzzle

Interview Preparation Tips

Round: Test
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.

College Name: NA

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

LinkedIn Interview FAQs

How many rounds are there in LinkedIn Senior Software Engineer interview?
LinkedIn interview process usually has 1 rounds. The most common rounds in the LinkedIn interview process are Technical.
What are the top questions asked in LinkedIn Senior Software Engineer interview?

Some of the top questions asked at the LinkedIn Senior Software Engineer interview -

  1. OS, CN, DB concepts like multithreading, semaphore, tcp vs udp, transaction and...read more
  2. Minimum Knight Moves (LC Medi...read more

Recently Viewed

JOBS

JPMorgan Chase & Co.

No Jobs

INTERVIEWS

Expedia Group

No Interviews

INTERVIEWS

Amazon

No Interviews

JOBS

Barclays Shared Services

No Jobs

JOBS

Barclays Shared Services

No Jobs

JOBS

Barclays Shared Services

No Jobs

JOBS

Pathfinder Global School

No Jobs

JOBS

Pathfinder Global School

No Jobs

REVIEWS

Global Indian International School

No Reviews

JOBS

Lericon Informatics

No Jobs

Tell us how to improve this page.

LinkedIn Senior Software Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
LinkedIn Senior Software Engineer Salary
based on 58 salaries
₹23 L/yr - ₹88 L/yr
252% more than the average Senior Software Engineer Salary in India
View more details

LinkedIn Senior Software Engineer Reviews and Ratings

based on 8 reviews

4.6/5

Rating in categories

4.5

Skill development

4.8

Work-life balance

4.7

Salary

3.8

Job security

4.4

Company culture

3.5

Promotions

4.2

Work satisfaction

Explore 8 Reviews and Ratings
Trust and Safety Specialist
73 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
65 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
58 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Content Reviewer
37 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Account Director
31 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare LinkedIn with

Facebook

4.3
Compare

Google

4.4
Compare

Microsoft Corporation

4.0
Compare

Amazon

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview