i
Creative Monk
Filter interviews by
Be the first one to contribute and help others!
Implement various operations on a linked list and solve related problems like reversing a linked list or detecting a cycle.
Understand the basic structure of a linked list with nodes containing data and a reference to the next node.
For insertion, update the pointers of the nodes accordingly to maintain the sequence.
For deletion, adjust the pointers to skip the node to be deleted.
To reverse a linked list, iterate through...
posted on 3 Nov 2023
I applied via Walk-in and was interviewed before Nov 2022. There were 4 interview rounds.
My expected salary is in line with industry standards and reflects my experience and skills.
I am looking for a salary that is competitive and fair based on my qualifications
I have researched the average salary for Telecalling Sales Executives in this region
I am open to negotiation based on the overall compensation package offered
Asked me about the work experience in bpo sector
posted on 13 Jun 2024
I applied via Company Website and was interviewed before Jun 2023. There was 1 interview round.
posted on 5 Nov 2022
Assignment for a particular tpoic
I appeared for an interview in Jul 2024.
I have over 10 years of experience in 3D animation for film and video games.
Worked on multiple feature films as a lead animator
Created character animations for popular video game titles
Collaborated with art directors and designers to bring concepts to life
I stay calm, assess the situation, seek support, and focus on finding solutions.
Stay calm and composed
Assess the situation and identify the root cause
Seek support from colleagues or mentors
Focus on finding practical solutions rather than dwelling on the problem
posted on 28 Jan 2025
I appeared for an interview before Jan 2024.
Yes, I am working in this role on a permanent basis.
Yes, I am committed to this role long-term
I have signed a permanent contract with the company
I am not a freelancer or contractor, but a full-time employee
posted on 7 Oct 2023
Easy basic dsa questions
Longest common subsequence is the longest sequence of characters that appear in the same order in two or more strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Traverse the array to find the longest common subsequence.
based on 1 review
Rating in categories
Graphic Designer
4
salaries
| ₹1.3 L/yr - ₹3.8 L/yr |
The Digital Serve
CallOne Consultants
7 Eagles
Viska