contest

Author: piyushkhemka

Diff for: 513. Find Bottom Left Tree Value.cpp

@@ -0,0 +1,37 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+
+    void helper(TreeNode *root, pair<int,int> &value, int level) {
+
+        if (!root)
+            return;
+
+        if (level > value.first) {
+            value.first = level;
+            value.second = root->val;
+        }
+
+        helper(root->left, value, level+1);
+        helper(root->right, value, level+1);
+
+    }
+
+
+public:
+    int findBottomLeftValue(TreeNode* root) {
+
+        pair<int, int> value = make_pair(-1,-1); // level, value
+
+        helper(root, value, 0);
+        return value.second;
+
+    }
+};

Diff for: 520. Detect Capital.cpp

@@ -0,0 +1,39 @@
+class Solution {
+public:
+    bool detectCapitalUse(string word) {
+
+        bool small = false;
+        bool big = false;
+
+        if (word.size() <= 1)
+            return true;
+
+        if (islower(word[0]))
+            small = true;
+
+        else if (isupper(word[0])) {
+            big = true;
+
+            if (islower(word[1])) {
+                big = false;
+                small = true;
+            }
+        }
+
+        for(int i = 1;i<word.length(); ++i) {
+
+            if (small && islower(word[i]))
+                continue;
+
+            else if(big && isupper(word[i]))
+                continue;
+
+            else
+                return false;
+
+        }
+
+        return true;
+
+    }
+};