AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
ACKO
Compare
Filter interviews by
ACKO Software Developer Intern Interview Questions and Answers
12 Interview questions
Given a binary tree, return the inorder traversal of its nodes' values.
Inorder traversal: left subtree, root, right subtree
Use recursion to traverse the tree
Implement a stack-based iterative solution for better space complexity
Designing an application like Instagram involves creating a platform for sharing photos and videos with social networking features.
Implement user profiles with the ability to upload, like, comment, and share photos/videos
Develop a news feed algorithm to display content based on user preferences and interactions
Include features like filters, hashtags, geotagging, and direct messaging
Integrate push notifications for...
Rat in a Maze Problem Statement
Given a maze of size N * N with a rat placed at the top-left corner, find and print all possible paths that the rat can take to reach the bottom-right corner. The rat can mo...
Find and print all possible paths for a rat to reach the bottom-right corner of a maze.
Create a recursive function to explore all possible paths in the maze.
Keep track of the current path and mark visited cells.
Return the paths as matrices with 1 for cells in the path and 0 for others.
Move Zeros to Left Problem Statement
Your task is to rearrange a given array ARR such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of ...
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and move all zero elements to the left side of the array while maintaining the relative order of non-zero elements.
Use two pointers approach to swap elements efficiently.
Ensure to solve the problem in linear time and constant space complexi...
Matrix Chain Multiplication Problem Statement
You are provided with a chain of matrices A1, A2, A3, ..., An. The goal is to determine the minimum number of scalar multiplications needed to multiply these m...
The goal is to determine the minimum number of scalar multiplications needed to multiply a chain of matrices together.
Understand the matrix chain multiplication problem statement and how the dimensions of matrices are defined by the input array.
Implement a dynamic programming approach to find the minimum cost of matrix multiplication.
Consider the constraints provided and optimize the solution accordingly.
Test the ...
Move Zeros To Left
You are provided an array ARR of integers. Your task is to rearrange this array such that all elements with zero values are moved to the left, and all non-zero elements follow them, pres...
Rearrange array with zeros on the left and non-zeros on the right while maintaining original order.
Iterate through the array from right to left, moving non-zero elements to the end of the array.
Track the index where non-zero elements should be placed.
Fill the beginning of the array with zeros and the rest with non-zero elements in their original order.
Polynomial Simplification Problem Statement
You are provided with two arrays representing the coefficients and degrees of a polynomial expression. Your task is to simplify this polynomial into its general ...
Simplify a polynomial expression by combining like terms and arranging them in descending order of degrees.
Iterate through the coefficients and degrees arrays to combine like terms
Create a new array to store the simplified polynomial in descending order of degrees
Return the simplified polynomial array
Maximum Sum of Disjoint Pairs with Specific Difference
Given an array of integers and a number K, your task is to form pairs of elements from the array such that the absolute difference between them is str...
Find maximum sum of disjoint pairs with specific difference in an array.
Sort the array in non-decreasing order.
Iterate through the array and form pairs with absolute difference less than K.
Keep track of the sum of disjoint pairs to maximize it.
Return the maximum sum obtained.
Increasing Subsegment Problem Statement
Given a sequence ARR consisting of N integers, your task is to identify the longest subsegment of ARR, where you can change at most one number to make the subsegment...
Find the longest subsegment where at most one number can be changed to make it strictly increasing.
Iterate through the array and keep track of the longest increasing subsegment with at most one change.
If a number violates the increasing order, try changing it and check if the subsegment becomes strictly increasing.
Update the length of the longest subsegment found so far.
Return the length of the longest subsegment ...
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line c...Find all pairs of elements in an array that add up to a given target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle cases where the same element is used twice in a pair (e.g., target = 6, array = [3, 3]).
ACKO Software Developer Intern Interview Experiences
4 interviews found
Anonymous
4 coding problems + 1 sql problem
(2 Questions)
- Q1. Gas Station Problem On leetcode
- Q2. Simple Tree Traversal Problem LC medium
- Ans.
Given a binary tree, return the inorder traversal of its nodes' values.
Inorder traversal: left subtree, root, right subtree
Use recursion to traverse the tree
Implement a stack-based iterative solution for better space complexity
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview in Feb 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
The online round had 2 coding questions and one question of a regular expression.
- Q1.
Find All Pairs Adding Up to Target
Given an array of integers
ARRof lengthNand an integerTarget, your task is to return all pairs of elements such that they add up to theTarget.Input:
The first line ... - Ans.
Find all pairs of elements in an array that add up to a given target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle cases where the same element is used twice in a pair (e.g., target = 6, array = [3, 3]).
- Q2.
Increasing Subsegment Problem Statement
Given a sequence
ARRconsisting ofNintegers, your task is to identify the longest subsegment ofARR, where you can change at most one number to make the subsegmen... - Ans.
Find the longest subsegment where at most one number can be changed to make it strictly increasing.
Iterate through the array and keep track of the longest increasing subsegment with at most one change.
If a number violates the increasing order, try changing it and check if the subsegment becomes strictly increasing.
Update the length of the longest subsegment found so far.
Return the length of the longest subsegment for e...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
First 10 minutes started with the Introduction. Then he asked about my projects. He seemed interested in my projects and asked a lot of questions about them. He asked questions related to Node Js, React Js, Mongo DB, AWS as all these were mentioned in my Resume. Around 25 minutes was completed explaining each and everything.
Then he started with the coding questions. I was allowed to share my screen and use any of my favourite text editors. I chose ‘VS Code’.
I was able to solve 2 coding questions very easily. I got stuck in the puzzle as I didn’t solve any puzzles before. I was able to come up with different approaches, but they weren’t the most optimal. He tried giving me a lot of hints but still wasn’t able to solve it. I had a positive can-do attitude throughout, and I was really close to solving it.
Feedback: He told me I performed well and asked if I had any questions for him. I asked for the solution to the puzzle. He explained to me the solution and I told him that I will practice puzzles.
Around 5-6 students got selected for 2nd Interview.
- Q1.
Move Zeros To Left
You are provided an array
ARRof integers. Your task is to rearrange this array such that all elements with zero values are moved to the left, and all non-zero elements follow them, pre... - Ans.
Rearrange array with zeros on the left and non-zeros on the right while maintaining original order.
Iterate through the array from right to left, moving non-zero elements to the end of the array.
Track the index where non-zero elements should be placed.
Fill the beginning of the array with zeros and the rest with non-zero elements in their original order.
- Q2.
Maximum Sum of Disjoint Pairs with Specific Difference
Given an array of integers and a number
K, your task is to form pairs of elements from the array such that the absolute difference between them is st... - Ans.
Find maximum sum of disjoint pairs with specific difference in an array.
Sort the array in non-decreasing order.
Iterate through the array and form pairs with absolute difference less than K.
Keep track of the sum of disjoint pairs to maximize it.
Return the maximum sum obtained.
(1 Question)
Round duration - 35 minutes
Round difficulty - Medium
It started with a brief Introduction and in-depth discussions on projects. He also asked me a lot of questions about my previous internship. He asked me some behavioural questions as well.
I was able to solve the question, and he did not ask me any other questions. This round was really short for me and was finished in around 35 minutes, well before time. I asked about my feedback, and he told me that the ‘HR’ will get back to me. I thought he was not satisfied with my answers and I will be rejected though I gave very good answers to every question.
3 students got selected for the next round. I think he was satisfied and did not want to waste more time asking questions.
- Q1.
Polynomial Simplification Problem Statement
You are provided with two arrays representing the coefficients and degrees of a polynomial expression. Your task is to simplify this polynomial into its general...
- Ans.
Simplify a polynomial expression by combining like terms and arranging them in descending order of degrees.
Iterate through the coefficients and degrees arrays to combine like terms
Create a new array to store the simplified polynomial in descending order of degrees
Return the simplified polynomial array
Round duration - 60 minutes
Round difficulty - Medium
It started with an introduction and discussion on projects. He seemed very curious about my project and went ahead to cross-question every functionality. We discussed everything and how the code works. He asked me a lot of questions on ‘Socket’ as my project mentioned it.
HR-related questions such as:
Why do you want to join the company?
Where do you see yourself in the next 5 years?
What are your strengths and weakness?
Interview Preparation Tips
Tip 1 : Must know the standard algorithms (eg: searching, sorting)
Tip 2 : Practise mock interviews with your friends
Tip 1 : Project with the deployed link and Github link
Tip 2 : Don't put information which is not relevant to the job profile
Skills evaluated in this interview
I appeared for an interview in Dec 2020.
(2 Questions)
Round duration - 50 minutes
Round difficulty - Easy
- Q1.
Move Zeros to Left Problem Statement
Your task is to rearrange a given array
ARRsuch that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of... - Ans.
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and move all zero elements to the left side of the array while maintaining the relative order of non-zero elements.
Use two pointers approach to swap elements efficiently.
Ensure to solve the problem in linear time and constant space complexity.
Ex...
- Q2.
Rat in a Maze Problem Statement
Given a maze of size
N * Nwith a rat placed at the top-left corner, find and print all possible paths that the rat can take to reach the bottom-right corner. The rat can m... - Ans.
Find and print all possible paths for a rat to reach the bottom-right corner of a maze.
Create a recursive function to explore all possible paths in the maze.
Keep track of the current path and mark visited cells.
Return the paths as matrices with 1 for cells in the path and 0 for others.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
First 10 minutes started with the Introduction. Then he asked about my projects. He seemed interested in my projects and asked a lot of questions about them.
- Q1.
Matrix Chain Multiplication Problem Statement
You are provided with a chain of matrices A1, A2, A3, ..., An. The goal is to determine the minimum number of scalar multiplications needed to multiply these ...
- Ans.
The goal is to determine the minimum number of scalar multiplications needed to multiply a chain of matrices together.
Understand the matrix chain multiplication problem statement and how the dimensions of matrices are defined by the input array.
Implement a dynamic programming approach to find the minimum cost of matrix multiplication.
Consider the constraints provided and optimize the solution accordingly.
Test the solut...
- Q2. How would you design an application like Instagram?
- Ans.
Designing an application like Instagram involves creating a platform for sharing photos and videos with social networking features.
Implement user profiles with the ability to upload, like, comment, and share photos/videos
Develop a news feed algorithm to display content based on user preferences and interactions
Include features like filters, hashtags, geotagging, and direct messaging
Integrate push notifications for like...
Round duration - 20 minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Good understanding OOPS
Tip 2 : Practice standard Ds and Algo questions
Tip 3 : Be confident
Tip 1 : Resume should be one page.
Tip 2 : Don't mention those things your not confident of
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
- Q1.
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co... - Ans.
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle cases where the position is at the beginning or end of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
(1 Question)
Round duration - 120 minutes
Round difficulty - Easy
- Q1.
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
- Ans.
The problem involves finding the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Use recursion to calculate the diameter of the binary tree.
Keep track of the maximum diameter found during traversal.
Consider the height of the left and right subtrees to calculate the diameter.
Example: For the input 1 2 3 ...
Interview Preparation Tips
Tip 1 : Have good projects
Tip 2 : Have good internships
Tip 3 : Clear all basic
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Pranav Bhat Thirthahalli
Interview Questionnaire
14 Questions
- Q1. What is race condition and how can it be eliminated
- Ans.
Race condition is a situation where multiple threads/processes access and manipulate shared data simultaneously.
It can be eliminated by using synchronization techniques like locks, semaphores, and mutexes.
Another way is to use atomic operations that ensure the data is accessed and modified atomically.
Using thread-safe data structures can also prevent race conditions.
Example: Two threads trying to increment a shared var...
- Q2. What is JCube?
- Ans.
JCube is a Java library for creating and manipulating Rubik's Cube puzzles.
JCube provides classes for representing Rubik's Cube puzzles and algorithms for solving them.
It supports various cube sizes and can generate random scrambles.
JCube can be used in Java applications or as a standalone command-line tool.
It is open source and available on GitHub.
- Q3. What is regression testing?
- Ans.
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software
It ensures that existing functionality is not affected by the changes
It helps to catch any defects or bugs that may have been introduced
It can be automated using testing tools
Examples include retesting after bug fixes, testing after new...
- Q4. Discussion on different sorting techniques
- Q5. Discussion on SQL and SQL optimisaion
- Q6. Software engineering principles
- Ans.
Software engineering principles are the best practices and guidelines for developing high-quality software.
Software should be designed with modularity and scalability in mind.
Code should be well-documented and easy to read.
Testing and debugging should be an integral part of the development process.
Version control should be used to manage code changes.
Security and privacy should be considered throughout the development ...
- Q7. Java and OOP's question
- Q8. Define Singleton class
- Ans.
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
- Q9. Explain Testing principles and Design principles
- Ans.
Testing principles ensure software quality, while design principles guide software development.
Testing principles include unit testing, integration testing, and acceptance testing.
Design principles include SOLID, DRY, and KISS.
Testing principles ensure that software meets requirements and is free of defects.
Design principles guide software development to be modular, maintainable, and scalable.
- Q10. Types of machine learning and methods and examples, they may give you a situation and ask you which technique is good and why
- Q11. Why choose you for VISA?
- Ans.
I have the necessary skills, experience, and passion to contribute to VISA's success.
I have a strong background in software development and have worked on projects similar to those at VISA.
I am a quick learner and can adapt to new technologies and programming languages easily.
I am passionate about creating high-quality software that meets the needs of users and exceeds their expectations.
I am a team player and can work...
- Q12. Which profile is good for you?
- Ans.
A profile that challenges me to learn and grow while allowing me to contribute to a team.
A position that encourages continuous learning and development
A role that allows me to collaborate with a team and contribute to projects
A company culture that aligns with my values and work ethic
- Q13. About the work culture at VISA Inc
- Q14. If u already have a placement, why this company
- Ans.
I am interested in exploring new opportunities and challenges that this company can offer.
I am impressed with the company's reputation and growth potential.
I am excited about the projects and technologies this company is working on.
I believe this company can provide me with a better work-life balance and career growth opportunities.
I am looking for a company culture that aligns with my values and goals.
I am open to exp...
Interview Preparation Tips
Experience: Online Test on mettl.com
- 2 coding questions ( 15*2 = 30 marks ) - Moderate level
- 10 MCQs on Programming and Java ( 1*10 = 10)
- 6 MCQs on Machine Learning and Hadoop ( 1*6 = 6 )
- 6 MCQs on Computer Networks ( 1*6 = 6 )
- 6 MCQs on Computer Infrastructure and Architecture ( 1*6 = 6)
- 6 MCQs on Application security and Cryptography ( 1*6 = 6)
15 shortlisted from here including 8 B.Techs and 7 M.Techs for F2F interviews, which were taken by VISA employees from their US and Singapore offices( since they don't have any office at India ).
Round: Technical Interview
Experience: They may give you a situation and ask you to explain which Software engineering principles will you use. They ask you how will you explain the concept of stacks and queues to a 7 year old, or to a granny, so as to encourage programming(like seriously ? )
General Tips: Nothing as such, since this was my second on-campus placement, I had good experience of interviews.
Keep your fundamentals in all computer science subjects open. Unlike other companies they don't focus much on coding alone. The only other company which also looks at perfection in all computer science aspects is Xerox Research Center India.
Challenging and Equally rewarding, but seriously a unique experience with no much tension
Skills:
College Name: NIT Surathkal
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Tell me about your project ( written in language)?
- Ans.
Developed a web application using Python and Django framework for managing inventory and sales.
Used Python programming language for backend development
Implemented Django framework for building web application
Designed database schema for inventory and sales data
Integrated frontend using HTML, CSS, and JavaScript
Implemented user authentication and authorization features
Interview Preparation Tips
Experience: They asked 3 question on data structures .
1.Merging linekd list
2 and 3 BST related
Duration: 1 hour
Total Questions: 3
Round: Technical Interview
Experience: Interviewer asked me to explain projects which I had mentioned in Resume. Then He asked me to implement a problem on basis of my project.
It was telephonic round.
CGPA and my project mattered.
College Name: IIT Roorkee
Arpan Paul
I applied via Campus Placement and was interviewed in Sep 2016. There were 4 interview rounds.
Interview Questionnaire
7 Questions
- Q1. Tell me about yourself
- Ans.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
- Q2. Explain your resume
- Ans.
My resume highlights my experience in software development and showcases my skills in various programming languages and technologies.
Worked on multiple projects using Java, Python, and C++
Developed web applications using HTML, CSS, and JavaScript
Experience with databases such as MySQL and MongoDB
Familiarity with Agile methodology and version control systems like Git
Participated in hackathons and coding competitions
- Q3. Questions on projects mentioned
- Q4. Why do you want to go for VISA?
- Ans.
I want to go for VISA to explore new opportunities and gain international experience.
To gain exposure to different cultures and work environments
To expand my skill set and learn new technologies
To work on challenging projects and contribute to the growth of the company
To build a global network of professionals and enhance my career prospects
- Q5. Code a basic binary tree
- Ans.
A binary tree is a data structure in which each node has at most two children.
Start with a root node
Each node has a left and right child
Nodes can be added or removed
Traversal can be done in-order, pre-order, or post-order
- Q6. Code a basic linked list
- Ans.
Code a basic linked list
Create a Node class with data and next pointer
Create a LinkedList class with head pointer
Implement methods to add, delete, and search nodes in the linked list
- Q7. Code a circular linked list
- Ans.
A circular linked list is a data structure where the last node points back to the first node, forming a loop.
Create a Node class with data and next pointer
Initialize the head node and set its next pointer to itself
To add a node, create a new node and set its next pointer to the head node's next pointer, then update the head node's next pointer to the new node
To traverse the circular linked list, start from the head nod...
Interview Preparation Tips
Experience: It was a programming test hosted on hackerrank. A total of 3 questions. I could solve only one of them. That too only a few test cases. Still got shortlisted for the next round. :)
Tips: Do practice a few challenges on programming platforms. Brush up your programming knowledge.
Total Questions: 3
Round: Technical Interview
Experience: It was an HR cum Technical round for me as I came from a non CS background. I was able to convince them I am a perfect fit for VISA
Tips: Do prepare your resume well. If you have coding projects, make sure you are clear with whatever you write. They might quiz you hard on them. Strong knowledge on Data structures and Algorithms will give you an edge.
Skills: Presentation Of Facts In Resume, Basic Coding, Communication, Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Funny Moments: I am a part of the sponsorship team of our technical and VISA was an associate sponsor for the same the previous year. Hence I had specified this fact in my interview. :P
Skills evaluated in this interview
RAJIVTEJA NAGIPOGU
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Interview Questionnaire
6 Questions
- Q1. Given an array of numbers find the subset of numbers that give zero sum.
- Ans.
Find subset of numbers in array that sum up to zero.
Use a nested loop to iterate through all possible subsets.
Calculate the sum of each subset and check if it equals zero.
Store the subset if the sum is zero.
Optimize the solution by using a hash set to store the cumulative sum of elements.
- Q2. Explain how bfs works?
- Ans.
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.
BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.
It uses a queue data structure to keep track of the vertices to be visited.
BFS guarantees that it visits all the vertices of a connected graph.
It can be used to find the shortest path between two...
- Q3. Discussion on the projects I have done.
- Q4. Question on Linked List.
- Q5. Project Discussion
- Q6. Strengths and weaknesses. Where do you see yourself in 5 years?
- Ans.
In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.
Continuously improving my technical skills through learning and hands-on experience
Taking on leadership roles and mentoring junior developers
Contributing to the development of cutting-edge software solutions
Building strong relationships with clients and stakeholders
Staying updated with the latest indu...
Interview Preparation Tips
Experience: I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Round: Technical + HR Interview
Experience: I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
College Name: IIT Madras
Skills evaluated in this interview
I applied via Campus Placement
Interview Preparation Tips
Experience: Aptitude questions were logical, not tough. For coding, one question, not basic but very logical.
Tips: for coding part try practicing on hackerrank.
Duration: 45+30 minutes
Total Questions: 20+1
Round: Technical Interview
Experience: Interviewer asked all about Linked list and Data structures and algorithm.
Tips: Atleast try learning some basic concepts of linked list, stacks, queues and binary tree.
General Tips: Interview was fair, without any partiality for girls/boys or B.Tech/Dual.
Skill Tips: Be confident and reply frankly. Never let them know that you are nervous.
Skills: Confidence
Duration: 2.5
College Name: IIT Madras
Funny Moments: "Lets go for a walk". HR interviewer will take you for a round to ask you HR questions.
Please prepare for two questions "Tell me something about you" and "Why PayPal, why not any other company".
I appeared for an interview before Jan 2021.
(1 Question)
Round duration - 75 minutes
Round difficulty - Easy
Simple question based on strings was given. MCQs based on basic aptitude and programming questions were asked.
Tips: Time management is important. Remember all the syntaxes
- Q1.
Reverse the String Problem Statement
You are given a string
STRwhich contains alphabets, numbers, and special characters. Your task is to reverse the string.Example:
Input:
STR = "abcde"
Output:
"e...
- Ans.
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the input string length and number of test cases.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
It was a good experience.
Tips: If you don't know something just tell them. Don't try to answer something if you don't know anything about it
- Q1.
One Away Transformation Problem
Given two strings,
AandB, determine whetherAcan be transformed intoBby performing at most one of the following operations (including zero operations):1. Delete a ch... - Ans.
Determine if one string can be transformed into another by performing at most one operation (insert, delete, replace).
Iterate through both strings simultaneously and check for differences.
Handle cases where a character needs to be inserted, deleted, or replaced.
Keep track of the number of operations performed and ensure it does not exceed one.
- Q2.
Remove Duplicates from String Problem Statement
You are provided a string
STRof lengthN, consisting solely of lowercase English letters.Your task is to remove all duplicate occurrences of characters i...
- Ans.
Remove duplicate occurrences of characters in a given string.
Use a hash set to keep track of characters seen so far.
Iterate through the string and add non-duplicate characters to a new string.
Return the new string without duplicate characters.
Round duration - 30 minutes
Round difficulty - Easy
It was easy. I could answer the first question. Second one I answered really badly
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Revise C++/Java.
Tip 3 : If you don't know much of C++/Java at least write the codes in C.
Tip 4 : Go through all the previous interview experiences from Codestudio and Leetcode.
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.
ACKO Interview FAQs
Tell us how to improve this page.
ACKO Interviews By Designations
- ACKO Software Developer Intern Interview Questions
- ACKO Assistant Manager Interview Questions
- ACKO Software Developer Interview Questions
- ACKO Operations Manager Interview Questions
- ACKO Team Lead Interview Questions
- ACKO Associate Product Manager Interview Questions
- ACKO Customer Service Associate Interview Questions
- ACKO Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Interview Questions from Similar Companies
ACKO Software Developer Intern Reviews and Ratings
based on 3 reviews
Rating in categories
|
Product Designer
156
salaries
|  ₹15.7 L/yr - ₹30 L/yr |
|
Assistant Manager
97
salaries
| ₹5.1 L/yr - ₹11 L/yr |
|
Senior Associate
51
salaries
| ₹3.5 L/yr - ₹6.5 L/yr |
|
Senior Manager
51
salaries
| ₹10.5 L/yr - ₹44 L/yr |
|
Claims Specialist
43
salaries
| ₹4 L/yr - ₹7.1 L/yr |
PhonePe
Fiserv
KFintech
Angel One
- Home >
- Interviews >
- ACKO Interview Questions
