Skip to content

Tag Archives: BankBazaar

Position : Senior Android Developer The competency would be Tech Fit (Problem Solving, Data Structures & Algorithm) First Round:Hey geek! It's time to become a… Read More
1st Round(Hackerrank Test) Count elements in an array whose count > 1 ZeroOne problem SPOJ Only first round is contributed by author.  For more rounds,… Read More
Round 1: Online Coding Test There are n ticket sellers, each of whom has a certain amount of tickets. The price of each ticket is… Read More
Telephonic Interview Brief introduction, project you are working currently and reason for change, feedback in last review cycle and how are you working on shortcomings… Read More
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… Read More
Round 1 An online test on java/ajax & struts Round 2 1) How would you implement snakes and ladder game?(Hint: Use arrayList) 2) How would… Read More
I had an interview with Their process is online coding test followed by a telephonic and f2f interviews. Written test The person who wrote… Read More
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… Read More
Just want to share my interview experience @ so that its helpful for the aspiring ones. Total Rounds – 6 ( 2 Telephonic Technical… Read More
Two of the nodes of a Binary Search Tree (BST) are swapped. Fix (or correct) the BST.  Input Tree: 10 / \ 5 8 /… Read More
Given an array of random numbers. Find longest increasing subsequence (LIS) in the array. I know many of you might have read recursive and dynamic programming… Read More
Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least… Read More
  Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted, then… Read More
You are given a Double Link List with one pointer of each node pointing to the next node just like in a single link list.… Read More
  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… Read More

Start Your Coding Journey Now!