Programming and DSA with Python for Placement Coding Rounds
Crack the TCS NQT, Infosys, Wipro, IBM, Accenture and Capgemini coding rounds: 44 lessons, one concept and one problem each, in Python.
What you'll learn
- The "Why & What" Part
- Python foundations
- Exam input and output: how TCS NQT, HackerRank and others expect it
- Maths and number logic
- Arrays
- Strings
- Hashing
- Sorting and searching
Course Outline
10 Sections44 Lessons18 min
The "Why & What" Part2 Lessons
Why this course
AOSP: Art Of Solving Problems
Python foundations4 Lessons | 8 min
Python installation and setupComing soon
Python Fundamentals: Syntax, Variables, Conditions, LoopsComing soon
Essential Data Structures I: Integer, String, ArrayComing soon
Essential Data Structures II: Dictionary, Stack, QueueComing soon
Exam input and output: how TCS NQT, HackerRank and others expect it4 Lessons | 10 min
Anatomy of an exam problemComing soon
Reading input in every shapeComing soon
Printing output exactlyComing soon
The 12 ways candidates lose test casesComing soon
Maths and number logic5 Lessons
Digit manipulationComing soon
PrimesComing soon
GCD and LCMComing soon
Base conversion and bitsComing soon
Pattern printing with nested loopsComing soon
Arrays7 Lessons
Single-pass traversalComing soon
Prefix sums and pivot indexComing soon
Running minimum: buy and sell stockComing soon
Kadane's algorithmComing soon
Rotation and reversal in placeComing soon
Missing and duplicate numbersComing soon
MatricesComing soon
Strings5 Lessons
Clean and compare: palindromesComing soon
Word-level processingComing soon
Character frequencyComing soon
Parsing and mappingComing soon
Prefix, substring and compressionComing soon
About this course
Service-based company coding rounds are not LeetCode Hard. Every screening round at TCS NQT, Infosys, Wipro Elite NTH, IBM ASE, Accenture, Capgemini and Cognizant GenC gives you two problems, one Easy and one Easy-to-Medium, drawn from arrays, strings, math and number logic, hashing, sorting, searching and basic stacks and linked lists. Trees, graphs and dynamic programming almost never appear.