i
Ciena
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2022. There were 3 interview rounds.
1 hour test of moderate to difficult level questions
Top trending discussions
posted on 7 Oct 2021
I applied via Campus Placement and was interviewed in Sep 2021. There were 5 interview rounds.
posted on 25 Jul 2022
I applied via Company Website and was interviewed in Jun 2022. There were 4 interview rounds.
90 Mins on amcat global platform, 2 Easy level questions on Array and two pointers
Print all elements not present in a sorted array with time and space complexity.
Iterate through array and print missing elements
Use binary search for faster search
Time complexity: O(n log n)
Space complexity: O(1)
Print all elements not present in an unsorted array and give time and space complexity.
Iterate through array and use a hashset to keep track of seen elements.
Print elements not in hashset.
Time complexity: O(n), Space complexity: O(n)
posted on 15 Feb 2023
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Test is proctored and 3 questions were asked out of which 1 is from language other is from data structures and the last one is from sql
A database is a collection of organized data that can be easily accessed, managed, and updated.
A database stores data in tables with rows and columns
It allows for efficient data retrieval and manipulation
Examples include MySQL, Oracle, and MongoDB
posted on 11 Nov 2022
I applied via Recruitment Consulltant and was interviewed in Oct 2022. There were 3 interview rounds.
Find the kth smallest value in an unsorted array
Sort the array and return the kth element
Use quickselect algorithm to find the kth smallest element in O(n) time
Build a min heap of size k and traverse the array to find the kth smallest element
Merge Sort is a divide and conquer algorithm that divides an array into two halves, sorts them and then merges them.
Divide the array into two halves recursively
Sort each half recursively using merge sort
Merge the two sorted halves
Time complexity is O(nlogn)
Space complexity is O(n)
A Load Balancer distributes incoming network traffic across multiple servers to improve performance and availability.
It helps to avoid overloading a single server
It improves responsiveness and availability of applications
It can be hardware or software-based
Examples include Amazon ELB, F5 BIG-IP, and NGINX
It can also perform health checks on servers and route traffic accordingly
Spring MVC is a framework for building web applications, while Spring Boot is an opinionated framework for building standalone applications.
Spring MVC requires more configuration and setup compared to Spring Boot
Spring Boot provides a pre-configured environment with sensible defaults
Spring Boot includes an embedded server, making it easier to deploy standalone applications
Spring MVC is more suitable for building tradit...
SQL is a relational database management system while NoSQL is a non-relational database management system.
SQL databases are structured and use tables with predefined schema while NoSQL databases are unstructured and use collections or documents.
SQL databases use SQL (Structured Query Language) for querying and managing data while NoSQL databases use various query languages like MongoDB's query language.
SQL databases ar...
Find the equilibrium index where the sum of all values before it is equal to the sum of all values after it.
Iterate through the array and calculate the total sum.
Then iterate again and keep track of the left sum and right sum.
If they are equal at any index, return that index as the equilibrium index.
posted on 16 Aug 2022
I applied via Campus Placement and was interviewed in Jul 2022. There were 3 interview rounds.
Very Very easy coding questions with a lot of time. Basic DSA knowledge could have cracked it easily. The only problem that too not for me but for some my friends was their own test portal which was quite buggy.
Find missing elements in a sorted array within a given range.
Loop through the array and check if each element is within the given range.
If an element is outside the range, add all the missing elements within the range to a list.
Return the list of missing elements.
C code for printing Fibonacci Series upto n elements
Declare three variables to store the current, previous and next numbers in the series
Initialize the previous and current variables to 0 and 1 respectively
Use a loop to print the next number in the series by adding the previous two numbers
Loop should run n times to print n elements in the series
I appeared for an interview in Mar 2017.
I have the technical skills, experience, and passion to deliver high-quality software solutions.
I have a strong background in programming languages such as Java, Python, and C++.
I have experience working on complex software projects and collaborating with cross-functional teams.
I am passionate about staying up-to-date with the latest technologies and trends in software development.
I am a quick learner and have a strong...
Ericsson is a global leader in telecommunications technology with a strong focus on innovation and career development.
Global leader in telecommunications technology
Strong focus on innovation
Opportunities for career development
I appeared for an interview in Feb 2017.
posted on 3 May 2017
I appeared for an interview before May 2016.
Software Engineer
186
salaries
| ₹8 L/yr - ₹34 L/yr |
Software Engineer2
167
salaries
| ₹14 L/yr - ₹36 L/yr |
Senior Software Engineer
130
salaries
| ₹12 L/yr - ₹32.5 L/yr |
Module Lead
76
salaries
| ₹13 L/yr - ₹38.5 L/yr |
Software Developer
66
salaries
| ₹9 L/yr - ₹28 L/yr |
Jio
Vodafone Idea
Ericsson
Nokia