Open in app

Sign in

Write

Sign in

ad1tyaV
ad1tyaV

Home

About

Moving to a new city — USA

I recently moved to a new city for work, to Chicago, from Philadelphia.

May 19, 2022
Moving to a new city — USA
Moving to a new city — USA
May 19, 2022

Generate-Parentheses Brute Force to Optimal Leetcode

We use backtracking in brute force approach  1) We make a choice and hope it’s a valid one, if it happens to be valid we proceed forward…

Aug 2, 2021
Aug 2, 2021

Find if two nodes are cousins in Binary Tree

We say two nodes in a binary tree are cousins if they are on same level but have different parents

Jul 1, 2021
Find if two nodes are cousins in Binary Tree
Find if two nodes are cousins in Binary Tree
Jul 1, 2021

Rotting Oranges Leetcode

This is one of the classic BFS Problems(I guess you could solve using DFS too) and a great one too.

Jun 13, 2021
Rotting Oranges Leetcode
Rotting Oranges Leetcode
Jun 13, 2021

Diagonal Traversal of Matrix using DFS

I’ve encountered this problem in an Online Assessment(OA), the requirement was not exactly traversing diagonally, but I had to do something…

Jun 8, 2021
Diagonal Traversal of Matrix using DFS
Diagonal Traversal of Matrix using DFS
Jun 8, 2021
ad1tyaV

ad1tyaV

Following
  • Expedia Group Technology

    Expedia Group Technology

  • Derek Johnson

    Derek Johnson

  • Dariusz Kuc

    Dariusz Kuc

  • Anjali Viramgama

    Anjali Viramgama

  • Mayur Fartade

    Mayur Fartade

See all (14)

Help

Status

About

Careers

Press

Blog

Privacy

Rules

Terms

Text to speech