Knowledge Base
Space shortcuts
Page tree
Skip to end of metadata
Go to start of metadata


Welcome!

Welcome to visit my knowledge base collecting knowledge associated with software.

  • Hardwares — I am planning to share knowhow what I learned while using my devices here.
    • Logitech K580 — Logitech K580 is wireless keyboard supporting USB as well as Bluetooth connection. In addition, it provides mobile device holder to maximize its usability. In order to optimize its keyboard environment with Mac OSX, you should simply click fn + O for 3 secs, Windows is fn + P for 3 secs. You can also connect with your mobile devices as well.
  • Technologies
  • Tech companies
    • Context Logic (aka Wish) — "Context Logic" has a service, which is named as Wish - an online e-commerce platform that facilitates transactions between sellers and buyers. It was founded in 2010 by Peter Szulczewski (CEO) and Danny Zhang (CTO).
    • Confluent — Confluent is the event streaming platform powered by Apache Kafka®
    • Asurion - mobile protection by insurance — Asurion, LLC is a privately held company based in Nashville, Tennessee that provides insurance for smartphones, tablets, consumer electronics, appliances, satellite receivers and jewelry. In 2014, the company operated in 14 countries and had 49 offices with 17,000 employees serving 280 million consumers.
    • AppLovin — AppLovin is a mobile marketing platform. The company was founded in 2012, but operated in stealth mode until 2014. 
    • Social Finance (SoFi) — Social Finance, Inc. (commonly known as SoFi) is an online personal finance company that provides student loan refinancing, mortgages and personal loans.
    • Roblox — Roblox is a massively multiplayer online and game creation system platform that allows users to design their own games and play a wide variety of different types of games created by other users. The platform hosts social network games constructed of Lego-like virtual blocks.
    • Freshworks — Freshworks has apps for small and medium businesses which cater those companies software need in customer support, Asset management, Sales & CRM and more.
    • GitHub — GitHub is an American company that provides hosting for software development version control using Git. It is a subsidiary of Microsoft, which acquired the company in 2018 for $7.5 billion.
    • Aidditive Inc — Addictive develops total solutions for finance, public safety and surveillance, media and broadcasting, transportation, healthcare and etc.
    • Uptake — Uptake is an industrial artificial intelligence (AI) software company that aims to help companies digitally transform with open, purpose-built software. Built around a foundation of data science and machine learning, Uptake’s core products include an Asset Performance Management application and a fully managed platform.
    • IDC (International Data Corporation)
    • dunnhumby
    • Tanium
    • Robinhood
    • Niantic
    • Flexport
    • Unity Technologies
  • Software Architectures
  • Software Algorithms — In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ( listen)) is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing, and automated reasoning tasks.
    • Safe Add function by checking integer overflow — When we implement add function by operator + in C++, sometimes we face over error - actually system does not show any error and that should be continuously increased, but there is a possibility to change into minus value suddenly.
    • Next Permutation ★ — Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order). The replacement must be in-place and use only constant extra memory.
    • Find First and Last Position of Element in Sorted Array — Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n).
    • Maximum Width Ramp ★ — Given an array A of integers, a ramp is a tuple (i, j) for which i < j and A[i] <= A[j]. The width of such a ramp is j - i. Find the maximum width of a ramp in A. If one doesn't exist, return 0.
    • Flip Equivalent Binary Trees — For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree X is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip operations. Write a function that determines whether two binary trees are flip equivalent. The trees are given by root nodes root1 and root2.
    • Remove Element — Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. The order of elements can be changed. It doesn't matter what you leave beyond the new length.
    • Remove Duplicates from Sorted Array — Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
    • Reverse Nodes in k-Group — Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
    • Swap Nodes in Pairs — Given a linked list, swap every two adjacent nodes and return its head.
    • Generate Parentheses — Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
    • Merge Two Sorted Lists — Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
    • Valid Parentheses — Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
    • Pow(x, n) — Implement pow(x, n), which calculates x raised to the power n (xn).
    • Remove Nth Node From End of List — Given a linked list, remove the n-th node from the end of list and return its head.
    • Longest Common Prefix — Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "".
    • Roman to Integer — Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
    • Integer to Roman — Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
    • String to Integer (atoi) — Implement atoi which converts a string to an integer.
    • Reverse Integer — Given a 32-bit signed integer, reverse digits of an integer.
    • ZigZag Conversion — The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
    • Longest Palindromic Substring — Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
    • Merge k Sorted Lists — Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
    • Median of Two Sorted Arrays — There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
    • Longest Substring Without Repeating Characters — Given a string, find the length of the longest substring without repeating characters.
    • Two Sum — Given an array of integers, return indices of the two numbers such that they add up to a specific target.
    • Climbing Stairs ★ — You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
    • Add Two Numbers — You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
    • 4Sum — Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
    • 3Sum — 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.
  • Sports

Recently updated

Show More Please wait


 Browse by topic

  1. A
  2. B
  3. C
  4. D
  5. E
  6. F
  7. G
  8. H
  9. I-J
  10. K-L
  11. M
  12. N-O
  13. P
  14. Q
  15. R
  16. S
  17. T
  18. U-V
  19. W-Z
  20. 한
  21. 0-9



  • No labels