AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Sumo Logic Interview Questions and Answers
Sumo Logic Interview Experiences
8 interviews found
Anonymous
I applied via Company Website and was interviewed in May 2024. There were 4 interview rounds.
(3 Questions)
- Q1. Introduction followed by roles and responsibilities.
- Q2. How to test amazon cart?
- Ans.
To test Amazon cart, perform functional, usability, security, and performance testing.
Test adding items to cart and verifying correct quantity and price
Test removing items from cart and updating total price
Test applying discounts or promo codes
Test checking out and completing the purchase process
Test for security vulnerabilities such as session hijacking
Test for performance by simulating high traffic scenarios
- Q3. How to write e2e tests in automation?
- Ans.
E2E tests in automation are written to simulate real user scenarios from start to finish.
Identify end-to-end scenarios to test
Use automation tools like Selenium or Cypress
Write test scripts to simulate user actions
Verify expected outcomes and results
Run tests regularly to ensure functionality
(2 Questions)
- Q1. Introduction followed by role and responsibilities in the current company.
- Q2. Given a system architecture, write test cases for the system or how will test the system as tester.
1. Count occurrence of a character in a first n characters of X string ( X = Y string, which is repeating infinite times).
input -> str1 = "test" & search = "t" & n = 10
new str -> testtesttesttesttest (repeating in infinite loop)
search str -> testtestte [count occurrence of "t" in first n characters of new str ]
o/p -> 5
2. Return the first sub array whose elements summation is multiple of K. subarray must contains 2 elements.
input -> array = [1,4,5,6,2,5] & k = 4 : output -> [6,2] = 8%4 == 0
3. Cross questions on the coding questions.
4. Write test cases to test both coding methods.
(8 Questions)
- Q1. Introduction, followed by roles and responsibilities.
- Q2. Tell your one weakness and one strength
- Q3. Some cross questions on role and responsibilities.
- Q4. What kind of person you will not work with?
- Q5. Test planning for google doc
- Ans.
Test planning for Google Doc involves defining test objectives, creating test cases, prioritizing testing areas, and scheduling testing activities.
Define test objectives based on the features and functionalities of Google Doc
Create test cases to cover all possible scenarios and edge cases
Prioritize testing areas based on criticality and impact on users
Schedule testing activities to ensure thorough coverage before relea
- Q6. In range of [1-40] kgs, select minimum number of weight to cover the complete range of weights.
- Ans.
To cover the range of weights from 1-40 kgs, select weights in powers of 2.
Select weights in powers of 2: 1, 2, 4, 8, 16, 32
These weights can cover the complete range from 1-40 kgs
Example: 1 kg + 2 kg + 4 kg + 8 kg + 16 kg + 32 kg = 63 kgs
- Q7. What makes me happy?
- Q8. More random questions, don't remember
Interview Preparation Tips
- String coding
- Array Coding
- Test Cases
- Test Scenarios
2. brush up your testing basics.
3. focus more on string and array coding questions.
4. EM is stupid & incompetent guy, he don't know shit about testing. From online, he read about one question and funny things was he was not able to explain it correctly. He is lacking common sense.
Final Result:
1. Not selected in the final round because EM wants to hire someone who is 10/10 which unrealistic expectation.
Even if I got selected and I have to work under him, I simply rejected the offer and join other company. Can't work with stupid and arrogant person.
Skills evaluated in this interview
QA Engineer Interview Questions asked at other Companies
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
(2 Questions)
- Q1. More questions about networking
- Q2. Cloud advanced topics
Interview Preparation Tips
Senior Technical Support Engineer Interview Questions asked at other Companies
Selected
I applied via LinkedIn and was interviewed in Dec 2024. There was 1 interview round.
(2 Questions)
- Q1. About your self?
- Q2. How you do the sourcing and keep candidates engaged,
- Ans.
I utilize a variety of sourcing methods and maintain candidate engagement through regular communication and personalized interactions.
Utilize job boards, social media platforms, and professional networking sites to source candidates
Maintain a talent pipeline by regularly reaching out to passive candidates
Personalize communication with candidates to keep them engaged and informed about the hiring process
Provide timely f...
Senior Recruiter Interview Questions asked at other Companies
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There was 1 interview round.
(1 Question)
- Q1. Hard dsa question ["ab","aaa","bbaaab","b","a"]
Interview Preparation Tips
Senior Software Engineer Interview Questions asked at other Companies
Sumo Logic interview questions for popular designations
(1 Question)
- Q1. Ad metric system design
- Ans.
Designing an ad metric system to track and analyze advertising performance.
Define key metrics to track such as impressions, clicks, conversions, and ROI
Implement tracking mechanisms using cookies, pixels, or SDKs
Create a dashboard for real-time monitoring and reporting
Utilize data visualization tools to analyze trends and optimize campaigns
Skills evaluated in this interview
Lead Engineer Interview Questions asked at other Companies
I applied via Job Portal
2 Hard problems. 1 MCQ. Was able to solve all but 1 problem all test cases werent passing. Got rejected
Software Engineer Interview Questions asked at other Companies
Jobs at Sumo Logic
I appeared for an interview in Nov 2023.
(1 Question)
- Q1. Stack Leetcode hard problem
- Ans.
Implement a stack data structure that supports push, pop, top, and retrieving the minimum element in constant time.
Use two stacks - one to store the actual elements and another to store the minimum values at each point.
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 element being popped is t...
Skills evaluated in this interview
Software Development Engineer II Interview Questions asked at other Companies
I applied via LinkedIn and was interviewed in Jun 2022. There were 2 interview rounds.
(1 Question)
- Q1. Round never happened, interviewer didn't join the call. Shared detailed explanation below.
Interview Preparation Tips
I was shortlisted for the interview by their Noida branch for the role of QA automation.
Received confirmation mail as well for scheduled interview.
I was told that I will receive a call and meeting invite link 5-10 mins before the interview.
I waited for nearly 1hr even replied back on mail but no revert , called hr as well but he didn't pick up.
Then on Mon HR mailed me that he will schedule interview for Tue, again no revert after that.
I don't know how they operate.
Qa Automation Testing Engineer Interview Questions asked at other Companies
Interview questions from similar companies
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...
- 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
- 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.
- 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
- 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
- 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.
- 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.
- 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
- Q15. Fibonacci series.(:P)
- Q16. Puzzle
Interview Preparation Tips
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
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
- 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
- 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()
- 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.
- 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
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
Sumo Logic Interview FAQs
Tell us how to improve this page.
Sumo Logic Interviews By Designations
- Sumo Logic Lead Engineer Interview Questions
- Sumo Logic Software Engineer Interview Questions
- Sumo Logic Senior Recruiter Interview Questions
- Sumo Logic Senior Software Engineer Interview Questions
- Sumo Logic Software Development Engineer II Interview Questions
- Sumo Logic QA Engineer Interview Questions
- Sumo Logic Qa Automation Testing Engineer Interview Questions
- Sumo Logic Senior Technical Support Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
Sumo Logic Interview Process
based on 7 interviews
Interview experience
Interview Questions from Similar Companies
Sumo Logic Reviews and Ratings
based on 13 reviews
Rating in categories
|
Senior Software Engineer
11
salaries
|  ₹24 L/yr - ₹70 L/yr |
|
Software Engineer2
9
salaries
| ₹18 L/yr - ₹31 L/yr |
|
Software Engineer
5
salaries
| ₹22 L/yr - ₹38 L/yr |
|
Software Developer
4
salaries
| ₹29 L/yr - ₹40 L/yr |
|
Software Development Engineer
4
salaries
| ₹12 L/yr - ₹32 L/yr |
Oracle
Visteon
Adobe
Zycus Infotech
- Home >
- Interviews >
- Sumo Logic Interview Questions
