i
OpenText Technologies
Filter interviews by
I applied via Campus Placement and was interviewed in Jan 2024. There were 2 interview rounds.
2 questions asked , should have to solve 2 questions
I have experience coding on various platforms including GitHub, CodePen, and Visual Studio Code.
GitHub - a web-based platform for version control and collaboration
CodePen - an online code editor and community for front-end development
Visual Studio Code - a powerful code editor with built-in debugging and Git integration
posted on 21 Mar 2021
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
A unique not null column can be used as a primary key, but not vice versa.
Primary key must be unique and not null, but not all unique not null columns need to be primary keys.
Primary key is used to identify each row uniquely, while unique not null column is used to ensure data integrity.
A table can have multiple unique not null columns, but only one primary key.
Null cannot be equated as it represents absence of a value.
Null is not equal to any value, including itself.
Attempting to equate null can result in unexpected behavior.
Null is often used to represent the absence of a value or unknown value.
I applied via Approached by Company and was interviewed in Sep 2023. There were 2 interview rounds.
Traverse through a matrix of uppercase english alphabets to find a given word. you are allowed to make up to k jumps, and same position can be repeated too.
Compression of 0-1 matrix involves reducing the size of the matrix by storing only the necessary information.
Use run-length encoding to compress the matrix by storing consecutive repeated values as a single value and count.
Identify patterns in the matrix that can be represented more efficiently.
Consider using sparse matrix representation if the matrix has a lot of zeros.
Implement efficient algorithms to compress and de...
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
This was the assignment regarding digital marketing
I applied via Naukri.com and was interviewed in Jul 2022. There was 1 interview round.
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
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.
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.
based on 1 interview
Interview experience
Software Engineer
994
salaries
| ₹6.3 L/yr - ₹26 L/yr |
Senior Software Engineer
912
salaries
| ₹12 L/yr - ₹36 L/yr |
Lead Software Engineer
375
salaries
| ₹16 L/yr - ₹50 L/yr |
Associate Software Engineer
367
salaries
| ₹6.8 L/yr - ₹12 L/yr |
Software Developer
233
salaries
| ₹5.7 L/yr - ₹22.9 L/yr |
Amdocs
Automatic Data Processing (ADP)
24/7 Customer