Problem 1 Min Max Game You are given a 0-indexed integer array nums whose length is a power of 2. Apply the following algorithm on nums: Let n be the length of nums. If n == 1, end the process. Otherwise, create a new 0-indexed integer array newNums of length n / 2. For every…

Dealing with exceptions in python is straightforward. You would surround your code with try-catch blocks. The exception message to be captured/processed will be mentioned as a variable in the except block. 1. Catching Exceptions Let’s assume this is our block of code def fun(): try…

In the recent projects I’ve worked on, we decided to move on the direction of a microservice architecture pattern. The motivation behind such a move was to overcome the difficulties faced in the monolith architecture and based on our requirements as well. RabbitMQ is a component on which we heavily…

Sometimes we would require to handle multiple git accounts say a personal one and one associated with work. It can become frustrating to switch between accounts while committing or pushing any changes. Changing names manually One way to tackle this is to set the name and email before committing the changes. git config…

Here I am with another problem! Problem Implement a job scheduler which takes in a function f and an integer n, and calls f after n milliseconds. Solution1: Direct implementation The straightforward approach will be to write a function that takes a function and an integer as arguments, that waits for n milliseconds and…

Problem This problem was asked by Google. An XOR linked list is a more memory efficient doubly linked list. Instead of each node holding next and prev fields, it holds a field named both, which is an XOR of the next node and the previous node. …

Problem This problem was asked by Jane Street. cons(a, b) constructs a pair, and car(pair) and cdr(pair) returns the first and last element of that pair. For example, car(cons(3, 4)) returns 3, and cdr(cons(3, 4)) returns 4. Given this implementation of cons: def cons(a, b): def pair(f): return f(a, b) return…

Here I am with another problem! Problem There exists a staircase with N steps, and you can climb up either 1 or 2 steps at a time. Given N, write a function that returns the number of unique ways you can climb the staircase. The order of the steps matters. For…

Here I am with another problem!. Problem Implement an autocomplete system. That is, given a query string s and a set of all possible query strings, return all strings in the set that have s as a prefix. For example, given the query string de and the set of strings [dog, deer, deal], return [deer, deal]. Hint: Try pre-processing the dictionary into a more efficient data structure to speed up queries.