Filter interviews by
Jetpack Compose is a modern Android UI toolkit for building native UIs using a declarative approach.
Jetpack Compose allows developers to build UI components using a composable function approach.
It simplifies UI development by providing a reactive programming model.
Jetpack Compose is fully integrated with existing Android views and layouts.
It supports theming, animations, and state management out of the box.
Coroutines in Kotlin are used for asynchronous programming, while Clean Architecture is a software design pattern that separates concerns.
Coroutines in Kotlin allow for asynchronous programming without the need for callbacks or complex threading mechanisms.
Clean Architecture is a software design pattern that separates the application into layers, such as presentation, domain, and data, to improve maintainability and te...
I want to join Artium because of its reputation for excellent customer care and opportunities for growth.
Artium has a strong reputation for providing excellent customer care services
I am impressed by the company's commitment to employee growth and development
I believe my skills and experience align well with the values and goals of Artium
I applied via LinkedIn and was interviewed before Apr 2023. There were 2 interview rounds.
Artium Academy interview questions for popular designations
I applied via wellfound and was interviewed before Dec 2023. There were 2 interview rounds.
Two-sum problem and logical reasoning assessment.
My basic introduction includes my name, educational background, relevant work experience, and key skills.
Introduce myself with my name and background
Highlight my educational qualifications
Discuss my relevant work experience
Mention my key skills and expertise
Conclude with my career goals and aspirations
Yes, I have experience with Jetpack Compose and have completed 2 projects using it.
I have worked on developing UI components using Jetpack Compose.
I have integrated Jetpack Compose with other Jetpack libraries like ViewModel and LiveData.
One of the projects involved creating a custom theme and animations using Jetpack Compose.
Another project focused on building a complex UI layout with Jetpack Compose.
Adaptability
Ability to quickly learn and adapt to new technologies
Flexibility to pivot and adjust to changing project requirements
Openness to feedback and willingness to make improvements
Example: Successfully transitioning from Java to Kotlin for Android development
I applied via Referral and was interviewed in Feb 2021. There were 4 interview rounds.
Top trending discussions
I was interviewed before Jan 2021.
I applied via Approached by Company and was interviewed in Oct 2021. There were 3 interview rounds.
It is basically theory, questions that are based on fundamentals of music
Regarding this test, confidence and creativity is needed
I was interviewed in Dec 2020.
Round duration - 135 minutes
Round difficulty - Easy
There was no sectional time limit for the coding questions.The test was online with audio and video both on for continuous monitoring.
Find the N-th term of a Geometric Progression (GP) series given the first term A, the common ratio R, and the term position N.
The general form of a GP se...
Calculate the N-th term of a Geometric Progression series given the first term, common ratio, and term position.
Use the formula A * R^(N-1) to find the N-th term of the GP series.
Remember to return the result modulo 10^9 + 7 as the term can be very large.
Handle multiple test cases efficiently by iterating through each case.
For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Her...
Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.
Iterate through the 2D array and check if the sum of the cubes of digits equals the element itself.
Calculate (i * i + j * j) for elements that satisfy the condition.
Return the calculated values as a new 2D array.
If no element satisfies the condition, return -1.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer was very calm and listened very carefully to the solutions. There was a lot of discussion on my projects and the interviewer seems to be very interested in knowing about the workflows of my projects.They also give me some coding questions which were related to problem solving also.
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Calculate the number of distinct subsequences in a string with possible duplicates.
Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.
Consider the cases where the current character is included or excluded in the subsequence.
Handle duplicates by using a hashmap to store the last occurrence index of each character.
Modulo the final count by 10^9 + 7 to avoid overfl
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list given the position from the end to be removed.
Traverse the list to find the length 'N' of the linked list.
Calculate the position from the beginning to be removed as 'N - K + 1'.
Delete the node at the calculated position from the beginning.
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
The first line contains an integer 'T' representin...
The task is to find common strings in two arrays of lowercase alphabets for each test case.
Iterate through the elements of the second array and check if they are present in the first array.
Use a hash set to store the strings of the first array for efficient lookup.
Return the common strings in the order they appear in the second array.
Tip 1 : If you have time for your interviews, I would recommend going through Leetcode as it has a good variety of questions sorted on topic wise difficulty level where you can try to solve at least 20-30 questions for each data structure and algorithm. Moreover, you should regularly participate in the weekly contests happening there so that you could know about your weak areas to improve.
Tip 2 : Practice DSA everyday and make sure that you are giving timed mock tests periodically.
Tip 3 : Keep revising your Computer Science fundamentals(OS, DBMS, Software Engineering principles).
Tip 4 : Also brush-up your aptitude skills.
Tip 1 : The most important tip is that never lie on your resume and like If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume.
Tip 2 : Customize your resume for a company based on their Job Description (highlight necessary skills)
Tip 3 : Include only those points about which you're fully confident. Sometimes including too much increases expectations and then the bar is set high for you which impacts the assessment
Tip 4 : Don't put anything in resume that you are not sure of.
Tip 5 : if you don't have any internship experience then you can show your good technical projects and certifications too.
based on 7 interviews
Interview experience
based on 17 reviews
Rating in categories
4-6 Yrs
Not Disclosed
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Web Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Music Teacher
4
salaries
| ₹0 L/yr - ₹0 L/yr |
BYJU'S
Unacademy
upGrad
Vedant