Learn and share programming fundamentals here

Quick Sort:

Merge Sort:

Given a sorted array of n integers that has been rotated an unknown number of times, write code to find an element in the array. You may assume that the array was originally sorted in increasing order.

A magic index in an array A[0…n-1] is defined to be an index such that A[i] = i. Given a sorted array of distinct integers, write a method to find a magic index if one exists, in an array A. FOLLOW UP: What if the values are not distinct?

Find the element that appears once in a sorted array where all other elements appear twice one after another. Find that element in 0(logn) complexity. Input: arr[] = {1, 1, 3, 3, 4, 5, 5, 7, 7, 8, 8} Output: 4 Solution : Test Cases: 1) {} 2) {1,1,5,7,7} 3) {1,1,2,2,7} 4) {2,3,3,5,5,7,7}

1) Iterative Approach 2) Recursive Approach

This article is about questions asked to LEAP candidates in their LEAP cohort-7 interview. Candidate 1:  First Interview, he asked one coding( given point and rectangle my function should return if the point lies inside the rectangle) and one design question (since i had Object Oriented Design in my resume) Second Interview was with a manager, he asked me data science question and one coding question, it was simple program to find duplicates in a String. Candidate 2:  1.In first interview, asked to implement calculator class, then once I wrote method for addition, follow up was to write it with array input and then write it in recursion. Behavioral questions, all questions asked were what projects have you done, how and what part you worked on team projects. 2. Second, was completely on choose from three areas: Collaborate, tech, & problem solving and start explaining which one is more related to you and why and then dive deep into it. asked to draw webs...