Upload Button Icon Add office photos

Filter interviews by

LogMeIn Interview Questions and Answers

Updated 20 Oct 2021

LogMeIn Interview Experiences

Popular Designations

2 interviews found

I applied via Company Website and was interviewed before Oct 2020. There were 3 interview rounds.

Interview Questionnaire 

7 Questions

  • Q1. Java collections framework
  • Q2. String manipulation
  • Q3. File handling
  • Q4. Getting response from API
  • Q5. Infrastructure related questions like ci/cd pipeline, docker etc
  • Q6. Cloud questions
  • Q7. Manual question related to release of product, tineliness, qa process etc

Interview Preparation Tips

Interview preparation tips for other job seekers - There were 3technical+1techno-managerial+1hr rounds. Each technical rounds had 2 coding questions which you need to execute. Requires good coding skills. Try to solve and write the correct logic. If you are unable to execute program, just tell them the exact logic and your approach. SDET in this company means you need to be fully skilled with coding, manual, build process and release process. All the best.

Senior Software Engineer Testing Interview Questions asked at other Companies

Q1. Sorting Characters by Frequency Given a string S, sort this string in increasing order based on the frequency of its characters. If two characters have the same frequency, the character with a lesser ASCII value should appear first. Return ... read more
View answer (1)

I was interviewed in Dec 2020.

Interview Questionnaire 

1 Question

  • Q1. Question based on binary search, two pointer, trees.

Interview Preparation Tips

Interview preparation tips for other job seekers - Total three rounds of coding interview,1 managerial + design, 1Hr round.

Software Engineer Interview Questions asked at other Companies

Q1. Bridge and torch problem : Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person... read more
View answer (197)

Interview questions from similar companies

Software Engineer Interview Questions & Answers

Citrix user image Pranav Bhat Thirthahalli

posted on 3 Dec 2015

Interview Preparation Tips

Round: Test
Experience: Round 1: Online coding and aptitude test Section
Total time : 60 minutes
Questions{Marks} = 50(+1,-0.5)
Comments : * A few questions on Permutations and Combination and general aptitude * A few questions on Computer Networks and Operating Systems * Many C++ output questions, mainly on OOP * Questions are quite stimulating and these need proper time management, the idea of the concepts need to be at the tip of the tongue ("literaly")
Section 2:
Total Marks : 150
Total questions : 2 ( 100 + 50 )
Programming Languages allowed : All common PLs
Platform : HackerEarth Questions are easy but may require long codes. The output should be properly formatted.Not much algorithms Some 30 people get shortlisted for the interviews, consisting of maximum 4 rounds ( 3 tech + 1 HR).All interviews are elimination rounds

Round: Technical Interview
Experience: ( Tech interview-1):
* Mainly questions on the knowledge of C
* Trust me, one must be really an expert in C syntax, and you must know in and out of C
* Questions on pointers and bit wise arithmetic asked
* Some questions on Operating systems also asked( and these were really thought worthy, like how are interrupt handlers stored )
* Some resume based questions
(Tech interview-2) : Some 15 were shortlisted
*Mainly questions on algorithms
*Really tough questions , on trees and arrays, almost in the Microsoft level
*Should be optimized as possible.
*They describe one of their product, and then ask questions on how to solve some problems.
(Tech interview-3) Some 6 were shortlisted
Selection Procedure
* Interview by the Citrix India R&D Vice-President of Tech division
* Involves mainly resume based questions
* Most questions on Networks and TCP/IP
* Puzzles are also asked.
* You may get chocolates also in this round

