Who are we?

Helping Students
to Realize Their Dreams
for the Last 14 Years
PARTNERSHIPS & ASSOCIATIONS
CLIENTS

Universities | Colleges | Startups | Corporates

Coach for WorldSkills 2022 - Cloud Computing
Success Stories

55.05%
INFOSYS

48.51%
48.09%*
L&T 62.79% TCS DIGITAL
CAPGEMINI 77.85%
CTS
54.09% 59.07%
TCS NINJA
WIPRO
 SD T
SD T
Super Dream Offer Training
Preparation Matrix

Content

Training

Methodology

Practice

Constant Support
Agenda

SDOT we offer TCS Ninja Training

Syllabus Post Training Support

Sample Question Checklist

Post SDOT

CLAP User Interface

Training we offer

Total = 12 hours

CS Non CS

Data Structures and Algorithms + RDBMS Data Structures and Algorithms

9 hours + 3 hours 12 hours

Code Along Approach

Learn the concepts by Coding along with the Subject Matter Expert
Learning Platform

Introducing…

C DING
ON

<Codemithra/> LMS
Data Structures & Algorithms Focussed oN

Linked List – circular/ loop / sorting

Stack – Postfix evaluation, brackets grouping

Tree – Preorder, Postorder, Inorder, Binary Search Tree

Graph - Dynamic programming, backtracking using graphs

Queue - Constructing stacks using queue, applications

Array - Counting sort, radix sort

Greedy Algorithm, Divide and Conquer, Asymptotic analysis

Advanced String algorithms

RDBMS Focussed oN

Introduction

Data Types

Table Creation

Modifying the Structure

Querying

Manipulating Data

PL/SQL

Joins & Sub Query

Sample
Question
Container With Most Water
- Amazon, Adobe, Google and Facebook
Sample Problem

You are given an integer array height of length n

There are n vertical lines drawn such that the two
endpoints of the ith line are (i, 0) and (i, height[i])
1. Find two lines that together with the x-axis form a
container, such that the container contains the
most water
2. Return the maximum amount of water a container
can store.
Example

In the given image, the height array is

[1,8,6,2,5,4,8,3,7]
The max area of water (blue section)
the container can contain is 49.
Thought Process

Measuring the amount of water is quite simple.

It is just like calculating the area of the rectangle.
The blue area represents the area
How do we find the l and b of the rectangle?
Thought Process

We must find the two columns that trap the most

water.
Example: The red columns highlighted in the
picture
The differences in the indices would be the
length
Thought Process

The breadth would be the minimum

of the two red columns, as shown in
the figure
How do we find the two columns?
SolutionS..
Naive Solution

We can check for every pair of columns and find the area for each of
the pair
This is very inefficient solution, even though it will give us the answer
Let us name the two red columns as ‘x’ and ‘y’ which are the indices
of 1 and 8 in the height array, respectively
Here, the height array has 9 elements, we would be checking all of
the ordered pairs i.e.
(height[0], height[1]), (height[0], height[2]).....(height[0], height[8])
(height[1], height[2]), (height[1], height[3]).....(height[1], height[9])
.
(height[8], height[9])
Naive Solution - Algorithm

1.Create a nested loop, the outer loop traverses the array from 0 to end (index of this
loop is i).
2.The inner loop traverses the height array from i + 1 to end (index of this loop is j).
3.Find the water that can be contained in the container with height of boundaries as
height[i] and height[j]
●
area = (j – i)* min(height[i],height[j]), if this area is greater than current maximum, update the current
maximum

●
4.Print the current maximum.
Better Solution - Maximization with two pointers

You will be given the height array denoting the height of the
columns
You have to select two columns that trap the maximum
columns
For now, let us consider the two columns to be the first and
last columns in the array
Let this be the current maximum water trapped i.e. current
maximum area of the “rectangle”
Let us consider the two indices as x and y. Now x = 0, and y =
n-1 (where n is the size of the array)
Better Solution - Maximization with two pointers

We need to check for other possibilities of x

and y too
We should advance the pointers. i.e. either
increment x or decrement y
But how do we increment/decrement x and y
We use an algorithm to do it
Better Solution - Algorithm

1.Keep two index, x= 0 and y= n-1 and a value

max_area that stores the maximum area
2.Run a loop until x is less than the y.
3.Update the max_area with maximum of
max_area and min(height[x] , height[y])*(y-x)
4.if the value at height[x] is greater the height[y]
then update last as y– 1 else update first as x+ 1
Print the maximum area
Better Solution - Analysis

We increment x only if y is smaller than x,

and decrement y only if y is smaller than x
This means whichever column is smaller, we
won’t consider it again
Hence we maximize the area, and thus we
end up finding the maximum area
Post SDOT

Access to CLAP platform & Codemithra

Practice Questions on CLAP

platform
Code Snippets MCQs Programming

Mock Tests
Solutions provided and know where
you stand among your peers
 CLAP
(Codemithra Learning & Assessment Platform)

User Interface
Code Snippets
Code Snippets
MCQs
Interactive Assessments
Preparation Strategy
Training Phase in sync with Learning Levels

Training Stages Training Offerings

Baseline Test
Before (Gauge your current knowledge and prepare
accordingly)
Training and LMS access
During (Get trained on all the modules and sharpen
your skills through unlimited practice in LMS)
Mock Tests and Mock Interviews*
(Test your skills and know where you stand
After
among your peers.
Be prepared and confident for ‘The Day’)

Mock Interviews* - Students selected for next round

Course Duration

Course Type Duration (in hours) • Concept clarity from trainer and
in-depth using online LMS
Numerical aptitude 2
• Previous year questions
Verbal aptitude 2
• Online LMS for practice
Reasoning ability 2
• Mock Tests with results (actual
Programming Logic 2 duration)
Coding 4 • Quick Aptitude Booster (10 mins)

Total 12
Training Details Total Duration = 12 hours

Numerical Reasoning
Verbal aptitude Programming Logic Coding
aptitude aptitude
Data Data Types, Functions
Numbers Para Jumbles Math based
arrangements and Scope
Percentage
Series and Arrays, Variables and
and related Sentence Completion Strings
sequences Registers
topics
Ratios,
proportion and Syllogisms Synonyms and Antonyms Recursion and Iteration Matrix
variation
Blood relations
Logarithms and direction Sentence Correction Loops and File Handling Arrays
sense
Permutations
Data structure and
and Puzzles Misc Misc
Algorithms
Probability

2 hours 2 hours 2 hour 2 hour 4 hour

What more can you do?

Complete Global
Certifications

Upskill

Attend SDOT 39
Post Training Support

Continuous Engagement

College Specific Group focused towards

learning and excellence

Daily Quiz

Faster and Smooth communication on

various opportunities on learning and
placement

t.me/ethnuscodemithra Doubt clearance by peers or expert train

Post Training Support

Resume building Free eguru Mock Interview

*For those who clear the written test *For those who clear the written test
Post Training Support

Scorecard and Certificates Rewards

Get your scorecard and completion certificate for Get rewarded* for your commitment towards
assignments and tests assignments and tests
Value Adds

Company Specific Trainings

Value Adds

YouTube Sessions
Decision Checklist

Parameters Ethnus Codemithra XYZ

Expert Trainers

Content (Materials)

CLAP

Continuous Support
Telegram

Company Specific Training

YouTube Live sessions

MCQs

CHOOSE
THNUS
XCELLENCE
 /ethnuscodemithra Ethnus Codemithra /ethnus /code_mithra

THANK YOU
https://learn.codemithra.com/

codemithra@ethnus.com +91 7815 095 095 +91 9019 921 340