TCS Ignite Smart Hiring 2027
₹6,000.00
-
About the Course
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
No items in this section -
[Numerical Ability] Mensuration - Geometry
-
[Numerical Ability] Mensuration - Perimeter Area Volume
-
[Numerical Ability] Decimal and Fraction
-
[Numerical Ability] - Elementary Statistics
-
[Numerical Ability] Data Interpretation
-
[Numerical Ability] Divisibility
-
[Numerical Ability] HCF and LCM
-
[Numerical Ability] Number System
-
[Numerical Ability] :- [Arithmetic Ability] Percentage
-
[Numerical Ability] :- [Arithmetic Ability] Alligations and Mixtures
-
[Numerical Ability] :- [Arithmetic Ability] Ratio and Proportion
-
[Numerical Ability] :- [Arithmetic Ability] Time and Work
-
[Numerical Ability] :- [Arithmetic Ability] Boats & Streams
-
[Numerical Ability] :- [Arithmetic Ability] Profit and Loss
-
[Numerical Ability] :- [Arithmetic Ability] Average
-
[Numerical Ability] :- [Arithmetic Ability] Equations
-
[Numerical Ability] :- [Arithmetic Ability] Ages Problems
-
[Numerical Ability] :- [Arithmetic Ability] Clock Problems
-
[Numerical Ability] :- [Arithmetic Ability] Calendar Problems
-
[Numerical Ability] :- [Arithmetic Ability] Arithmetic Progression & Geometric Progression
-
[Numerical Ability] :- [Arithmetic Ability] Probability
-
[Numerical Ability] :- [Arithmetic Ability] Permutation and Combination
-
[Numerical Ability] :- [Arithmetic Ability] Simple and Compound Interest
-
[Numerical Ability] :- [Arithmetic Ability] Surds and Indices
-
[Numerical Ability] :- [Arithmetic Ability] Odd man out and Series
-
[Numerical Ability] :- [Arithmetic Ability] Pipes and Cistern
-
[Numerical Ability] :- [Arithmetic Ability] Time,Speed & distance
-
[Numerical Ability] :- [Arithmetic Ability] Simplifications & Approximations
-
[Numerical Ability] - Train Problems {extra}
-
[Verbal Reasoning] Reading Comprehension
-
[Verbal Reasoning] Sentence Corrections
-
[Verbal Reasoning] Sentence Completion
-
[Verbal Reasoning] Error Identification
-
[Verbal Reasoning] Synonyms and Antonyms
-
[Verbal Reasoning] Passage/Paragraph Arrangement
-
[Verbal Reasoning] Sentence Rearrangement
-
[Verbal Reasoning] Fill in the Blanks
-
[Verbal Reasoning] Roots words
-
[Verbal Reasoning] Subject Verb Agreement
-
[Verbal Reasoning] - Idioms and Phrases
-
[Verbal Reasoning ] Verbal Ability Extra
- Introduction to Verbal Ability + Tenses Part #1
- Tenses Part #2
- Tenses Notes
- Error Detection and Correction + Sentence Completion #1
- Sentence Completion #2
- Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- Assumption in Verbal Reasoning
- Deduction Reasoning
-
[Reasoning Ability] Numeric Patterns :- Number Series
-
[Reasoning Ability] Numeric Patterns :- Odd man out and Series
-
[Reasoning Ability] Problem Solving :- Coding Decoding
-
[Reasoning Ability] Problem Solving :- Blood Relations
-
[Reasoning Ability] Problem Solving :- Directions
-
[Reasoning Ability] Problem Solving :- Seating Arrangement
-
[Reasoning Ability] Figural and Factual Analysis :- Paper Folding & Cutting
-
[Reasoning Ability] Figural and Factual Analysis :- Cubes and Dice
-
[Reasoning Ability] Propositional Reasoning :- Venn Diagram
-
[Reasoning Ability] Decision Making :- Statement & Conclusion
-
[Reasoning Ability] Decision Making :- Syllogism
-
[Reasoning Ability] Decision Making :- Data Sufficiency
-
[Reasoning Ability] Visual/Spatial Reasoning
-
[Reasoning Ability] Identifying Word :- Word Pattern
-
Complete Data Structures [ Pro ]
- Introduction [ Introduction ]
- Types Of Data Structures [ Introduction ]
- Operations Of Data Structures [ Introduction ]
- Concept Of Abstract Data Type [ Introduction ]
- Arrays – Part 1 [ Arrays & Two Pointers]
- Arrays – Part 2 [ Arrays & Two Pointers]
- Introduction of Two Pointer Technique [ Arrays & Two Pointers]
- Two Sum Problem [ Arrays & Two Pointers]
- Container with most Water Problem [ Arrays & Two Pointers]
- Valid Anagram Problem [ Arrays & Two Pointers]
- Trapping Rain Water Problem [ Arrays & Two Pointers]
- K most Frequent Elements Problem [ Arrays & Two Pointers]
- Introduction To Stack [ Stacks ]
- Operations Of Stack ADT [ Stacks ]
- Stack Implementation Using Array Part – 1 [ Stacks ]
- Stack Implementation Using Array Part – 2 [Stacks]
- Daily Temperatures Problem [ Stacks ]
- Car Fleet Problem [ Stacks ]
- Introduction of Sliding Window Algorithm [ Sliding Window ]
- Best Time to Buy and Sell Stock [ Sliding Window ]
- Best Time to Buy and Sell Stock II [ Sliding Window ]
- Add Two Numbers [ Linked Lists ]
- Remove Nodes From Linked List [ Linked Lists ]
- Merge Two Sorted Lists [ Linked Lists ]
- Linked List Cycle [ Linked Lists ]
- Reorder List [ Linked Lists ]
- LRU Cache [ Linked Lists ]
- Merge k Sorted Lists [ Linked Lists ]
- Diameter of Binary Tree [ Trees ]
- Maximum Depth of Binary Tree [ Trees ]
- Invert Binary Tree [ Trees ]
- Binary Tree Preorder Traversal [ Trees ]
- Binary Tree Level Order Traversal [ Trees ]
- Lowest Common Ancestor of a Binary Search Tree [ Trees ]
- Kth Smallest Element in a BST [ Trees ]
- Binary Tree Right Side View [ Trees ]
- Validate Binary Search Tree [ Trees ]
- N-ary Tree Level Order Traversal [ Trees ]
- Graph & Types [ Graphs ]
- Adjacency Matrix & Adjacency List [ Graphs ]
- DFS+ Rooms & Keys Problem [ Graphs ]
- BFS Breadth First Search [ Graphs ]
- Number of Island [ Graphs ]
- Max Area if Island [ Graphs ]
- Surrounded Region [ Graphs ]
- Graph Valid Tree [ Graphs ]
- Number of Connected Components [ Graphs ]
- Dijkstra’s Algorithm [ Graphs ]
- Climbing Stairs [ 1-D Dynamic Programming ]
- Min Cost Climbing Stairs [ 1-D Dynamic Programming ]
- House Robber [ 1-D Dynamic Programming ]
- Coins Change [ 1-D Dynamic Programming ]
- 0/1 Knapsack (2DP-DP) [ 2-D Dynamic Programming ]
- Longest Common Subsequence [ 2-D Dynamic Programming ]
- Longest Palindromic Substring [ 2-D Dynamic Programming ]
- Longest Increasing Subsequence [ 2-D Dynamic Programming ]
- Unique Path I [ 2-D Dynamic Programming ]
- Unique Path II [ 2-D Dynamic Programming ]
- Target Sum [ 2-D Dynamic Programming ]
- Edit Distance [ 2-D Dynamic Programming ]
- Dynamic Pogramming [ DP – Dynamic Programming ]
- DP Approaches 1 [ DP – Dynamic Programming ]
- DP Approaches 2 [ DP – Dynamic Programming ]
- Tips to Solve DP Problems [ DP – Dynamic Programming ]
-
[Coding Language] C++
- Introduction to C++
- Input & Output in C++
- Difference between Structure in C & C++
- Class & Objects C++
- Inspector, Mutators, Facilitators
- Contructor & Destructor
- Default Arguments & Inline Function
- Array of Objects
- Dynamic Memory Allocation
- Static Member and function
- Exception handling
- Composition
- Friend Class and function
- Function Overloading
- Operator Overloading
- Copy Constructor
- Inheritance
- Pure Virtual Function
- Types of Inheritance
- Virtual Function
- Template
- RTTI
- Casting Operators
- Dynamic Array of Object
- C++ Sample [Notes]
- C++ [Notes]
- C++ Practice Problem
-
[Coding Section] Coding Questions
-
[Coding Language] Python for Beginners
- [Module 1] Introduction and Installation
- [Module 02 : Basic I/O, Operators & Using] Numbers and Strings
- [Module 02 : Basic I/O, Operators & Using] Lists and Dictionaries
- [Module 02 : Basic I/O, Operators & Using] Assignment Operators
- [Module 02 : Basic I/O, Operators & Using] Development Environment
- [Module 02 : Basic I/O, Operators & Using] Visual Studio Code: [VS_Code]
- [Module 03: Conditional Statements & Loop] Conditional Statements
- [Module 03: Conditional Statements & Loop] User Input
- [Module 03: Conditional Statements & Loop] WHILE Loop
- [Module 03: Conditional Statements & Loop] FOR Loop
- [Module 03: Conditional Statements & Loop] FOR Loop: (Dictionary Enumeration)
- [Module 04: Functions, Classes & Exception] Functions
- [Module 04: Functions, Classes & Exception] Class and Objects
- [Module 04: Functions, Classes & Exception] Constructors
- [Module 04: Functions, Classes & Exception] Exception handling
- [Module 05: Module & Experincin] Modules
- [Module 05: Module & Experincin] Statistics Module
- [Module 05: Module & Experincin] CSV Module
- [Module 05: Module & Experincin] PIP
- [Module 05: Module & Experincin] Jupyter Note Book
- [Module 06: SQLite, Tkinter in Python] SQLite
- [Module 06: SQLite, Tkinter in Python] Tkinter
- [Module 06: SQLite, Tkinter in Python] Making [.exe] in Python
- [Bonus Hands-On Projects+ Source Code] Rock Paper Scissor Python Game
- [Bonus Hands-On Projects+ Source Code] Message Encode Decode in Python Project
- [Bonus Hands-On Projects+ Source Code] Calculator in Python
- [Bonus Hands-On Projects+ Source Code] Source Code of all 3 Projects [Notes]
-
[Coding Language] C Programming
- 01 – Algorithm & FlowCharts
- 02 – Keywords & Identifiers
- 03 – First program in C
- 04 – Variables & Constants
- 05 – Datatypes in C – Part 1
- 06 – Datatypes in C – Part 2
- 07 – Operators in C
- 08 – Bitwise Operators
- 09 – Basic IO
- 10 – If & If Else – Part 1
- 11 – Nested If Else & Else If – #1
- 12 – Nested If Else & Else If – #2
- 13 – Switch Statement
- 14 – Loops & For Loop
- 15 – While & Do-While Loop
- 16 – Function in C
- 17 – User Defined Function
- 18 – Recursion – #1
- 19 – Recursion – #2
- 20 – Introduction To Arrays
- 21. 1-D Array
- 22. 2-D Array
- 23. Strings
- 24. String Functions
- 25. Structure & Union
- 26. Implementation of Structure & Union
- 27. Structure with function
- 28. Pointers in C
- 29. Pointers in C Code
- 30. Pointer Operations in C
- C Programming [Notes]
- C Programming Practice Problem
TCS NQT Complete Prep Course [ Videos + Notes + Mock ]
Crack your Dream company Aptitude in first attempt with LMT Aptitude Series
- 📚60+ video Lectures
- 📌 500+ Practice Problems
- 📝 Handmade Notes
- 👣 Beginner Friendly
- ⭐️ Trusted by 1000+ Students
- 🔥 10 Lakh+ Video Views of Youtube
Course Sections:
- 🧠 Quantitative Aptitude
- 🗣 English Ability
- 📊 Reasoning
The one-stop destination for everything you need for Aptitude Preparations
So let’s dive in – Enroll today, Crack the exam & get to work with your Dream Company
Course Features
- Lectures 424
- Quizzes 0
- Duration 25 hours
- Skill level All levels
- Language Hindi
- Students 0
- Certificate No
- Assessments Yes
