PYTHON PREP COURSE
For coding round preparation of LTIMindTree
SEPTEMBER 16, 2025
MOHAN BABU UNIVERSITY
TIRUPATI
TABLE OF CONTENTS
Overview .................................................................................................................................................... 2
Online Practice Platforms ......................................................................................................................... 2
Day-by-Day Content................................................................................................................................. 2
Day 1 – String Basics ............................................................................................................................... 2
Day 2 – String Operations ...................................................................................................................... 2
Day 3 – Advanced String Problems ..................................................................................................... 3
Day 4 – Pattern Printing ......................................................................................................................... 3
Day 5 – Number Properties ................................................................................................................... 4
Day 6 – Math & Bit Manipulation ......................................................................................................... 4
Day 7 – Array Basics ............................................................................................................................... 4
Day 8 – Array Manipulation .................................................................................................................. 5
Day 9 – Array Advanced ...................................................................................................................... 5
Day 10 – Searching ................................................................................................................................ 6
Day 11 – Sorting (Part 1) ........................................................................................................................ 6
Day 12 – Sorting (Part 2) ........................................................................................................................ 7
Day 13 – Data Structures ....................................................................................................................... 7
Day 14 – Searching & Sorting Mix......................................................................................................... 7
Conclusion .................................................................................................................................................. 8
1
OVERVIEW
This 14-day intensive program is designed for MCA final-year students preparing for LTIMindtree’s
coding exam. The course balances Python fundamentals with interview-focused problem-solving.
Each day introduces a key coding theme, explains its importance in interviews, and provides
curated practice problems from trusted platforms. By the end of the program, students will be
equipped with the skills and confidence to tackle coding assessments effectively.
ONLINE PRACTICE PLATFORMS
• Practice Python — 40+ beginner friendly exercises
• PYnative Python Exercises — Themed exercises with solutions
• Pychallenger — Interactive quizzes and tutorials
• W3Resource Python Exercises — 9000+ categorized problems
• CodeChef Python Practice — Real coding challenges
• W3Schools Python — Interactive tutorial
• HackerRank Python Track — Interview-centric coding practice
• GeeksforGeeks Python Practice — Problems sorted by topic/difficulty
• LeetCode Python Section — Interview patterns, company wise
DAY-BY-DAY CONTENT
DAY 1 – STRING BASICS
Strings are the foundation of coding challenges since text processing is common in interviews. On
this day, students will learn how to manipulate strings and practice reversing, splitting, and
checking properties like palindromes. These problems build comfort with Python slicing and
iteration.
• Reverse a string
o GFG
o LeetCode
o Coding Ninjas
• Reverse words in a sentence
o LeetCode
o InterviewBit
• Palindrome string
o LeetCode
o Coding Ninjas
DAY 2 – STRING OPERATIONS
Beyond the basics, string manipulation often requires filtering, counting, or removing characters.
This day focuses on hands-on problems like removing vowels, eliminating duplicates, and
frequency counts — all of which improve problem-solving with dictionaries, sets, and loops.
• Remove vowels
2
o GFG
o Coding Ninjas
• Remove duplicate characters
o GFG
o LeetCode
o Coding Ninjas
• Count frequency of characters
o GFG
o Coding Ninjas
DAY 3 – ADVANCED STRING PROBLEMS
Here we explore string-based interview classics: finding substrings, verifying anagrams, and
detecting unique characters. These problems often require hash maps or sliding window
techniques — essential for medium-to-hard coding challenges.
• Longest substring without repeating characters
o LeetCode
o InterviewBit
• Anagram check
o GFG
o LeetCode
o HackerRank
• First non-repeating character
o GFG
o LeetCode
DAY 4 – PATTERN PRINTING
Pattern printing is a common warm-up in coding interviews. Students will learn how to use loops
effectively to generate structured outputs like pyramids, Floyd’s triangle, and Pascal’s triangle,
strengthening logic and control flow.
• Pyramid patterns
o GFG
o Coding Ninjas
• Floyd’s triangle
o GFG
o Coding Ninjas
• Pascal’s triangle
o GFG
3
o LeetCode
o Coding Ninjas
DAY 5 – NUMBER PROPERTIES
Mathematical properties of numbers frequently appear in entry-level coding tests. Students will
practice identifying primes, Armstrong numbers, and perfect numbers. These exercises develop
comfort with loops, conditionals, and mathematical logic.
• Prime numbers up to N
o GFG
o HackerRank
o Coding Ninjas
• Armstrong number
o GFG
o Coding Ninjas
• Perfect number
o GFG
o Coding Ninjas
DAY 6 – MATH & BIT MANIPULATION
Efficient problem-solving often involves bitwise operations and number theory. This day covers
GCD/LCM (important for math-based coding), digit reversal (useful in number manipulation), and
power-of-2 checks (popular interview pattern).
• GCD & LCM
o GFG
o InterviewBit
o Coding Ninjas
• Reverse digits
o LeetCode
o GFG
• Power of 2
o LeetCode
o InterviewBit
o Coding Ninjas
DAY 7 – ARRAY BASICS
4
Arrays (lists in Python) are central to most coding challenges. Students will practice traversing
arrays, finding max/min, and identifying the second largest element. These basics will prepare
them for more advanced array manipulation tasks.
• Max & Min in array
o GFG
o Coding Ninjas
• Second largest element
o GFG
o Coding Ninjas
o Leetcode
• Count even & odd
o GFG
o Coding Ninjas
DAY 8 – ARRAY MANIPULATION
Interviewers often test how well candidates can modify arrays. Students will practice rotation,
finding duplicates, and identifying missing numbers. These problems require both logical thinking
and efficient use of data structures.
• Rotate array
o LeetCode
o GFG
o Coding Ninjas
• Find duplicates
o LeetCode
o GFG
o Coding Ninjas
• Missing number
o LeetCode
o GFG
o Coding Ninjas
DAY 9 – ARRAY ADVANCED
Students will tackle advanced array problems such as maximum subarray sum (Kadane’s
Algorithm), sorting arrays of 0s,1s,2s (Dutch National Flag), and merging sorted arrays. These are
standard interview favorites and strengthen algorithmic thinking.
• Kadane’s Algorithm (max subarray sum)
o LeetCode
5
o GFG
o Coding Ninjas
• Sort 0s, 1s, 2s
o LeetCode
o GFG
o Coding Ninjas
• Merge two sorted arrays
o LeetCode
o InterviewBit
o Coding Ninjas
DAY 10 – SEARCHING
Efficient searching is key to coding interviews. Students will practice linear and binary search,
along with variations like finding the first and last occurrence of elements. These problems help
build mastery of search patterns in arrays.
• Linear search
o GFG
o Coding Ninjas
• Binary search
o LeetCode
o GFG
o Coding Ninjas
• First & last occurrence
o LeetCode
o InterviewBit
o GFG
DAY 11 – SORTING (PART 1)
Sorting is a must-know concept for coding exams. Day 11 focuses on elementary sorting
algorithms (Bubble, Selection, Insertion) to strengthen logic and help students understand time
complexity trade-offs.
• Bubble sort
o GFG
o Coding Ninjas
• Selection sort
o GFG
6
o Coding Ninjas
• Insertion sort
o GFG
o Coding Ninjas
DAY 12 – SORTING (PART 2)
This day introduces advanced and efficient sorting methods — Merge Sort, Quick Sort, and
Counting Sort. These divide-and-conquer and counting-based techniques are widely used in
competitive programming and interviews.
• Merge sort
o LeetCode
o GFG
o Coding Ninjas
• Quick sort
o GFG
o Coding Ninjas
• Counting sort
o GFG
o Coding Ninjas
DAY 13 – DATA STRUCTURES
Implementing stacks and queues using arrays, and basic linked list operations. Understanding
these fundamentals is crucial since many interview questions are built on top of them.
• Stack using array
o GFG
o Coding Ninjas
• Queue using array
o GFG
o Coding Ninjas
• Linked list basic (insert, delete, traverse)
o GFG
o Coding Ninjas
o InterviewBit
DAY 14 – SEARCHING & SORTING MIX
7
Mixed-level problems that combine searching, sorting, and data structure usage. Students will
solve real interview-style challenges like searching in a rotated array, finding the kth largest
element, and array intersections
• Search in rotated sorted array
o LeetCode
o InterviewBit
o GFG
• Kth largest element
o LeetCode
o GFG
o Coding Ninjas
• Intersection of two sorted arrays
o LeetCode
o GFG
o Coding Ninjas
CONCLUSION
By the end of this 14-day course, students will have:
• Strengthened their Python coding fundamentals.
• Practiced a wide range of interview-style problems.
• Learned to apply efficient algorithms and data structures.
• Built confidence to attempt LTIMindtree’s coding exam and similar company tests.