BankBazaar

20+ posts

Recent articles

C++ Program for Search an element in a sorted and rotated array

Last Updated: 19 September 2023

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Arrays

Microsoft

Amazon

Adobe

Python3 Program for Search an element in a sorted and rotated array

Last Updated: 19 September 2023

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Javascript Program for Search an element in a sorted and rotated array

Last Updated: 19 September 2023

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Similar Topics

DSA

21k+ articles

Arrays

6.4k+ articles

Amazon

1.8k+ articles

Microsoft

820+ articles

Samsung

330+ articles

Adobe

270+ articles

Flipkart

230+ articles

Paytm

220+ articles

MakeMyTrip

210+ articles

FactSet

120+ articles

C Program for Search an element in a sorted and rotated array

Last Updated: 11 December 2021

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

C++ Program For Counting Inversions In An Array - Set 1 (Using Merge Sort)

Last Updated: 13 December 2021

Inversion Count for an array indicates - how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array...read more

Javascript Program For Counting Inversions In An Array - Set 1 (Using Merge Sort)

Last Updated: 13 December 2021

Inversion Count for an array indicates - how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array...read more

Java Program for Search an element in a sorted and rotated array

Last Updated: 19 September 2023

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

BankBazaar.com Interview Experience | Set 7 (For Senior Android Developer)

Last Updated: 08 June 2017

Position : Senior Android DeveloperThe competency would be Tech Fit (Problem Solving, Data Structures Algorithm) First Round:Telephonic Round:1. Clone a linked list with ...read more

Arrays

Linked List

Interview Experiences

Print all Jumping Numbers smaller than or equal to a given value

Last Updated: 01 February 2023

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not considered as 1.All single digit numbers are con ...read more

Clone a linked list with next and random pointer | Set 2

Last Updated: 10 January 2023

We have already discussed 2 different ways to clone a linked list. In this post, one more simple method to clone a linked list is discussed.Recommended PracticeClone a lin ...read more

Two nodes of a BST are swapped, correct the BST

Last Updated: 21 March 2023

Two of the nodes of a Binary Search Tree (BST) are swapped. Fix (or correct) the BST.Input: x = 20, y = 8 10 / \ 5 8 / \ 2 20Output: 10 / \ 5 20 / \2 8 ...read more

Longest Increasing Subsequence Size (N log N)

Last Updated: 20 October 2023

Given an array arr[] of size N, the task is to find the length of the Longest Increasing Subsequence (LIS) i.e., the longest possible subsequence in which the elements of ...read more

Detect Cycle in a Directed Graph

Last Updated: 06 November 2023

Given the root of a Directed graph, The task is to check whether the graph contains a cycle or not.Examples:Input: N = 4, E = 6 Output: YesExplanation: The diagram clearly...read more

Inversion count in Array using Merge Sort

Last Updated: 28 July 2023

Inversion Count for an array indicates - how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array...read more

Search an element in a sorted and rotated Array

Last Updated: 20 July 2023

Given a sorted and rotated array arr[] of size N and a key, the task is to find the key in the array.Note: Find the element in O(logN) time and assume that all the element ...read more

1 2 >>

1 2 >>

1 2 >>