Round: HR Interview
Experience: If you get here, it means you are 90% selected(unless you screw it really bad, by saying things like you don't know the company,etc ) *Standard question - Why Citrix ? *They mainly discuss what profile will be offered, and about the compensation and so on.

General Tips: I don't think I have any. In fact I had no aspirations initially to get into this company.In fact I too came to know about the company on the day I got selected into it :p
The only thing I can say is practice. Strengthen your networking and OS concepts Even though you don't need to be in the leader board of CodeChef for this company, you may want to know decent coding, atleast to make it to the interviews.
It was challenging and equally rewarding. I felt that this was a really friendly interview series, and they are quite accommodating and flexible in their questions. Infact even if you miss a question or two, don't worry.
Skill Tips: Forouzan - Data Communication and Networking ,C++ by Djarne Stroustrup HackerEarth and HackerRank Coding Focus more on Networking and OS if you want to get into this company, they don't focus on much of algorithms, since they don't want coders since it is a R&D profile.
Skills:
College Name: NIT Surathkal

Interview Preparation Tips

Round: Interview
Experience: They asked to write 2 codes on recursion. Then some questions on resume. I asked them about the job profile and after knowing that they were hiring candidates for frontend programming, about which they didn’t mention in JAF. I told them that I was not interested in frontend development. And didn’t even answer any question after that. Unfortunately, I was selected.

General Tips: Plan your schedule judiciously keeping your capacity in mind. There is no point of making ideal plans and then not able to do even 50% of it.
Don’t get into unnecessary arguments or debate with people.
Don’t think about what others are doing. Focus on your preparation.
How you carry yourself matters. So, make sure you portray yourself in the way you want the other person to perceive you.
Be selective while applying for companies.
College Name: IIT Kanpur

Interview Questionnaire 

12 Questions

  • Q1. 3 - 4 data structures based coding questions
  • Q2. Questions on project like problems faced or errors encountered
  • Q3. Memory layout of C programs
  • Ans. 

    The memory layout of C programs refers to how variables and data structures are organized in memory.

    • C programs typically have four main sections in memory: code, data, heap, and stack.

    • The code section contains the compiled program instructions.

    • The data section stores global and static variables.

    • The heap is used for dynamic memory allocation.

    • The stack is used for function calls and local variables.

    • Pointers in C hold mem...

  • Answered by AI
  • Q4. Storage of semaphores and many other questions based on semaphores
  • Q5. Questions based on operating system
  • Q6. The usual first question ..tell me about yourself
  • Q7. What irritates you ?
  • Ans. 

    Inefficiency and lack of organization irritate me.

    • Inefficient code or processes

    • Lack of documentation

    • Disorganized project management

    • Inconsistent coding standards

    • Poor communication within the team

  • Answered by AI
  • Q8. My CPI was 8.69, even then was asked why is it so low , why not 9 or above
  • Q9. Dream company and if you get selected, will you still aspire and study for your dream company
  • Q10. How many computer languages do you know ?
  • Ans. 

    I know multiple computer languages including Java, Python, and C++.

    • Java

    • Python

    • C++

  • Answered by AI
  • Q11. Some situation based questions
  • Q12. Why didn't you get selected in the last company that visited your college ?

Interview Preparation Tips

Round: Test
Experience: The type of questions mainly comprised of aptitude, dbms, data structures, operating system, object oriented programming, networking and few basic questions on C programming language.
Tips: For Object Oriented programming  the book entitled as THINKING IN C++ volume 1 by BRUCE EKEL proved to be very useful.For C, read Dennis Ritchie thoroughly atleast twice.
Duration: 60 minutes
Total Questions: 45 or 50

Round: Problem Statement
Experience: The questions didn't make use of any tough algorithms. The solution too was quite simple but on the contrary there were several test cases which we generally overlook.
Tips: Sometimes practicing tough questions, we stumble across easy ones, so always start learning things from the ground level. Stay calm.

Round: Other Interview
Experience: It was managerial interview and i expressed myself in the best way i could . The interviewer tried to trap me in my own answer but somehow i managed to satisfy him by my answers.
Tips: Stay confident and be yourself.

Round: Technical Interview
Experience: Initially, i gave naive approach to the solution but the interviewer gave me sometime to improvise the solution and i ended up with solution with log n complexity.
Tips: Practice coding questions based on Data Structures as much as possible but look at the solutions only after the exhaustive attempts of self trials.

Round: Technical Interview
Experience: This round was bit tough . To answer the questions on semaphore, you need to have very basic knowledge of the topic.
Tips: System programming book by Richard Stevens provides deep insight of the concepts.Have strong grip on subject knowledge too.

General Tips: 1) Once you kick off a start to practicing coding questions and understanding the concepts, you actually enjoy things.2) Group Study plays a very crucial role. Discuss questions with your friends and your seniors.3) If initially you get bulk of errors in programming questions , don't get disheartened .Try to run the program by compiling each and every line thoroughly and eventually you will end up with successful compilation and that happiness is priceless.
Skill Tips: Have a command on your domain.
Skills: programming Skills, communication skills, Skills to handle the situation.
College Name: NIT ALLAHABAD
Motivation: A software company with software engineer profile  and a good package too and both of them defines my field of interest :P
Funny Moments: when the result was declared with me and my friend both got selected, we both started jumping and crying aloud infront of everyone out there.And at the end when we were given chocolates , there was another box containing t-shirts ..and i was constantly looking there in the hope that soon, we would be given t-shirts too but to the dismay the handed all of them over to the third party :(

Skills evaluated in this interview

Interview Questionnaire 

7 Questions

  • Q1. Design a Peer-to Peer sharing network like torrent. What all parameters would you like to consider?
  • Ans. 

    Design a P2P sharing network like torrent

    • Consider the architecture and protocols for file sharing

    • Include mechanisms for file discovery and download

    • Implement a distributed system for efficient data transfer

    • Ensure data integrity and security

    • Handle scalability and load balancing

    • Consider user interface and ease of use

  • Answered by AI
  • Q2. You want to retrieve data about cricket players. Search string will be name. Also, we want first players having first 10/10000 hits. What data structures will you use to store data?
  • Q3. Tell about the projects you have done?
  • Q4. According to you, what is the definition of good job?
  • Ans. 

    A good job is one that provides satisfaction, growth opportunities, work-life balance, and fair compensation.

    • Satisfaction: Feeling fulfilled and accomplished in the work being done.

    • Growth opportunities: Having chances to learn, develop new skills, and advance in the career.

    • Work-life balance: Striking a healthy equilibrium between work responsibilities and personal life.

    • Fair compensation: Being adequately rewarded for t...

  • Answered by AI
  • Q5. What are your future plans?
  • Q6. Where do you see yourselves after few years?
  • Q7. Are you planning for any higher studies?

Interview Preparation Tips

Round: Test
Experience: It was an online test with Objective questions for 1 hour and Coding – one and half hour.The questions asked were mainly based on CS networking course.Other than networking, there were lot of DSA questions, few OS questions and puzzles were asked.
Tips: Coding requires good speed.
For coding, I chose C++, there were other languages too.

Round: Technical Interview
Experience: It was of about 20 minutes.There were 2 technical interviews.

Round: HR Interview
Experience: minor was not at all related.
Tips: Oracle, easy dsa questions are asked. It’s easy to get into this. This is like a back-up one.

Skill Tips: Practice Coding through codechef etc.
College Name: IIT MADRAS

Skills evaluated in this interview

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 

Aptitude test

Round 2 - Group Discussion 

Current affairs

Round 3 - Technical 

(1 Question)

  • Q1. Puzzle , sql related questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be yourself, whatever you know just be confident

I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Sliding window problem in an Array(using 2 pointers) like Pythagorean triplets.
  • Q2. Overlapping circular linked list problem.
  • Ans. 

    Detect if two circular linked lists overlap

    • Traverse both lists and check if they have the same tail node

    • If they have different tail nodes, they do not overlap

    • If they have the same tail node, check if they intersect at any point

    • Use Floyd's cycle-finding algorithm to detect intersection point

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - I had 6 rounds of technical interview . Each round of 1 hr or more. In all the rounds I was asked to write proper programs (Sometimes on HackerRank, sometimes on an IDE, sometimes just on a text editor.) . Questions were designed to test problem solving abilities and proper use to dataStructures and coding basics. Lot of emphasis on writing efficient program with least time complexity possible.

During preparations, its important to understand basics of different dataStructures and how to efficiently use it in your programs . For practicing interview problems, I referred leetcode and geeksforgeeks . Solving different kind of problems from these websites really helped me. Dynamic Programming is also an important area from where lot of problems are asked in interview.

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Hard

Coding Test with 3 problems. 1 Easy , 1 Medium , 1 Very Hard

  • Q1. 

    Job Scheduling Problem

    You are provided with a list of jobs, where each job has a specific deadline and profit. The goal is to schedule these jobs such that the total profit is maximized. Each job require...

  • Ans. 

    The goal is to schedule jobs to maximize profit while meeting deadlines. Each job takes one unit of time and only one job can be scheduled at a time.

    • Sort the jobs in decreasing order of profit

    • Iterate through the sorted jobs and schedule them based on their deadlines

    • Keep track of the total profit achieved

    • Ensure each job is completed before its deadline

  • Answered by AI
  • Q2. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    Implement a function to return the spiral order traversal of a binary tree.

    • Traverse the binary tree level by level, alternating between left to right and right to left.

    • Use a queue to keep track of nodes at each level.

    • Append nodes to the result list in the order they are visited.

  • Answered by AI
  • Q3. 

    Structurally Unique Binary Trees of Dragon Balls

    Goku has ‘N’ Dragon Balls, where each Dragon Ball is unique. The ith Dragon Ball has ‘i’ stars on it, meaning the first Dragon Ball has 1 star, the second ...

  • Ans. 

    Count the number of structurally unique binary trees that can be constructed with given Dragon Balls.

    • Use dynamic programming to solve this problem efficiently.

    • The number of structurally unique binary trees can be calculated using Catalan numbers.

    • For each test case, calculate the number of structurally unique binary trees modulo 10^9 + 7.

    • Return the count of unique binary trees for each test case.

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 minutes
Round difficulty - Hard

In depth questions on Subjects like OOP , DBMS , OS , Javascript.

Round 3 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Hard

Questions on my resume, projects, internship done. Interviewer was a bit harsh on me.

  • Q1. What are the differences between low-level and high-level programming languages, and can you explain some kernel-related questions?
  • Ans. 

    Low-level languages interact directly with hardware, while high-level languages are more abstract and easier to read/write.

    • Low-level languages are closer to machine code and hardware, while high-level languages are closer to human language.

    • Low-level languages require more manual memory management and are less portable, while high-level languages have automatic memory management and are more portable.

    • Examples of low-lev...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteria8 CGPAAltassian interview preparation:Topics to prepare for the interview - Operating System, DBMS, Data Structures and Algorithms , OOP , Computer NetworksTime required to prepare for the interview - 10 monthsInterview preparation tips for other job seekers

Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

Skills evaluated in this interview

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

LogMeIn Interview FAQs

What are the top questions asked in LogMeIn interview?

Some of the top questions asked at the LogMeIn interview -

  1. Manual question related to release of product, tineliness, qa process ...read more
  2. Infrastructure related questions like ci/cd pipeline, docker ...read more
  3. Question based on binary search, two pointer, tree...read more

Recently Viewed

SALARIES

Datamini Technologies

No Salaries

LIST OF COMPANIES

Datamini Technologies

Overview

SALARIES

Crisil

COMPANY BENEFITS

Datamini Technologies

No Benefits

COMPANY BENEFITS

Steelwedge Software

No Benefits

SALARIES

Steelwedge Software

No Salaries

REVIEWS

Crisil

No Reviews

REVIEWS

Steelwedge Software

No Reviews

REVIEWS

Galaxy Surfactants

No Reviews

SALARIES

Galaxy Surfactants

No Salaries

Tell us how to improve this page.

LogMeIn Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Salesforce Interview Questions
4.0
 • 223 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Atlassian Interview Questions
3.6
 • 88 Interviews
Citrix Interview Questions
3.6
 • 52 Interviews
Twilio Interview Questions
3.9
 • 23 Interviews
TeamViewer Interview Questions
3.6
 • 4 Interviews
DocuSign Interview Questions
2.9
 • 3 Interviews
Zendesk Interview Questions
4.3
 • 2 Interviews
View all

LogMeIn Reviews and Ratings

based on 28 reviews

4.3/5

Rating in categories

3.9

Skill development

4.2

Work-life balance

4.3

Salary

3.4

Job security

4.5

Company culture

3.6

Promotions

4.0

Work satisfaction

Explore 28 Reviews and Ratings
Senior Software Engineer
41 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
21 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Devops Engineer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Staff Software Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Account Director
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare LogMeIn with

TeamViewer

3.6
Compare

Zoom Video Communications

3.9
Compare

Citrix

3.6
Compare

Salesforce

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent