Skip to content

Canara Bank 2026 Pattern Details

Overview

This page collects Canara Bank placement papers from 2026 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Canara Bank patterns and recent shifts.

Canara Bank Aptitude Mock Quiz

Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.

Questions15
Time10 min

Canara Bank exam pattern 2026

Section What shows up Prep focus
Aptitude / logical Quant, reasoning, sometimes verbal Timed sectional accuracy
Coding / programming logic Easy-medium DSA or output-style MCQs Handle tricky inputs
Technical interview OOPs, DBMS, OS, projects Explain aloud
HR Fit, location, intent A few real examples ready

First round: IBPS / Canara Bank Notification Test
Skills emphasized: Aptitude, reasoning, banking awareness
Languages: Not primary for clerk/PO; tech roles separate

Sample Canara Bank questions with solutions

These are practice-style questions aligned to patterns students report for Canara Bank drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.

Quantitative aptitude (2026)

Q1: Three workers

Problem: A finishes work in 12 days, B in 15 days, and C in 20 days. Working together, how many days do they need?

Solution: Take total work = LCM(12,15,20) = 60 units. A = 5/day, B = 4/day, C = 3/day. Combined = 12 units/day. Time = 60/12 = 5 days.

Answer: 5 days

Q2: Age ratio

Problem: The ratio of ages of A and B is 3:5. After 8 years the ratio becomes 5:7. Find A’s present age.

Solution: Let ages be 3x and 5x. (3x+8)/(5x+8) = 5/7 7(3x+8) = 5(5x+8) 21x + 56 = 25x + 40 4x = 16 → x = 4 A’s age = 12 years.

Answer: 12 years

Q3: Pipe fill

Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?

Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.

Answer: 24/7 hours

Q4: Simple interest

Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.

Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.

Answer: ₹1600

Q5: Percentage recover

Problem: If 30% of a number is 150, what is the number?

Solution: 0.3x = 150 → x = 150 / 0.3 = 500.

Answer: 500

Q6: Average after replace

Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?

Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.

Answer: 16

Q7: Series n(n+1)

Problem: Find the next term: 2, 6, 12, 20, 30, ?

Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.

Answer: 42

Q8: Deck probability

Problem: What is the probability of drawing an ace from a standard 52-card deck?

Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.

Answer: 1/13

Logical reasoning (2026)

Q1: Coding letter shift

Problem: If CAT is coded as DBU, how is DOG coded in the same way?

Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.

Answer: EPH

Q2: Blood relation

Problem: Pointing to a photograph, Ravi says, ‘She is the daughter of my mother’s only son.’ How is the girl related to Ravi?

Solution: Ravi’s mother’s only son is Ravi himself (assuming one son). The girl is therefore Ravi’s daughter.

Answer: Daughter

Q3: Syllogism

Problem: Statements: All engineers are graduates. Some graduates are managers. Conclusion: Some engineers are managers. Does it follow?

Solution: The ‘some graduates’ who are managers need not overlap with the engineers. The conclusion does not follow necessarily.

Answer: Does not follow

Q4: Direction turn

Problem: A person walks 5 km north, then 3 km east, then 5 km south. How far is he from the start, and in which direction?

Solution: North 5 and south 5 cancel. He is 3 km east of the start.

Answer: 3 km east

Coding practice (2026)

Coding Q1: Maximum subarray sum (Kadane)

Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).

Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.

Complexity: O(n) time, O(1) extra space

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q2: Reverse a string in place

Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.

Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.

Complexity: O(n) time, O(1) extra space

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q3: Check prime

Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.

Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.

Complexity: O(√n) time

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q4: Valid parentheses

Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.

Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.

Complexity: O(n) time, O(n) space

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q5: Two Sum

Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.

Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.

Complexity: O(n) time, O(n) space

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q6: Longest substring without repeating characters

Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).

Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.

Complexity: O(n) time

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q7: Merge overlapping intervals

Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.

Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.

Complexity: O(n log n) time from the sort

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q8: Top K frequent elements

Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.

Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.

Complexity: O(n log k) with a heap

Canara Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Deep prep notes for Canara Bank

How the ibps / Canara Bank notification test usually feels

Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Canara Bank, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Not primary for clerk/PO; tech roles separate.

Topic weight hints

Area Why it matters at Canara Bank
Aptitude What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Indian Public Sector Banking awareness Helps in managerial / HR conversations
Communication Explain your approach clearly; keep a few real examples ready for HR

14-Day sprint

  1. Days 1-3: Learn the 2026 pattern and take two sectional mocks
  2. Days 4-7: Closed practice on weak topics from your error log
  3. Days 8-10: Full mocks every other day; review the same day
  4. Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready

Comments & Suggestions

Similar companies

SBI · Bank of Baroda · Axis Bank · HDFC Bank · ICICI Bank