Open in app

Sign In

Write

Sign In

Anjana Sudhir
Anjana Sudhir

160 Followers

Home

About

Published in

The Code Shelf

·Pinned

Spark Query Plans for Dummies

In Spark, the query execution plan is the entry point to understanding how the spark query is executed. This is very important, especially while debugging or investigating the execution in heavy workloads, or when the job takes a long time to run. …

Programming

7 min read

Spark Query Plans for Dummies
Spark Query Plans for Dummies
Programming

7 min read


Published in

The Code Shelf

·Updated Jun 22

Are you stuck in the Dependency Hell?

A guide to dealing with Dependency Hell in Sbt — Dependency hell is a negative situation that occurs when a software application is not able to access the additional programs it requires in order to work. In sofware development, additional programs that software requires are called dependencies. …

Programming

5 min read

Are you stuck in the Dependency Hell?
Are you stuck in the Dependency Hell?
Programming

5 min read


Published in

The Code Shelf

·Feb 2, 2021

Which Stand-up Guy are you?

The Daily Scrum is an essential event for inspection and adaption, run daily to ensure that the Scrum is on its path to achieving the Sprint Goal. It helps in creating transparency, thus enabling inspection of the Scrum. Typically, a good Scrum Team won’t need more than 10 to 15…

Programming

5 min read

Which Stand-up Guy are you?
Which Stand-up Guy are you?
Programming

5 min read


Published in

The Code Shelf

·Jan 31, 2021

Are you doing your Retrospectives right?

The retrospective is a ceremony held at the end of each Sprint where team members collectively analyze how things went in order to improve the process for the next Sprint. The purpose of the Sprint Retrospective is to Inspect how the last Sprint went with regards to people, relationships, process…

Programming

5 min read

Are you doing your Retrospectives right?
Are you doing your Retrospectives right?
Programming

5 min read


Published in

The Code Shelf

·Jul 5, 2020

Day 31: The “Find Minimum in Rotated Sorted Array” Problem

Problem: Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Find the minimum element. You may assume no duplicate exists in the array. Example 1: Input: [3,4,5,1,2] Output: 1 Example 2: Input: [4,5,6,7,0,1,2] Output: 0 My Solution: def…

Coding

2 min read

Day 31: The “Find Minimum in Rotated Sorted Array” Problem
Day 31: The “Find Minimum in Rotated Sorted Array” Problem
Coding

2 min read


Published in

The Code Shelf

·Jul 4, 2020

Day 30: The “Capacity To Ship Packages Within D Days” Problem

Problem: A conveyor belt has packages that must be shipped from one port to another within D days. The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). …

3 min read

Day 30: The “Capacity To Ship Packages Within D Days” Problem
Day 30: The “Capacity To Ship Packages Within D Days” Problem

3 min read


Published in

The Code Shelf

·Jun 27, 2020

Day 29: The “Min Stack” Problem

Problem: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) — Push element x onto stack. pop() — Removes the element on top of the stack. top() — Get the top element. getMin() — Retrieve the minimum element in the stack. Example…

Coding

3 min read

Day 29: The “Min Stack” Problem
Day 29: The “Min Stack” Problem
Coding

3 min read


Published in

The Code Shelf

·Jun 25, 2020

Day 28: The “Find K Pairs with Smallest Sums” Problem

Problem: You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. Define a pair (u,v) which consists of one element from the first array and one element from the second array. Find the k pairs (u1,v1),(u2,v2) …(uk,vk) with the smallest sums. Example 1: …

Coding

2 min read

Day 28: The “Find K Pairs with Smallest Sums” Problem
Day 28: The “Find K Pairs with Smallest Sums” Problem
Coding

2 min read


Published in

The Code Shelf

·Jun 21, 2020

Setting up a “Hello World” app in Airflow using Docker Compose

So, yesterday I tried to set up Airflow for a pet project. My project basically needed Airflow to run a job every 5 mins to pull data from various sources, transform the data perhaps and write to an Elasticsearch index. I wanted to dockerize it, so I can deploy the…

Data

4 min read

Setting up a “Hello World” app in Airflow using Docker Compose
Setting up a “Hello World” app in Airflow using Docker Compose
Data

4 min read


Published in

The Code Shelf

·Jun 21, 2020

Day 27: The “Find the Duplicate Number” Problem

Problem: Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one. Example 1: Input: [1,3,4,2,2] Output: 2 Example 2: Input: [3,1,3,4,2] Output…

Coding

3 min read

Day 27: The “Find the Duplicate Number” Problem
Day 27: The “Find the Duplicate Number” Problem
Coding

3 min read

Anjana Sudhir

Anjana Sudhir

160 Followers

Senior Software Engineer & Scrum Master @ Agoda (Booking Holdings Inc.)

Following
  • Sajjad Hussain

    Sajjad Hussain

  • Ayodeji Awosika

    Ayodeji Awosika

  • Netflix Technology Blog

    Netflix Technology Blog

  • Nikhil Adithyan

    Nikhil Adithyan

  • Pier Paolo Ippolito

    Pier Paolo Ippolito

See all (197)

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams