Debakar Roy

Delete stale git branches

Sat, 03 Feb 2024 00:00:00 GMT

Deleting stale git branches Working on monolithic projects with a large team of developers often leads to an accumulation of stale git branches. These branches may be left behind due to unresolved merge conflicts, abandoned tasks, or even employee turnover. Over time, this can result in repositories with thousands of inactive branches, potentially affecting your CI/CD process and increasing the time taken for git clone operations. To address this, we can implement a process to identify and delete stale branches that have been inactive for a certain period, say 120 days.

Day 29: Docker - Running and managing containers

Wed, 17 May 2023 00:00:00 GMT

Content Part 1: Introduction to DevOps Day 1: Understanding DevOps, its principles, and benefits Day 2: Exploring the DevOps lifecycle and its stages Day 3: Introduction to Continuous Integration (CI) and Continuous Deployment (CD) Day 4: Familiarizing with common DevOps tools and technologies Day 5: Studying DevOps culture and best practices Part 2: Version Control Systems Day 6: Introduction to Git Day 7: Basic Git commands (git init, git add, git commit, git status) Day 8: Branching and merging in Git Day 9: Remote repositories and collaboration with Git Day 10: Git workflows and best practices Part 3: Continuous Integration and Continuous Deployment (CI/CD)

Day 28: Docker - Building and managing images

Tue, 16 May 2023 00:00:00 GMT

Day 27: Docker - Installation and configuration

Mon, 15 May 2023 00:00:00 GMT

Day 26: Introduction to containerization

Sun, 14 May 2023 00:00:00 GMT

Serverless Workflow to Process Files Uploaded to Amazon S3

Sat, 13 May 2023 00:00:00 GMT

This is going to be a walkthrough of one of the LAB I did in Udemy to build Serverless Workflow in AWS. The task of the LAB was to take any JSON file uploaded in S3 bucket and store the data from that in DynamoDB. Source code for diagram from diagrams import Cluster, Diagram from diagrams.aws.compute import Lambda from diagrams.aws.database import Dynamodb from diagrams.aws.integration import SQS from diagrams.aws.storage import S3 with Diagram("Serverless Workflow", graph_attr={"margin": "-1"}, show=False): with Cluster("Amazon S3"): s3_bucket = S3("JSONFilesBucket") with Cluster("AWS SQS"): dlq = SQS("DeadLetterQueue") json_processing_queue = SQS("JSONProcessingQueue") json_processing_queue - dlq with Cluster("AWS Lambda"): lambda_function = Lambda("ProcessJSONFiles") with Cluster("Amazon DynamoDB"): dynamodb_table = Dynamodb("JSONItemTable") s3_bucket >> json_processing_queue >> lambda_function >> dynamodb_table Thing it covers:

Day 25: CloudFormation (AWS) - Overview and comparison

Sat, 13 May 2023 00:00:00 GMT

Day 24: Terraform - Modules and best practices

Fri, 12 May 2023 00:00:00 GMT

Day 23: Terraform - Writing and applying configuration files

Thu, 11 May 2023 00:00:00 GMT

Day 22: Terraform - Installation and configuration

Wed, 10 May 2023 00:00:00 GMT

Day 21: Introduction to Infrastructure as Code (IaC)

Tue, 09 May 2023 00:00:00 GMT

Day 20: Puppet and Chef - Overview and comparison

Mon, 08 May 2023 00:00:00 GMT

Day 19: Ansible - Roles and best practices

Sun, 07 May 2023 00:00:00 GMT

Day18: Ansible - Ad-hoc commands and playbooks

Sat, 06 May 2023 00:00:00 GMT

Day 17: Ansible - Installation and configuration

Fri, 05 May 2023 00:00:00 GMT

Day 16: Introduction to configuration management

Thu, 04 May 2023 00:00:00 GMT

Day 15: Jenkins - Pipelines and best practices

Wed, 03 May 2023 00:00:00 GMT

Day 14: Jenkins - Integrating with

Tue, 02 May 2023 00:00:00 GMT

Day 13: Jenkins - Creating and managing jobs

Mon, 01 May 2023 00:00:00 GMT

Day 12: Jenkins - Installation and configuration

Sat, 29 Apr 2023 00:00:00 GMT

Day 11: Introduction to CI/CD

Fri, 28 Apr 2023 00:00:00 GMT

Day 10: Git workflows and best practices

Thu, 27 Apr 2023 00:00:00 GMT

Day 9: Remote repositories and collaboration with Git

Wed, 26 Apr 2023 00:00:00 GMT

Day 8: Branching and merging in Git

Tue, 25 Apr 2023 00:00:00 GMT

Day 7: Basic Git commands (`git init`, `git add`, `git commit`, `git status`)

Sat, 22 Apr 2023 00:00:00 GMT

Day 5: Studying DevOps culture and best practices

Fri, 21 Apr 2023 00:00:00 GMT

Day 6: Introduction to Git

Fri, 21 Apr 2023 00:00:00 GMT

Day 4: Familiarizing with common DevOps tools and technologies

Wed, 19 Apr 2023 00:00:00 GMT

Day 3: Introduction to Continuous Integration (CI) and Continuous Deployment (CD)

Tue, 18 Apr 2023 00:00:00 GMT

Day 2: Exploring the DevOps lifecycle and its stages

Mon, 17 Apr 2023 00:00:00 GMT

Day 1: Understanding DevOps, its principles, and benefits

Sun, 16 Apr 2023 00:00:00 GMT

[LeetCode] 108. Convert Sorted Array to Binary Search Tree

Fri, 06 Sep 2019 00:00:00 GMT

Convert Sorted Array to Binary Search Tree Link to original Problem on LeetCode Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1. Example: Given the sorted array: [-10,-3,0,5,9], One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

[LeetCode] 384. Shuffle an Array

Fri, 06 Sep 2019 00:00:00 GMT

Shuffle an Array Link to original Problem on LeetCode Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. int[] nums = {1,2,3}; Solution solution = new Solution(nums); // Shuffle the array [1,2,3] and return its result. Any permutation of [1,2,3] must equally likely to be returned. solution.shuffle(); // Resets the array back to its original configuration [1,2,3]. solution.reset(); // Returns the random shuffling of array [1,2,3].

[LeetCode] 171. Excel Sheet Column Number

Thu, 05 Sep 2019 00:00:00 GMT

Excel Sheet Column Number Link to original Problem on LeetCode Given a column title as appear in an Excel sheet, return its corresponding column number. For example: Example 1: Input: “A” Output: 1 Example 2: Input: “AB” Output: 28 Example 3: Input: “ZY” Output: 701 Company: Amazon Solution (Using Hash Map): Time Complexity: O(n) Space Complexity: O(1) class Solution(object): def titleToNumber(self, s): """ :type s: str :rtype: int """ # First create a dictionary containing key 'A' to 'Z' # assigning 'A': 1, 'B': 2, 'C': 3, .

[LeetCode] 230. Kth Smallest Element in a BST

Thu, 05 Sep 2019 00:00:00 GMT

Kth Smallest Element in a BST Link to original Problem on LeetCode Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST’s total elements. Example 1: Input: root = [3,1,4,null,2], k = 1 Output: 1 Example 2: Input: root = [5,3,6,2,4,null,null,1], k = 3 Output: 3 Follow up: What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently?

[LeetCode] 122. Best Time to Buy and Sell Stock II

Wed, 04 Sep 2019 00:00:00 GMT

