Cyware Interview Questions and Answers

Aptitude + Coding round
duration was 1 hr 30 mins
Topics were basic aptitude for interviews
Coding topics was - Stack and Greedy

Q1. Why python and explain about list.
Ans. 
Python is a popular programming language known for its simplicity and readability. Lists in Python are versatile data structures that can hold multiple items of different types.
• Python is widely used in software development due to its ease of use and readability.

• Lists in Python are ordered collections of items, which can be of different data types.

• Lists can be modified, appended, sorted, and sliced in Python.

• Example: li...read more
Answered by AI
Add your answer
Q2. Print Spiral matrix (twisted leetcode question)
Ans. 
Prints elements of a matrix in a spiral order, starting from the top-left corner and moving clockwise.
• Initialize boundaries: top, bottom, left, right.

• Iterate while top <= bottom and left <= right.

• Traverse from left to right along the top row, then increment top.

• Traverse from top to bottom along the right column, then decrement right.

• Traverse from right to left along the bottom row, then decrement bottom.

• Traverse ...read more
Answered by AI
Add your answer
Q3. Print the summation of all the digit until the length of the digit is 1
Ans. 
Sum all digits until single digit is reached
• Iterate through each digit and add them together

• Repeat the process until the sum is a single digit

• Example: For input 1234, sum = 1+2+3+4 = 10, then sum = 1+0 = 1
Answered by AI
Add your answer

2 coding question one easy one medium

Q1. MAx sum of non adjacent elements
Ans. 
Find the maximum sum of non-adjacent elements in an array.
• Create an array to store the maximum sum at each index

• Iterate through the input array and calculate the maximum sum considering the current element and the previous non-adjacent element

• Return the maximum sum found
Answered by AI
Add your answer
Q2. Optimize it further
Ans. 
Utilize efficient algorithms, minimize redundant code, optimize database queries
• Use data structures like hash maps or binary trees for faster lookups

• Minimize nested loops and unnecessary iterations

• Optimize database queries by using indexes and avoiding unnecessary joins
Answered by AI
Add your answer

3 coding questions and some McQ questions

Q1. Asked DSa question of TWO sum
Add your answer
Q2. Dsa question of three sum
Ans. 
The Three Sum problem involves finding unique triplets in an array that sum to zero.
• Input: An array of integers, e.g., [-1, 0, 1, 2, -1, -4].

• Output: Unique triplets that sum to zero, e.g., [[-1, -1, 2], [-1, 0, 1]].

• Sort the array to simplify finding triplets and avoid duplicates.

• Use a two-pointer technique to find pairs that complement the current element.

• Time complexity is O(n^2) due to nested loops.
Answered by AI
Add your answer

Q1. Dsa question of merge sort
Ans. 
Merge Sort is a divide-and-conquer algorithm that sorts an array by recursively splitting and merging sorted subarrays.
• 1. Divide the array into two halves until each subarray contains a single element.

• 2. Merge the subarrays back together in sorted order.

• 3. Time complexity is O(n log n) in all cases (best, average, worst).

• 4. Example: Sorting [38, 27, 43, 3, 9, 82, 10] results in [3, 9, 10, 27, 38, 43, 82].
Answered by AI
Add your answer
Q2. DBMS interview questions
Add your answer
Q3. Operating system questions
Add your answer

Q1. Reverse a string
Ans. 
Reverse a string by using built-in functions or manually iterating through the characters.
• Use built-in functions like reverse() in Python or StringBuilder.reverse() in Java.

• Manually iterate through the characters of the string and append them in reverse order to a new string.

• Consider edge cases like empty string or null input.
Answered by AI
Add your answer