You are provided with a list of numbers from ‘0’ to (2 * ’N’ - 1). You have to find the minimum number of swaps needed to make every even number ‘E’ (present in the list) adjacent to (‘E’ + 1).
Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Preparation Tip
Tip 1 : Prepare your resume well. Tip 2 : Deploy your projects so that the interviewer can view it. Also provide a hyperlink on your resume. Tip 3 : Be thorough with Data Structures and Algorithms. Also prepare well topics such as OS,DBMS.
Application Process
Where:
Campus
Eligibility:
Above 7.5 CGPA
Resume Tip
Tip 1 : Deploy your projects so that the interviewer can view it. Also provide a hyperlink on your resume Tip 2 : It's not important to have fancy projects. Only mention those on which you're confident.
0 upvotes
Have an interview experience that you want to contribute?