Best Time to Buy and Sell Stock II Link to original Problem on LeetCode Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times). Note: You may not engage in multiple transactions at the same time (i.

[LeetCode] 217. Contains Duplicate

Wed, 04 Sep 2019 00:00:00 GMT

Contains Duplicate Link to original Problem on LeetCode Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct. Example 1: Input: [1,2,3,1] Output: true Example 2: Input: [1,2,3,4] Output: false Example 3: Input: [1,1,1,3,3,4,3,2,4,2] Output: true Company: Amazon Solution (Using Sorting): Time Complexity: O(n log n) Space Complexity: O(1)

[LeetCode] 13. Roman to Integer

Wed, 28 Aug 2019 00:00:00 GMT

Roman to Integer Link to original Problem on LeetCode Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVIIi, which is XX + V + II.

[LeetCode] 169. Majority Element

Tue, 27 Aug 2019 00:00:00 GMT

Majority Element Link to original Problem on LeetCode Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2 Company: Yahoo, Google, Amazon, Microsoft Solution (Using Hashing - 2 pass):

[LeetCode] 78. Subsets

Thu, 08 Aug 2019 00:00:00 GMT

Subsets Link to original Problem on LeetCode Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Example: Input: nums = [1,2,3] Output: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ] Company: Amazon, Microsoft Solution (Using Iteration): Time Complexity: Space Complexity: class Solution(object): def subsets(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ # Let's take an example, say we have nums = [1, 2, 3] # Initially we have an empty subset in the result i.

[LeetCode] 347. Top K Frequent Elements

Fri, 02 Aug 2019 00:00:00 GMT

Top K Frequent Elements Link to original Problem on LeetCode Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input: nums = [1], k = 1 Output: [1] Note: You may assume k is always valid, 1 ≤ k ≤ number of unique elements. Your algorithm’s time complexity must be better than O(n log n), where n is the array’s size.

[LeetCode] 237. Delete Node in a Linked List

Thu, 25 Jul 2019 00:00:00 GMT

Delete Node in a Linked List Link to original Problem on LeetCode Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Given linked list – head = [4,5,1,9], which looks like following: Example 1: Input: head = [4,5,1,9], node = 5 Output: [4,1,9] Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.

[LeetCode] 283. Move Zeroes

Thu, 25 Jul 2019 00:00:00 GMT

Move Zeroes Link to original Problem on LeetCode Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,0] Note: You must do this in-place without making a copy of the array. Minimize the total number of operations. Company: Amazon, Bloomberg, Paytm, Samsung Solution: Time Complexity: O(n) Space Complexity: O(1) class Solution(object): def moveZeroes(self, nums): """ :type nums: List[int] :rtype: None Do not return anything, modify nums in-place instead.

[LeetCode] 238. Product of Array Except Self

Wed, 24 Jul 2019 00:00:00 GMT

Product of Array Except Self Link to original Problem on LeetCode Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Example: Input: [1,2,3,4] Output: [24,12,8,6] Note: Please solve it without division and in O(n). Follow up: Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.

[LeetCode] 206. Reverse Linked List

Wed, 24 Jul 2019 00:00:00 GMT

Reverse Linked List Link to original Problem on LeetCode Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? Company: Adobe, Amazon, MakeMyTrip, Microsoft, Qualcomm, Samsung Solution (Iterative): Time Complexity: Space Complexity: class Solution(object): def reverseList(self, head): """ :type head: ListNode :rtype: ListNode """ # Video Explanation: https://youtu.be/sYcOK51hl-A # Credit: mycodeschool prev = None curr = head while curr: next = curr.

[LeetCode] 22. Generate Parentheses

Tue, 23 Jul 2019 00:00:00 GMT

Generate Parentheses Link to original Problem on LeetCode Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ “((()))”, “(()())”, “(())()”, “()(())”, “()()()” ] Company: Microsoft, Facebook Solution (Backtracking and Recursion): Time Complexity: Space Complexity: class Solution(object): def generateParenthesis(self, n): """ :type n: int :rtype: List[str] """ result = [] self.generateParenthesisHelper(n, n, "", result) return result def generateParenthesisHelper(self, left, right, path, result): if left > right: return if left == 0 and right == 0: result.

[Leetcode] 104. Maximum Depth of Binary Tree

Tue, 23 Jul 2019 00:00:00 GMT

Maximum Depth of Binary Tree Link to original Problem on LeetCode Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null,null,15,7], return its depth = 3. Company: Goldman Sachs, Facebook, Bloomberg, Microsoft Solution (Iterative using breadth first search):

[LeetCode] 46. Permutations

Tue, 23 Jul 2019 00:00:00 GMT

Permutations Link to original Problem on LeetCode Given a collection of distinct integers, return all possible permutations. Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1] ] Company: Microsoft, Adobe, Google Solution (Backtracking and Recursion): Time Complexity: Space Complexity: class Solution(object): def permute(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ result = [] self.permuteHelper(nums, [], result) return result def permuteHelper(self, nums, path, result): if not nums: result.append(path) for i in range(len(nums)): self.

[LeetCode] 344. Reverse String

Tue, 23 Jul 2019 00:00:00 GMT

Reverse String Link to original Problem on LeetCode Write a function that reverses a string. The input string is given as an array of characters char[]. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. You may assume all the characters consist of printable ascii characters. Example 1: Input: [“h”,“e”,“l”,“l”,“o”] Output: [“o”,“l”,“l”,“e”,“h”] Example 2: Input: [“H”,“a”,“n”,“n”,“a”,“h”] Output: [“h”,“a”,“n”,“n”,“a”,“H”]

[LeetCode] 136. Single Number

Tue, 23 Jul 2019 00:00:00 GMT

Single Number Link to original Problem on LeetCode Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input: [2,2,1] Output: 1 Example 2: Input: [4,1,2,1,2] Output: 4 Company: Amazon Solution (Using HashMap): Time Complexity: O(n) Space Complexity: O(n) class Solution(object): def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ # Keep a dictionary count and at the end just check whether any number has a count of 1 numCount = {} for num in nums: numCount[num] = numCount.

[LeetCode] 15. 3Sum

Mon, 17 Jun 2019 00:00:00 GMT

3Sum Link to original Problem on LeetCode Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. Example: Given array nums = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ]

[LeetCode] 53. Maximum Subarray

Mon, 17 Jun 2019 00:00:00 GMT

Maximum Subarray Link to original Problem on LeetCode Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6. Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle. Company: Facebook, Paypal, Yahoo, Microsoft, LinkedIn, Amazon, Goldman Sachs

[LeetCode] 268. Missing Number

Mon, 17 Jun 2019 00:00:00 GMT

Missing Number Link to original Problem on LeetCode Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array. Example 1: Input: [3,0,1] Output: 2 Example 2: Input: [9,6,4,2,3,5,7,0,1] Output: 8 Note: Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity? Company: Amazon, Google Solution 1 (Using XOR): class Solution(object): def missingNumber(self, nums): """ :type nums: List[int] :rtype: int """ # We know XOR of same number is 0 # We also know that len(nums) is present in the list # iff it is not the number which is absent # So we keep len(nums) in result result = len(nums) # Then we loop through each number # and XOR the result with index and number for i, num in enumerate(nums): result ^= i result ^= num # By the end the absent number will be present in result return result Solution 2 (Using Sum):

[LeetCode] 88. Merge Sorted Array

Mon, 17 Jun 2019 00:00:00 GMT

Merge Sorted Array Link to original Problem on LeetCode Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. Example: Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3

[LeetCode] 905. Sort Array By Parity

Mon, 17 Jun 2019 00:00:00 GMT

Sort Array By Parity Link to original Problem on LeetCode Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A. You may return any answer array that satisfies this condition. Example 1: Input: [3,1,2,4] Output: [2,4,3,1] The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted. Note: 1 <= A.length <= 5000 0 <= A[i] <= 5000

[LeetCode] 94. Binary Tree Inorder Traversal

Wed, 15 May 2019 00:00:00 GMT

Binary Tree Inorder Traversal Link to original Problem on LeetCode Given a binary tree, return the inorder traversal of its nodes’ values. Example: Output: [1, 2, 3] Follow up: Recursive solution is trivial, could you do it iteratively? Company: Microsoft, Amazon Recursive Solution: # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def inorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ # Runtime: 12 ms # Memory Usage: 11.

[LeetCode] 145. Binary Tree Postorder Traversal

Wed, 15 May 2019 00:00:00 GMT

Binary Tree Postorder Traversal Link to original Problem on LeetCode Given a binary tree, return the postorder traversal of its nodes’ values. Example: Output: [3,2,1] Follow up: Recursive solution is trivial, could you do it iteratively? Company: Microsoft, Amazon Recursive Solution: # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def postorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ # Runtime: 16 ms # Memory Usage: 11.

[LeetCode] 144. Binary Tree Preorder Traversal

Wed, 15 May 2019 00:00:00 GMT

Binary Tree Preorder Traversal Link to original Problem on LeetCode Given a binary tree, return the preorder traversal of its nodes’ values. Example: Output: [1, 3, 2] Follow up: Recursive solution is trivial, could you do it iteratively? Company: Microsoft, Amazon Recursive Solution: # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def preorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ # Runtime: 16 ms # Memory Usage: 11.

[LeetCode] 3. Longest Substring Without Repeating Characters

Tue, 14 May 2019 00:00:00 GMT

Longest Substring Without Repeating Characters Link to original Problem on LeetCode Given a string, find the length of the longest substring without repeating characters. Example 1: Input: “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Example 2: Input: “bbbbb” Output: 1 Explanation: The answer is “b”, with the length of 1. Example 3: Input: “pwwkew” Output: 3 Explanation: The answer is “wke”, with the length of 3.

[LeetCode] 1. Two Sum

Tue, 14 May 2019 00:00:00 GMT

Two Sum Link to original Problem on LeetCode Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].

Coding Interview: Warm Up

Mon, 13 May 2019 00:00:00 GMT

FizzBuzz Link to original Problem on LeetCode Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three, it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”. Example: n = 15, Return: [ “1”, “2”, “Fizz”, “4”, “Buzz”, “Fizz”, “7”, “8”, “Fizz”, “Buzz”, “11”, “Fizz”, “13”, “14”, “FizzBuzz” ]

TensorFlow Basic

Fri, 26 Jan 2018 00:00:00 GMT

TensorFlow Basic I made this post for revision purpose. This post contains most of the tensorflow basics and how does they work in a sense. Most of the code is beginner friendly. There is no need for pre-requisite programming knowledge of tensorflow in any sense to go through this notebook, but you should have a basic understanding of Python and how array works in general (also if you have a knowledge of AI, that would be great).

Building a Restful API using JAX-RS

Wed, 27 Sep 2017 00:00:00 GMT

1. What are the tools needed? 2. Basic setup 3. Setting up Tomcat Server and Postman 4. Structure 5. Book Model 6. Book Database 7. Book Services 8. Book Resource 9. GET 10. PUSH 11. PUT 12. DELETE 13. Query -Get Book(s) by title -Get Book(s) by subject ID Another thing we are going to use is called Postman. Postman is an HTTP Request composer. It helps you test your API in a very efficient way.

Understanding the very first few lines of basic C++ code

Sun, 20 Aug 2017 00:00:00 GMT

So most of the students in Computer Science Department of a B.Tech college have written code in C++ at some point in their life. Let me begin with a small code snippet. #include using namespace std; namespace abc { int a = 100; } int a = 200; int main() { int a = 300; cout << "abc::a = " << abc::a << endl; cout << "::a = " <<::a << endl; cout << "a = " << a << endl; return (0); } Running the code produce this output:

[OOP (CS 594D)] Assignment 1

Sun, 06 Aug 2017 00:00:00 GMT

Assignment 1 Write a Java program to print “Hello World”. Source code: public class HelloWorldnormal { public static void main(String[] args) { System.out.println("Hello World"); } } Output: $ javac HelloWorldnormal.java $ java HelloWorldnormal Hello World Write a Java program to.pront “Hello World”, where ‘World’ will be taken from command line argument. Source code: public class HelloWorldCLA { public static void main(String[] args) { System.out.println("Hello " + args[0]); } } Output:

[Training] DBMS with Oracle Day 5

Thu, 27 Jul 2017 00:00:00 GMT

This time I am a bit late. Actually, my college started so it took me some time to write-up my next blog post. Anyways, today we are going to have a look at PL/SQL Cursor, Procedure, Function, and Trigger. This will complete the very basics of PL/SQL. So what is cursor? Cursor is a pointer to a memory area called context area(Actually it is a pointer to a row). Whenever you use SELECT or any DML (INSERT, DELETE, UPDATE or MERGE) then cursor holds the rows (one or more) returned by a SQL statement.

[Training] DBMS with Oracle Day 4

Mon, 24 Jul 2017 00:00:00 GMT

If you are reading this then I want to notify you that this is the 3rd part of the series of blog post I am writing up about basically DBMS with Oracle. If you haven’t yet read my previous post then feel free to go to this link for part 1 and this link for part 2. Now today we are going to look at something called PL/SQL and also we will do some exercise to get a grip of PL/SQL.

[Training] DBMS with Oracle Day 3

Thu, 20 Jul 2017 00:00:00 GMT

So in this blog basically we are going to cover up the things done by me on the second day of my Oracle DBMS Training. Although I am not going to use the same schema I used during the 2nd day of my training. So without further delay, lets dig in. First thing first. What is a schema? This is something I should have mentioned in the first blog. In general, a schema is a set of tables, sproc(stored procedure) and other objects that make up a whole database.

[Training] DBMS with Oracle Day 1

Tue, 18 Jul 2017 00:00:00 GMT

In this post, I am going to wrap up all the things I learned during my first class on ‘DBMS with Oracle’. The training lecture is given by ‘Rahul Sohal’, CTO & Resource Management Lead of iandwe.in. So first of all what is database? A database is a collection of information kept an organized way, for the ease of retrieval. Facebook has its own database. Think about yesterday when you logged in your account and like all those posts, share certain stuff, commented on a picture.

How to build a reddit to twitter bot

Mon, 19 Jun 2017 00:00:00 GMT

First of all what will be this bot doing actually? Ans. This bot will be tweeting any new post on a particular subreddit to your twitter bot account. In my case it will be tweeting any new tweets from /r/anime Can I have a look on the finished product? Ans. Here you go So what do I actually need to create the bot? Ans. Some Basic Programming knowlegde and how to run terminal.

Debakar Roy

Delete stale git branches

Day 29: Docker - Running and managing containers

Day 28: Docker - Building and managing images

Day 27: Docker - Installation and configuration

Day 26: Introduction to containerization

Serverless Workflow to Process Files Uploaded to Amazon S3

Day 25: CloudFormation (AWS) - Overview and comparison

Day 24: Terraform - Modules and best practices

Day 23: Terraform - Writing and applying configuration files

Day 22: Terraform - Installation and configuration

Day 21: Introduction to Infrastructure as Code (IaC)

Day 20: Puppet and Chef - Overview and comparison

Day 19: Ansible - Roles and best practices

Day18: Ansible - Ad-hoc commands and playbooks

Day 17: Ansible - Installation and configuration

Day 16: Introduction to configuration management

Day 15: Jenkins - Pipelines and best practices

Day 14: Jenkins - Integrating with

Day 13: Jenkins - Creating and managing jobs

Day 12: Jenkins - Installation and configuration

Day 11: Introduction to CI/CD

Day 10: Git workflows and best practices

Day 9: Remote repositories and collaboration with Git

Day 8: Branching and merging in Git

Day 7: Basic Git commands (`git init`, `git add`, `git commit`, `git status`)

Day 5: Studying DevOps culture and best practices

Day 6: Introduction to Git

Day 4: Familiarizing with common DevOps tools and technologies

Day 3: Introduction to Continuous Integration (CI) and Continuous Deployment (CD)

Day 2: Exploring the DevOps lifecycle and its stages

Day 1: Understanding DevOps, its principles, and benefits

[LeetCode] 108. Convert Sorted Array to Binary Search Tree

[LeetCode] 384. Shuffle an Array

[LeetCode] 171. Excel Sheet Column Number

[LeetCode] 230. Kth Smallest Element in a BST

[LeetCode] 122. Best Time to Buy and Sell Stock II

[LeetCode] 217. Contains Duplicate

Top Programming Questions [Updated]

[LeetCode] 13. Roman to Integer

[LeetCode] 169. Majority Element

[LeetCode] 78. Subsets

[LeetCode] 347. Top K Frequent Elements

[LeetCode] 237. Delete Node in a Linked List

[LeetCode] 283. Move Zeroes

[LeetCode] 238. Product of Array Except Self

[LeetCode] 206. Reverse Linked List

[LeetCode] 22. Generate Parentheses

[Leetcode] 104. Maximum Depth of Binary Tree

[LeetCode] 46. Permutations

[LeetCode] 344. Reverse String

[LeetCode] 136. Single Number

[LeetCode] 15. 3Sum

[LeetCode] 53. Maximum Subarray

[LeetCode] 268. Missing Number

[LeetCode] 88. Merge Sorted Array

[LeetCode] 905. Sort Array By Parity

[LeetCode] 94. Binary Tree Inorder Traversal

[LeetCode] 145. Binary Tree Postorder Traversal

[LeetCode] 144. Binary Tree Preorder Traversal

[LeetCode] 3. Longest Substring Without Repeating Characters

[LeetCode] 1. Two Sum

Coding Interview: Warm Up

TensorFlow Basic

Building a Restful API using JAX-RS

Understanding the very first few lines of basic C++ code

[OOP (CS 594D)] Assignment 1

[Training] DBMS with Oracle Day 5

[Training] DBMS with Oracle Day 4

[Training] DBMS with Oracle Day 3

[Training] DBMS with Oracle Day 1

How to build a reddit to twitter bot