Learn. Win big.

“ I would attend classes after office, but it never felt like a burden. I looked forward to learning more every day. I would keep solving questions on the Scaler website even in my office breaks. I learnt more at Scaler than I had even in college. ”

“ I had joined Scaler mainly for learning. And the one thing that kept me motivated throughout was seeing the hard work all teachers put, taking classes everyday tirelessly late into the night. ”

Be able to discuss the big-O complexity of your approaches. Don't forget to brush up on your data structures like lists, arrays, hash tables, hash maps,
stacks, queues, graphs, trees, heaps. Also sorts, searches, and traversals(BFS, DFS). Also review recursion and iterative approaches.

Use the programming language you're best at. It's important to write your solution correctly and in time, so use the language you are most familiar with.

Find and fix the bugs by yourself: Don't wait for the interviewer to find them for you.

Use the hints you are given: Usually, the interviewer knows the question well enough to know which hints will help you next if you get stuck.

Find and fix the bugs by yourself: Don't wait for the interviewer to find them for you.

Use the hints you are given: Usually, the interviewer knows the question well enough to know which hints will help you next if you get stuck.

Given an array of size n, find the majority element. The majority element is the element that appears more than floor(n/2) times.
You may assume that ...

There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following re...

Find the longest increasing subsequence of a given array of integers, A.
In other words, find a subsequence of array in which the subsequence’s elemen...

Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing all ones and return its area.
Bonus if you can solve it in O(n...

Find the contiguous subarray within an array (containing at least one number) which has the largest product.
Return an integer corresponding to the max...

Implement wildcard pattern matching with support for ‘?’ and ‘*’ for strings A and B.
’?’ : Matches any single character.
‘*’ : Matches any seq...

Given two strings A and B, find the minimum number of steps required to convert A to B. (each operation is counted as 1 step.)
You have the following ...

Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding elemen...

Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1-...

Given a singly linked list
L: L0 → L1 → … → Ln-1 → Ln,
reorder it to:
L0 → Ln → L1 → Ln-1 → L2 → Ln-2 → …
You must do this in-place wit...